arXiv:2602.21717cs.LGcs.DB2026-02被引 2

无需训练的表格数据压缩框架,显著提升效率并保持性能。

C$^{2}$TC: A Training-Free Framework for Efficient Tabular Data Condensation

  • 将数据压缩重构为类别自适应聚类问题,避免复杂训练
  • 在10个真实数据集上提速超100倍,且下游任务表现更优
  • 适合处理类别不平衡、异构特征的工业级表格数据

表格数据是工业关系数据库的主要形式,支撑现代数据分析与决策。但其规模增长带来巨大计算与存储压力,亟需高效学习方法。数据集压缩(DC)通过合成小而信息丰富的数据集,在降低存储与训练成本的同时保留数据效用。然而现有方法依赖复杂的梯度优化,计算开销大,且忽视表格数据的异构特征与类别不平衡特性。为此,我们提出首个无需训练的表格数据压缩框架C²TC,通过重新构建为类别自适应聚类分配问题(CCAP),实现标签自适应分配以缓解类别不平衡,并设计启发式局部搜索(HFILS)高效求解。此外,提出混合分类特征编码(HCFE)以保留离散属性语义。在10个真实数据集上的实验表明,C²TC相较先进基线效率提升至少两个数量级,同时获得更优下游性能。

原文摘要 · Abstract (English)

Tabular data is the primary data format in industrial relational databases, underpinning modern data analytics and decision-making. However, the increasing scale of tabular data poses significant computational and storage challenges to learning-based analytical systems. This highlights the need for data-efficient learning, which enables effective model training and generalization using substantially fewer samples. Dataset condensation (DC) has emerged as a promising data-centric paradigm that synthesizes small yet informative datasets to preserve data utility while reducing storage and training costs. However, existing DC methods are computationally intensive due to reliance on complex gradient-based optimization. Moreover, they often overlook key characteristics of tabular data, such as heterogeneous features and class imbalance. To address these limitations, we introduce C$^{2}$TC (Class-Adaptive Clustering for Tabular Condensation), the first training-free tabular dataset condensation framework that jointly optimizes class allocation and feature representation, enabling efficient and scalable condensation. Specifically, we reformulate the dataset condensation objective into a novel class-adaptive cluster allocation problem (CCAP), which eliminates costly training and integrates adaptive label allocation to handle class imbalance. To solve the NP-hard CCAP, we develop HFILS, a heuristic local search that alternates between soft allocation and class-wise clustering to efficiently obtain high-quality solutions. Moreover, a hybrid categorical feature encoding (HCFE) is proposed for semantics-preserving clustering of heterogeneous discrete attributes. Extensive experiments on 10 real-world datasets demonstrate that C$^{2}$TC improves efficiency by at least 2 orders of magnitude over state-of-the-art baselines, while achieving superior downstream performance.

数据压缩表格数据无训练聚类

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。