Pith. sign in

REVIEW 2 cited by

Rethinking Weight-Averaged 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 2411.09263 v5 pith:E7UWY6ES submitted 2024-11-14 cs.LG cs.CV

classification cs.LGcs.CV
keywords modelweightaveraginginterpretabilitymergingworkcombinationcontributes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Model merging, particularly through weight averaging, has shown surprising effectiveness in saving computations and improving model performance without any additional training. However, the interpretability of why and how this technique works remains unclear. In this work, we reinterpret weight-averaged model merging through the lens of interpretability and provide empirical insights into the underlying mechanisms that govern its behavior. We approach the problem from three perspectives: (1) we analyze the learned weight structures and demonstrate that model weights encode structured representations that help explain the compatibility of weight averaging; (2) we compare averaging in weight space and feature space across diverse model architectures (CNNs and ViTs) and datasets, aiming to expose under which circumstances what combination paradigm will work more effectively; (3) we study the effect of parameter scaling on prediction stability, highlighting how weight averaging acts as a form of regularization that contributes to robustness. By framing these analyses in an interpretability context, our work contributes to a more transparent and systematic understanding of model merging for stakeholders interested in the safety and reliability of untrained model combination methods. The code is available at https://github.com/billhhh/Rethink-Merge.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Task Vector Bases compresses T task vectors into M softmax-mixed basis vectors that preserve task arithmetic operations, with empirical gains over PCA and random selection.

  2. Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Merging

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A continual model merging method, OPCM, sequentially projects each new task vector into a subspace orthogonal to the current merged model, achieving 5-8% higher average accuracy than baselines on CLIP-ViT tasks.

Pith tools