arXiv:2506.13274cs.LGcs.CL2025-06NeurIPS被引 3

自适应调整学习率,让大模型预训练更高效

AdaLRS: Loss-Guided Adaptive Learning Rate Search for Efficient Foundation Model Pretraining

  • 根据损失下降速度在线搜索最优学习率
  • 在多个模型和训练设置下提升性能,收敛有保障
  • 无需调参,适配不同大模型与训练场景

学习率对大模型预训练至关重要。现有方法虽发现学习率配置具备可迁移性,但多受限于特定训练场景,且需在代理模型上大量调参。本文提出可即插即用的AdaLRS算法,通过优化损失下降速度实现在线最优学习率搜索。理论与实验表明,大模型预训练损失及其下降速度均为凸函数,且共享同一最优学习率。AdaLRS仅依赖训练损失动态,计算开销小,收敛性可保证。在LLM与VLM预训练中,该方法能将次优学习率快速调整至最优附近,显著提升训练效率与模型性能。同时验证了其在不同模型规模、训练范式、基础学习率调度策略及超参数设置下的强泛化能力。

原文摘要 · Abstract (English)

Learning rate is widely regarded as crucial for effective foundation model pretraining. Recent research explores and demonstrates the transferability of learning rate configurations across varying model and dataset sizes, etc. Nevertheless, these approaches are constrained to specific training scenarios and typically necessitate extensive hyperparameter tuning on proxy models. In this work, we propose \textbf{AdaLRS}, a plug-in-and-play adaptive learning rate search algorithm that conducts online optimal learning rate search via optimizing loss descent velocities. We provide theoretical and experimental analyzes to show that foundation model pretraining loss and its descent velocity are both convex and share the same optimal learning rate. Relying solely on training loss dynamics, AdaLRS involves few extra computations to guide the search process, and its convergence is guaranteed via theoretical analysis. Experiments on both LLM and VLM pretraining show that AdaLRS adjusts suboptimal learning rates to the neighborhood of optimum with marked efficiency and effectiveness, with model performance improved accordingly. We also show the robust generalizability of AdaLRS across varying training scenarios, such as different model sizes, training paradigms, base learning rate scheduler choices, and hyperparameter settings.

学习率大模型自适应预训练

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