arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.04710cs.CLcs.LG

引导噪声:将随机扰动转化为有效下降方向以实现内存高效的LLM微调

Steering the Noise: Turning Random Perturbations into Effective Descent for Memory-Efficient LLM Fine-Tuning

School of Intelligence Science and Technology(智能科学与技术学院);Institute for Artificial Intelligence(人工智能研究院);Peking University(北京大学);State Key Laboratory of General Artificial Intelligence(通用人工智能国家重点实验室)

Feihu Jin, Shipeng Cen, Ying Tan

AI总结:

提出一种即插即用框架,通过候选扰动池选择或组合与优化目标对齐的扰动,改进零阶优化梯度估计,提升LLM微调的收敛速度和任务精度。

摘要:

微调大型语言模型(LLMs)取得了强大的性能,但通常受到反向传播内存开销的限制。零阶(ZO)优化通过仅使用前向传递来估计梯度,避免了这一开销,但由于随机高斯扰动在高维参数空间中产生高方差的梯度估计,其收敛速度通常较慢。在本文中,我们提出了一种即插即用框架,将随机扰动转化为更有效的下降方向。关键思想是抽取一小批候选扰动,评估其损失值,然后选择或组合那些与优化目标最一致的扰动。我们开发了该思想的两种实例:MeZO-GV,通过低损失和高损失扰动组之间的对比形成引导向量;以及MeZO-Greedy,在固定的评估预算内保留单个最佳扰动。我们从理论上证明,这两种策略在每步目标函数减少上均优于标准ZO估计,从而提高了收敛速度。在不同规模和架构的LLM上的实验证实,所提出的方法自然地与现有ZO优化器集成,并一致地提高了收敛速度和任务准确性。在OPT-13B上,我们的方法在11个基准测试中优于所有ZO基线,并在其中9个上超过了基于梯度的方法,同时保留了仅前向优化的内存效率。

英文摘要:

Fine-tuning large language models (LLMs) achieves strong performance but is often limited by the memory overhead of backpropagation. Zeroth-order (ZO) optimization avoids this overhead by estimating gradients through forward passes alone, yet it typically converges slowly because random Gaussian perturbations yield high-variance gradient estimates in high-dimensional parameter spaces. In this paper, we propose a plug-and-play framework that turns random perturbations into more effective descent directions. The key idea is to draw a small pool of candidate perturbations, evaluate their loss values, and then select or combine those that are best aligned with the optimization objective. We develop two instantiations of this idea: MeZO-GV, which forms a guiding vector from the contrast between low-loss and high-loss perturbation groups, and MeZO-Greedy, which keeps the single best perturbation within a fixed evaluation budget. We theoretically show that both strategies yield a larger per-step reduction in the objective than standard ZO estimation, leading to improved convergence rates. Experiments on LLMs of different scales and architectures confirm that the proposed methods integrate naturally with existing ZO optimizers and consistently improve convergence speed and task accuracy. On OPT-13B, our approach outperforms all ZO baselines across 11 benchmarks and exceeds gradient-based methods on 9 of them, while retaining the memory efficiency of forward-only optimization.

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

↑