PulseAugur
实时 23:44:45
English(EN) OrderDP: A Theoretically Guaranteed Lossless Dynamic Data Pruning Framework

OrderDP框架通过无损数据剪枝加速AI训练

研究人员推出OrderDP,一个旨在通过动态剪枝数据来加速AI模型训练的新框架。该方法旨在将训练成本降低40%以上,同时保持近乎无损的性能和无偏的梯度估计。OrderDP通过首先随机选择一个数据子集,然后选择top-q个样本来实现这一点,为收敛和泛化提供了理论保证。该框架已在ImageNet-1K等数据集上得到实证验证,显示出具有竞争力的准确性和稳定的收敛性。 AI

影响 将训练成本降低40%以上,同时保持性能,从而实现更高效的AI开发。

排序理由 该集群包含一篇详细介绍AI模型训练新框架的学术论文。

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →

报道来源 [2]

  1. arXiv cs.LG TIER_1 English(EN) · Chenhan Jin, Shengze Xu, Qingsong Wang, Fan Jia, Dingshuo Chen, Tieyong Zeng ·

    OrderDP:一个理论上保证无损的动态数据剪枝框架

    arXiv:2606.08574v1 Announce Type: new Abstract: Data pruning (DP), as an oft-stated strategy to alleviate heavy training burdens, reduces the volume of training samples according to a well-defined pruning method while striving for near-lossless performance. However, existing appr…

  2. arXiv cs.LG TIER_1 English(EN) · Tieyong Zeng ·

    OrderDP:一个理论上保证无损的动态数据剪枝框架

    Data pruning (DP), as an oft-stated strategy to alleviate heavy training burdens, reduces the volume of training samples according to a well-defined pruning method while striving for near-lossless performance. However, existing approaches, which commonly select highly informative…