arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.04449cs.LGcs.AIcs.CV
收藏

用于数据集选择和压缩的损失曲率匹配

Loss-Curvature Matching for Dataset Selection and Condensation

KAIST(韩国科学技术院);Ewha Womans University(梨花女子大学)

Seungjae Shin, Heesun Bae, Donghyeok Shin, Weonyoung Joo, Il-Chul Moon

摘要:

在大型数据集上训练神经网络需要大量的计算成本。数据集缩减基于大型数据集选择或合成数据实例,同时最大限度地降低完整数据集的泛化性能下降。现有的方法在数据集约简过程中使用神经网络,因此模型参数成为保持约简后性能的重要因素。根据参数的重要性,本文提出了一种新的约简目标LCMat,它在模型参数空间上匹配原始数据集和约简数据集的损失曲率,而不是参数点。这个新的目标诱导一个更好的适应减少的数据集上的扰动参数区域比精确的点匹配。特别地,我们从局部参数区域中识别出损耗曲率间隙的最坏情况,并通过理论分析推导出这种最坏情况的可实现上界。我们在核心集选择和凝聚基准上的实验表明,LCMat比现有的基准具有更好的泛化性能。

英文摘要:

Training neural networks on a large dataset requires substantial computational costs. Dataset reduction selects or synthesizes data instances based on the large dataset, while minimizing the degradation in generalization performance from the full dataset. Existing methods utilize the neural network during the dataset reduction procedure, so the model parameter becomes important factor in preserving the performance after reduction. By depending upon the importance of parameters, this paper introduces a new reduction objective, coined LCMat, which Matches the Loss Curvatures of the original dataset and reduced dataset over the model parameter space, more than the parameter point. This new objective induces a better adaptation of the reduced dataset on the perturbed parameter region than the exact point matching. Particularly, we identify the worst case of the loss curvature gap from the local parameter region, and we derive the implementable upper bound of such worst-case with theoretical analyses. Our experiments on both coreset selection and condensation benchmarks illustrate that LCMat shows better generalization performances than existing baselines.

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

↑