arXiv:2411.12523cs.LGcs.CV2024-11被引 3

对生成扩散模型进行数据剪枝,能提升训练效果并改善数据分布不均问题。

Data Pruning in Generative Diffusion Models

  • 用聚类方法筛选关键数据,替代复杂耗时的剪枝算法。
  • 在CelebA-HQ和ImageNet上验证,剪枝后模型性能反而更好。
  • 无监督聚类可均衡数据分布,缓解类别偏倚问题,适合数据多样性不足场景。

数据剪枝旨在识别对训练最有价值的核心数据子集并丢弃其余部分。尽管判别模型的数据剪枝已有深入研究,但生成模型的相关研究仍较少。生成模型的目标是估计数据的潜在分布,通常认为更大数据集更优。本文探讨这一观点的准确性,特别是针对生成扩散模型是否可通过数据剪枝获得收益。与直觉相反,我们发现有策略地剔除冗余或噪声数据,在大规模数据集中尤为有益。实验对比了多种剪枝方法(包括最新先进方法),在CelebA-HQ和ImageNet数据集上验证。结果表明,简单的聚类方法优于其他复杂且计算成本高的方法。此外,我们展示了如何利用聚类实现无监督的分布均衡,从而公平采样数据分布中代表性不足的群体,这是生成模型中的关键挑战。

原文摘要 · Abstract (English)

Data pruning is the problem of identifying a core subset that is most beneficial to training and discarding the remainder. While pruning strategies are well studied for discriminative models like those used in classification, little research has gone into their application to generative models. Generative models aim to estimate the underlying distribution of the data, so presumably they should benefit from larger datasets. In this work we aim to shed light on the accuracy of this statement, specifically answer the question of whether data pruning for generative diffusion models could have a positive impact. Contrary to intuition, we show that eliminating redundant or noisy data in large datasets is beneficial particularly when done strategically. We experiment with several pruning methods including recent-state-of-art methods, and evaluate over CelebA-HQ and ImageNet datasets. We demonstrate that a simple clustering method outperforms other sophisticated and computationally demanding methods. We further exhibit how we can leverage clustering to balance skewed datasets in an unsupervised manner to allow fair sampling for underrepresented populations in the data distribution, which is a crucial problem in generative models.

生成模型数据剪枝扩散模型数据均衡

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