软标签让数据蒸馏失效,真实效果远不如随机采样。
Rethinking Dataset Distillation: Hard Truths about Soft Labels

- 用软标签训练时,高质量数据集无优势,随机样本表现相当。
- 在软标签+知识蒸馏设置下,性能接近全量数据上限,与子集质量无关。
- 提出新剪枝方法CA2D,适配计算预算,显著提升图像分类效果。
尽管大规模数据蒸馏(DD)方法看似成功,但近期研究发现,简单随机图像基线在使用软标签训练时,性能可与SRe2L等先进方法持平。这与共压缩集(coreset)文献中高质量子集在硬标签(HL)设置下始终优于随机子集的结果形成对比。为理解该差异,我们进行了详尽的可扩展性分析,考察不同标签设置下的数据质量影响:从丰富的软标签(称作SL+KD)到固定软标签(SL)和硬标签(HL)。分析显示,在SL与SL+KD设置下,高质量共压缩集无法显著优于随机基线。在SL+KD条件下,性能随计算预算趋于最优,无论子集大小或质量如何。这种性能饱和挑战了当前广泛采用软标签进行模型评估的做法——在该设置下,子集质量几乎无影响。进一步对五种大规模和四种小规模DD方法在硬标签设置下的系统评估表明,仅有RDED在ImageNet-1K上可靠优于随机基线,但仍因过度依赖简单样本块而落后于强共压缩方法。基于此,我们提出CAD-Prune,一种面向计算预算的剪枝度量,用于高效识别最适难度样本,并据此构建了计算对齐的DD方法CA2D。CA2D在ImageNet-1K多个每类图像数(IPC)设置下均超越现有方法。这些发现揭示了当前DD研究的诸多真相,并为共压缩集与数据蒸馏的数据高效学习提供了实用工具。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。