Pith. sign in

REVIEW 1 cited by

CABS: Conflict-Aware and Balanced Sparsification for Enhancing Model Merging

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.01874 v1 pith:E4XCNT6A submitted 2025-02-26 cs.LG cs.AI

classification cs.LGcs.AI
keywords modelsparsificationbalancedcabsconflict-awaremergingparametertask
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Model merging based on task vectors, i.e., the parameter differences between fine-tuned models and a shared base model, provides an efficient way to integrate multiple task-specific models into a multitask model without retraining. Recent works have endeavored to address the conflicts between task vectors, one of the significant challenges faced by model merging, through sparsification; however, two issues significantly limit their performance: high parameter overlap and unbalanced weight distribution. To address these issues, we propose a simple, yet effective framework called CABS (Conflict-Aware and Balanced Sparsification), consisting of Conflict-Aware Sparsification (CA) and Balanced Sparsification (BS). CA can reduce parameter overlap by applying masks during sequential pruning, ensuring that each task vector retains distinct, non-overlapping parameters. BS leverages $n$: $m$ pruning to preserve critical weights while maintaining an even distribution across layers. Our comprehensive experiments demonstrate that CABS outperforms state-of-the-art methods across diverse tasks and model sizes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hyper-ES: Effective Evolution Strategies for LLM Reasoning via Descent Direction Merging

    cs.AI 2026-08 conditional novelty 6.0 of 10

    Searching over DARE-TIES merge coefficients of few-shot GRPO-derived LoRA directions with CMA-ES beats single-stage GRPO+LoRA on math reasoning by about 0.6 to 0.9 points while using about 10% fewer gradient updates.

Pith tools