NAN: A Training-Free Solution to Coefficient Estimation in Model Merging
원문 초록
Model merging offers a training-free alternative to multi-task learning by combining independently fine-tuned models into a unified one without access to raw data. However, existing approaches often rely on heuristics to determine the merging coefficients, limiting their scalability and generality. In this work, we revisit model merging through the lens of least-squares optimization and show that the optimal merging weights should scale with the amount of task-specific information encoded in each model. Based on this insight, we propose NAN, a simple yet effective method that estimates model merging coefficients via the inverse of parameter norm. NAN is training-free, plug-and-play, and applicable to a wide range of merging strategies. Extensive experiments on show that NAN consistently improves performance of baseline methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Robust-Multi-Task Gradient Boosting
SAMO: A Lightweight Sharpness-Aware Approach for Multi-Task Optimization with Joint Global-Local Perturbation
SonicVerse: Multi-Task Learning for Music Feature-Informed Captioning
CALM: Consensus-Aware Localized Merging for Multi-Task Learning
Training-free LLM Merging for Multi-task Learning
Non-Contact Health Monitoring During Daily Personal Care Routines
토론
이 논문과 연결된 포럼 글이 아직 없습니다.