paper-with-me

홈 › Papers

Decouple and Orthogonalize: A Data-Free Framework for LoRA Merging

2025-05-21 · Shenghe Zheng, Hongzhi Wang, Chenyu Huang, Xiaohui Wang, Tao Chen, Jiayuan Fan, Shuyue Hu, Peng Ye

With more open-source models available for diverse tasks, model merging has gained attention by combining models into one, reducing training, storage, and inference costs. Current research mainly focuses on model merging for full fine-tuning, overlooking the popular LoRA. However, our empirical analysis reveals that: a) existing merging methods designed for full fine-tuning perform poorly on LoRA; b) LoRA modules show much larger parameter magnitude variance than full fine-tuned weights; c) greater parameter magnitude variance correlates with worse merging performance. Considering that large magnitude variances cause deviations in the distribution of the merged parameters, resulting in information loss and performance degradation, we propose a Decoupled and Orthogonal merging approach(DO-Merging). By separating parameters into magnitude and direction components and merging them independently, we reduce the impact of magnitude differences on the directional alignment of the merged models, thereby preserving task information. Furthermore, we introduce a data-free, layer-wise gradient descent method with orthogonal constraints to mitigate interference during the merging of direction components. We provide theoretical guarantees for both the decoupling and orthogonal components. And we validate through extensive experiments across vision, language, and multi-modal domains that our proposed DO-Merging can achieve significantly higher performance than existing merging methods at a minimal cost. Notably, each component can be flexibly integrated with existing methods, offering near free-lunch improvements across tasks.

📄 PDF Abstract BibTeX arXiv:2505.15875

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음

Similar Papers 제목 키워드 기반

Orthogonalized Policy Optimization:Policy Optimization as Orthogonal Projection in Hilbert Space

2026-01-18 · Wang Zixian arxiv

We propose Orthogonalized Policy Optimization (OPO), a principled framework for large language model alignment derived from optimization in the Hilbert function space L2(pi_k). Lifting policy updates from the probability…

Guardian: Decoupling Exploration from Safety in Reinforcement Learning

2025-10-26 · Kaitong Cai, Jusheng Zhang, Jing Yang, Keze Wang arxiv

Hybrid offline--online reinforcement learning (O2O RL) promises both sample efficiency and robust exploration, but suffers from instability due to distribution shift between offline and online data. We introduce RLPD-GX,…

Reinforcement Learning

MuonEq: Balancing Before Orthogonalization with Lightweight Equilibration

2026-03-30 · Da Chang, Qiankun Shi, Lvgang Zhang, Yu Li 외 arxiv

Orthogonalized-update optimizers such as Muon improve training of matrix-valued parameters, but existing extensions typically either rescale updates after orthogonalization or use heavier whitening-based preconditioners …

FURINA: Free from Unmergeable Router via LINear Aggregation of mixed experts

2025-09-18 · Jiayi Han, Liang Du, Yinda Chen, Xiao Kang 외 arxiv

The Mixture of Experts (MoE) paradigm has been successfully integrated into Low-Rank Adaptation (LoRA) for parameter-efficient fine-tuning (PEFT), delivering performance gains with minimal parameter overhead. However, a …

parameter-efficient fine-tuning

Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum

2026-02-19 · Minxin Zhang, Yuxuan Liu, Hayden Schaeffer arxiv

Efficient stochastic optimization typically integrates an update direction that performs well in the deterministic regime with a mechanism adapting to stochastic perturbations. While Adam uses adaptive moment estimates t…

Stochastic Optimization