arXiv Machine Learning By Jingang Zhou, Haiyang Guo, Yuan Ma, Han Zhu, Xu-Yao Zhang

CAMFT: Conflict-Aware Mergeable Fine-Tuning for Large Language Models

Read the original on arXiv Machine Learning →

CAMFT is a Conflict‑Aware Mergeable Fine‑Tuning method designed to make task adaptation efficient and merge‑aware for large language models. Unlike existing approaches that only resolve parameter conflicts after fine‑tuning, CAMFT shapes mergeability during training by guiding each task to update sparse coordinates with lower cross‑task conflict. Experiments show that CAMFT outperforms standard fine‑tuning baselines in multi‑task merging scenarios.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 3

CoMerge: Conflict-Driven Preference Optimization for Multi-Task Model Merging

CoMerge is a conflict‑driven preference optimization framework for merging multiple expert language models into a single multi‑task model without full retraining. It treats model merging as a preference optimization problem, using self‑supervised, conflict‑driven hard negative samples derived from naive merging defects to refine lightweight, tensor‑wise merging coefficients. Experiments show CoMerge achieves near‑perfect performance on MergeBench and improves instruction‑following and safety on Llama‑3.1‑8B‑Instruct while optimizing only 1,445 scalar coefficients.

By Mingjie Zheng, Zihao Chen, Wenqing Chen, Weile Yuan, Zhixuan Chu, Jianxing Yu, Zibin Zheng
Hugging Face Trending Papers
Sep 2

CoMerge: Conflict-Driven Preference Optimization for Multi-Task Model Merging

CoMerge introduces a conflict‑driven preference optimization framework for merging multi‑task large language models, reframing merging as a preference problem that uses self‑supervised hard negative samples derived from naive merging defects. By optimizing lightweight, tensor‑wise merging coefficients, the method mitigates parameter‑space conflicts while preserving task‑specific capabilities. Experiments show CoMerge achieves an average normalized performance of 0.9968 on MergeBench and improves conflict‑sensitive tasks on Llama‑3.1‑8B‑Instruct, outperforming both data‑free and data‑driven baselines while optimizing only 1,445 scalar coefficients.

arXiv AI
Aug 25

From Isolation to Alignment: Unified LoRA for Efficient Multi-Task Learning

The paper introduces Align‑LoRA, a unified LoRA framework for multi‑task learning that replaces complex, isolated adapter designs with a single‑adapter model enhanced by a higher rank and an explicit alignment loss. It demonstrates that a router‑free, multi‑head model with high inter‑head redundancy can outperform more elaborate baselines, and that a unified LoRA can achieve competitive performance while enabling weight merging and zero inference latency. Extensive experiments and theoretical analysis confirm that Align‑LoRA surpasses prevailing approaches, offering a simpler, production‑friendly paradigm for parameter‑efficient fine‑tuning of large language models.

By Jinda Liu, Yi Chang, Yuan Wu