arXiv:2411.03768cs.LG2024-11NeurIPS被引 3

用贝叶斯方法高效选择训练数据点,支持大模型自动优化。

A Bayesian Approach to Data Point Selection

  • 构建新贝叶斯模型,通过后验推断联合学习数据权重与网络参数。
  • 在小批量下仍能收敛,计算效率远超传统双层优化方法。
  • 可扩展至大语言模型,适合自动化指令微调数据优化场景。

由于获取未经标注的训练数据比获取标注或处理过的数据更容易,数据点选择(DPS)在深度学习中变得日益重要。现有方法多基于双层优化(BLO)框架,内存和计算开销大,且在小批量情况下存在理论缺陷。为此,本文提出一种新的贝叶斯方法解决DPS问题:将数据点选择建模为新型贝叶斯模型中的后验推断,通过合理先验与似然模型,联合推断实例权重与主神经网络参数。采用随机梯度朗之万MCMC采样进行联合学习,在小批量下仍保证收敛。更新公式与广泛使用的SGD相近,但效率显著高于现有基于BLO的方法。在视觉与语言领域开展受控实验验证可行性,并证明该方法可有效扩展至大型语言模型,支持指令微调数据集的自动化任务级优化。

原文摘要 · Abstract (English)

Data point selection (DPS) is becoming a critical topic in deep learning due to the ease of acquiring uncurated training data compared to the difficulty of obtaining curated or processed data. Existing approaches to DPS are predominantly based on a bi-level optimisation (BLO) formulation, which is demanding in terms of memory and computation, and exhibits some theoretical defects regarding minibatches. Thus, we propose a novel Bayesian approach to DPS. We view the DPS problem as posterior inference in a novel Bayesian model where the posterior distributions of the instance-wise weights and the main neural network parameters are inferred under a reasonable prior and likelihood model. We employ stochastic gradient Langevin MCMC sampling to learn the main network and instance-wise weights jointly, ensuring convergence even with minibatches. Our update equation is comparable to the widely used SGD and much more efficient than existing BLO-based methods. Through controlled experiments in both the vision and language domains, we present the proof-of-concept. Additionally, we demonstrate that our method scales effectively to large language models and facilitates automated per-task optimization for instruction fine-tuning datasets.

数据选择贝叶斯方法大模型优化自动微调

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