arXiv:2606. 00357v1 Announce Type: new Abstract: Training strong large language models (LLMs) requires high-quality supervision, which is often scarce.
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 AI.
arXiv:2607. 18026v1 Announce Type: new Abstract: Can large language models with substantially different parameter spaces be merged by direct weighted averaging, without training or semantic alignment?
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.
arXiv:2606. 19549v1 Announce Type: new Abstract: Low-rank adaptation (LoRA) makes it cheap to train many domain- and task-specific language model adapters, but whether two adapters can be merged is usually discovered only after both have been fully trained and evaluated.
arXiv:2602. 12323v2 Announce Type: replace Abstract: The widespread availability of fine-tuned LoRA modules for open pre-trained models has led to an interest in methods that can adaptively merge LoRAs to improve performance.
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:2605.07111v3 Announce Type: replace-cross Abstract: Recent literature on fine-tuning Large Language Models highlights a fundamental debate. While Full Fine-Tuning (FFT) provides greater represe...