Pith. sign in

REVIEW 3 cited by

Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual 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 2501.09522 v1 pith:FNKPD3Q7 submitted 2025-01-16 cs.LG

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

Deep model merging represents an emerging research direction that combines multiple fine-tuned models to harness their specialized capabilities across different tasks and domains. Current model merging techniques focus on merging all available models simultaneously, with weight interpolation-based methods being the predominant approaches. However, these conventional approaches are not well-suited for scenarios where models become available sequentially, and they often suffer from high memory requirements and potential interference between tasks. In this study, we propose a training-free projection-based continual merging method that processes models sequentially through orthogonal projections of weight matrices and adaptive scaling mechanisms. Our method operates by projecting new parameter updates onto subspaces orthogonal to existing merged parameter updates while using an adaptive scaling mechanism to maintain stable parameter distances, enabling efficient sequential integration of task-specific knowledge. Our approach maintains constant memory complexity to the number of models, minimizes interference between tasks through orthogonal projections, and retains the performance of previously merged models through adaptive task vector scaling. Extensive experiments on CLIP-ViT models demonstrate that our method achieves a 5-8% average accuracy improvement while maintaining robust performance in different task orderings.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. K-Merge: Online Continual Merging of Adapters for On-device Large Language Models

    cs.LG 2025-10 conditional novelty 6.0 of 10

    K-Merge merges each incoming LoRA with its most similar stored adapter using an order-invariant running average, governed by a storage budget and (in K-Merge++) a similarity threshold, preserving task performance with...

  2. Local Mixtures of Experts: Essentially Free Test-Time Training via Model Merging

    cs.LG 2025-05 conditional novelty 6.0 of 10

    TTMM pre-trains many local LoRA experts on data clusters and merges the most relevant few at test time, approximating test-time training with a 100x speedup and near-TTT perplexity.

  3. StatsMerging: Statistics-Guided Model Merging via Task-Specific Teacher Distillation

    cs.LG 2025-06 conditional novelty 5.0 of 10

    StatsMerging predicts per-layer merging coefficients from weight statistics and teacher pseudo-labels, achieving 94.5% average accuracy across eight vision tasks, 5.1 points above WEMoE.

Pith tools