C2TC: A Training-Free Framework for Efficient Tabular Data Condensation
Not on the map. Why?
Abstract (arXiv)
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 C2TC (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 C2TC improves efficiency by at least 2 orders of magnitude over state-of-the-art baselines, while achieving superior downstream performance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 35 of its 76 references that are in the map. First posted on arXiv 25 Feb 2026.
Builds on
35 of 76 references.
References · 35
- 2021Revisiting Deep Learning Models for Tabular Datacited by 725
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
- 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 577
- 2014OpenML: networked science in machine learningcited by 523
- 2020Dataset Condensation with Gradient Matchingcited by 510
- 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
- 2022Dataset Distillation by Matching Training Trajectoriescited by 437
- 2021Dataset Condensation with Distribution Matchingcited by 362
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 218
- 2022Dataset Condensation via Efficient Synthetic-Data Parameterizationcited by 187
23 more
- 2022On Embeddings for Numerical Features in Tabular Deep Learningcited by 185
- 2023Dataset Distillation: A Comprehensive Reviewcited by 126
- 2023Improved Distribution Matching for Dataset Condensationcited by 124
- 2023Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matchingcited by 118
- 2022Dataset Condensation with Contrastive Signalscited by 105
- 2024Better by Default: Strong Pre-Tuned MLPs and Boosted Trees on Tabular Datacited by 87
- 2023TabR: Tabular Deep Learning Meets Nearest Neighbors in 2023cited by 73
- 2022DC-BENCH: Dataset Condensation Benchmarkcited by 67
- 2024Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoningcited by 44
- 2022Delving into Effective Gradient Matching for Dataset Condensationcited by 40
- 2018Similarity encoding for learning with dirty categorical variablescited by 28
- 2019Self-paced Ensemble for Highly Imbalanced Massive Data Classificationcited by 28
- 2024Dataset Distillation by Automatic Training Trajectoriescited by 26
- 2024Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partitioncited by 23
- 2024Towards Stable and Storage-efficient Dataset Distillation: Matching Convexified Trajectorycited by 20
- 2023Continual Causal Inference with Incremental Observational Datacited by 13
- 2023Observatory: Characterizing Embeddings of Relational Tablescited by 12
- 2024GC-Bench: An Open and Unified Benchmark for Graph Condensationcited by 12
- 2026PrivGemo: Privacy-Preserving Dual-Tower Graph Retrieval for Empowering LLM Reasoning with Memory Augmentationcited by 9
- 2024Efficient Dynamic Attributed Graph Generationcited by 5
- 2026Beyond Linearization: Attributed Table Graphs for Table Reasoningcited by 4
- 2024CohortNet: Empowering Cohort Discovery for Interpretable Healthcare Analyticscited by 3
- 2024Decomposed Distribution Matching in Dataset Condensationcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.