通过约束采样提升大模型训练效率与跨域覆盖
Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching
- 基于分区拟阵约束,统一优化跨域样本选择
- 在两个基准上均超越独立与无差别的基线方法
- 减少批次内冲突梯度对,提升训练兼容性
在异构数据上训练大语言模型需平衡收敛速度与跨域覆盖。现有方法或在各域内独立采样,或依赖计算开销大的代理模型学习连续域权重。我们提出PartitionSel,一种在每域预算约束(分区拟阵)下,最大化验证引导的梯度匹配效用的跨域小批量选择方法。通过单个效用函数耦合各域预算,减少跨域采样冗余。所提目标函数为弱子模,支持具有可证明近似保证的正交匹配追踪算法。实验评估表明,在Qwen2.5与Llama-3的微调中,PartitionSel在MetaMathQA和Mol-Instructions数据集上均优于每域及无差别的基线。同时,其显著降低了每批次内的冲突梯度对数量,说明跨域耦合带来了更一致的更新方向。
原文摘要 · Abstract (English)
Training large language models (LLMs) on heterogeneous data requires selecting minibatches that balance convergence speed with coverage across domains. Existing methods either select samples independently within each domain or rely on computationally expensive proxy models to learn continuous domain weights. We propose PartitionSel, a cross-domain minibatch selection approach that maximizes a validation-guided gradient-matching utility under per-domain budgets encoded as a partition-matroid constraint. By coupling the per-domain budgets through a single utility, PartitionSel is designed to reduce redundancy in selections across domains. The proposed objective is weakly submodular and admits an orthogonal matching pursuit algorithm with provable approximation guarantees. Empirically, we evaluate PartitionSel for minibatch selection during the fine-tuning of Qwen2.5 and Llama-3 on MetaMathQA and Mol-Instructions. PartitionSel achieves robust gains over per-domain and domain-agnostic baselines on both benchmarks. It also reduces the number of conflicting gradient pairs within each batch, indicating that the cross-domain coupling translates into more compatible training updates.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。