Rethinking Dataset Distillation: Hard Truths about Soft Labels
Not on the map. Why?
Abstract (arXiv)
Despite the perceived success of large-scale dataset distillation (DD) methods, recent evidence finds that simple random image baselines perform on-par with state-of-theart DD methods like SRe2L due to the use of soft labels during downstream model training. This is in contrast with the findings in coreset literature, where high-quality coresets consistently outperform random subsets in the hardlabel (HL) setting. To understand this discrepancy, we perform a detailed scalability analysis to examine the role of data quality under different label regimes, ranging from abundant soft labels (termed as SL+KD regime) to fixed soft labels (SL) and hard labels (HL). Our analysis reveals that high-quality coresets fail to convincingly outperform the random baseline in both SL and SL+KD regimes. In the SL+KD setting, performance further approaches nearoptimal levels relative to the full dataset, regardless of subset size or quality, for a given compute budget. This performance saturation calls into question the widespread practice of using soft labels for model evaluation, where unlike the HL setting, subset quality has negligible influence. A subsequent systematic evaluation of five large-scale and four small-scale DD methods in the HL setting reveals that only RDED reliably outperforms random baselines on ImageNet-1K, but can still lag behind strong coreset methods due to its over-reliance on easy sample patches. Based on this, we introduce CAD-Prune, a compute-aware pruning metric that efficiently identifies samples of optimal difficulty for a given compute budget, and use it to develop CA2D, a compute-aligned DD method, outperforming current DD methods on ImageNet-1K at various IPC settings. Together, our findings uncover many insights into current DD research and establish useful tools to advance dataefficient learning for both coresets and DD.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 35 of its 39 references that are in the map. First posted on arXiv 20 Apr 2026.
Builds on
35 of 39 references.
References · 35
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2020Knowledge Distillation: A Surveycited by 1,603
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2020Dataset Condensation with Gradient Matchingcited by 516
- 2022Dataset Distillation by Matching Training Trajectoriescited by 442
- 2021Dataset Condensation with Distribution Matchingcited by 365
- 2021Knowledge distillation: A good teacher is patient and consistentcited by 259
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
23 more
- 2022Scaling Up Dataset Distillation to ImageNet-1K with Constant Memorycited by 181
- 2022Dataset Distillation using Neural Feature Regressioncited by 177
- 2021Active Learning by Acquiring Contrastive Examplescited by 156
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
- 2023Squeeze, Recover and Relabel: Dataset Condensation at ImageNet Scale From A New Perspectivecited by 138
- 2023Generalizing Dataset Distillation via Deep Generative Priorcited by 126
- 2023Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matchingcited by 118
- 2023On the Diversity and Realism of Distilled Dataset: An Efficient Dataset Distillation Paradigmcited by 109
- 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
- 2023Data Distillation: A Surveycited by 87
- 2023Efficient Dataset Distillation via Minimax Diffusioncited by 83
- 2024Scaling Laws for Data Filtering -- Data Curation cannot be Compute Agnosticcited by 77
- 2024D4M: Dataset Distillation via Disentangled Diffusion Modelcited by 77
- 2023Generalized Large-Scale Data Condensation via Various Backbone and Statistical Matchingcited by 69
- 2022DC-BENCH: Dataset Condensation Benchmarkcited by 67
- 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
- 2024Elucidating the Design Space of Dataset Condensationcited by 40
- 2024Diversity-Driven Synthesis: Enhancing Dataset Distillation through Directed Weight Adjustmentcited by 33
- 2024A Label is Worth a Thousand Images in Dataset Distillationcited by 31
- 2023Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learningcited by 26
- 2024SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matchingcited by 22
- 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22
- 2025FADRM: Fast and Accurate Data Residual Matching for Dataset Distillationcited by 11
Built on by
Citing papers per year: 2026: 1.
1 paper.