arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.04872cs.LG
收藏

用于训练加速的多样化批次选择

Diversified Batch Selection for Training Acceleration

Cooperative Medianet Innovation Center(合作 medianet 创新中心);Shanghai Jiao Tong University(上海交通大学);Agency for Science, Technology and Research (A*STAR)(新加坡科技研究局);IHPC, Agency for Science, Technology and Research (A*STAR)(新加坡科技研究局信息通信研究所);Shanghai AI Laboratory(上海人工智能实验室);College of Computing and Data Science, NTU(南洋理工大学计算与数据科学学院)

Feng Hong, Yueming Lyu, Jiangchao Yao, Ya Zhang, Ivor W. Tsang, Yanfeng Wang

AI总结:

本文提出无需参考模型的多样化批次选择方法DivBS,通过分组正交化代表性准则解决逐样本选择的冗余问题,在多种任务上实现了性能与训练加速的显著提升。

摘要:

现代机器学习模型在大规模数据集上取得的显著成功,往往需要大量的训练时间和资源消耗。为了节约成本,一种被称为在线批次选择的主流研究方向探索在训练过程中选择具有信息量的子集。尽管近期的工作通过衡量每个样本对泛化能力的影响取得了进展,但它们对额外参考模型的依赖本质上限制了其在实际应用中的可行性,尤其是在没有此类理想模型可用的情况下。另一方面,朴素的无需参考模型的方法以逐样本的方式独立评分和选择数据,这牺牲了多样性并导致冗余。为了解决这一困境,我们提出了多样化批次选择(DivBS),该方法无需参考模型,并且能够高效地选择多样且具有代表性的样本。具体而言,我们定义了一个新的选择目标,该目标衡量分组正交化的代表性,以解决以往逐样本准则中的冗余问题,并提供了一种有原则的、选择高效的实现方式。在各种任务上的大量实验表明,DivBS 在性能与加速的权衡方面具有显著优越性。代码已公开。

英文摘要:

The remarkable success of modern machine learning models on large datasets often demands extensive training time and resource consumption. To save cost, a prevalent research line, known as online batch selection, explores selecting informative subsets during the training process. Although recent efforts achieve advancements by measuring the impact of each sample on generalization, their reliance on additional reference models inherently limits their practical applications, when there are no such ideal models available. On the other hand, the vanilla reference-model-free methods involve independently scoring and selecting data in a sample-wise manner, which sacrifices the diversity and induces the redundancy. To tackle this dilemma, we propose Diversified Batch Selection (DivBS), which is reference-model-free and can efficiently select diverse and representative samples. Specifically, we define a novel selection objective that measures the group-wise orthogonalized representativeness to combat the redundancy issue of previous sample-wise criteria, and provide a principled selection-efficient realization. Extensive experiments across various tasks demonstrate the significant superiority of DivBS in the performance-speedup trade-off. The code is publicly available.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑