Summary
This week's theme centers on making model merging more controllable, scalable, and robust as the number of fine-tuned expert models grows. Representative papers argue that standard weight interpolation and static merged models often suffer from task interference, high memory or optimization overhead, sensitivity to merge order, and weak adaptation to heterogeneous test inputs, motivating closed-form, sequential, and dynamic merging strategies.
Situation
The representative papers frame model merging as an increasingly important alternative to retraining large foundation models from scratch. As more task-specialized experts are produced by fine-tuning, merging offers a way to consolidate their capabilities without access to original training data or another expensive optimization cycle. But the Introductions consistently note that conventional weight averaging, task arithmetic, and other static one-shot merges often lag well behind individual experts because task-specific parameters interfere, data and training heterogeneity complicate interpolation, and a single fixed merged model cannot serve all task preferences or input conditions equally well.
Against this backdrop, the literature is shifting from generic static merging toward optimization-aware formulations that better control interference and deployment cost. One line recasts merging as controllable multi-objective optimization, but the representative evidence stresses that existing compile-then-query approaches can be prohibitively expensive in compute, memory, and data, especially when the expert set changes. Other representative work highlights practical constraints such as sequential model availability, merge-order effects, and heterogeneous test-time inputs, motivating analytical representation-space correction, orthogonal projection for continual merging, and modular dynamic integration of shared and task-specific knowledge.
Infographic (English)

Progress
Closed-Form Spectral Regularization for Multi-Task Model Merging <See Details on Fugu-MT>
Proposes a closed-form spectral regularization method (SWUDI) that addresses layer-wise interference in multi-task model merging without retraining. Unlike prior iterative or search-based merging optimizers, it applies an analytic soft exponential filter aligned with gradient-flow dynamics to reduce expert conflict in a single step.
SSR-Merge: Subspace Signal Routing for Training-Free LoRA Merging in Diffusion Models <See Details on Fugu-MT>
Extends training-free merging to LoRA combinations in diffusion models by routing internal signals across subspaces rather than merging parameters directly. Compared with conventional parameter-space LoRA merging, subspace signal routing avoids destructive collisions in the shared weight space.
Outlook
Outlook Summary
Near-term research is likely to make controllable model merging more analytic and training-free, with stronger handling of interference at the layer and subspace level. Recent work points toward memory-efficient methods that are less sensitive to merge order and can adapt as expert sets change. The main limits remain clear: many methods assume linear corrections or simple trade-offs, may need unlabeled target data, and are still tested mostly on same-architecture vision models. The next step is broader validation on language, multimodal, and diffusion systems, plus deeper study of nonlinear conflicts and knowledge decomposition.
Infographic (English)

Three-Year Movement
The near-term path starts with controllable model merging being tested as an engineering system, not only as a way to raise average accuracy. In the first year, research turns interference into something that can be measured directly. Stress tests track order sensitivity, limited calibration data, and routing confidence, so researchers can see where a merge breaks. Application work stays close to post-training and model-serving teams, where merge cards and admission checks help decide whether a new expert can be safely added.
By the second year, the same tests begin to shape both papers and internal evaluation. Model registries can record compatible bases, adapter formats, and calibration needs, while serving tools monitor whether a merge is drifting or routing poorly. The mechanism is a feedback loop: benchmark failures reveal collision modes, methods optimize against those modes, and deployment tools watch for them in operation. A useful monitoring cue is ranking reversal, where a method with a slightly lower average score performs better under expert arrival, conflict, or limited data.
Around the third year, model merging can become a managed reconfiguration layer for multi-model serving, if cross-architecture validation is strong enough. Static merged artifacts, sequential merging, and near-test-time expert construction can coexist, but each mode is allowed only inside a tested operating envelope. The key movement is from “one merged model is good enough” toward “this merge is allowed under these data, architecture, and routing conditions. ” The caveat is that model failures are distributional and can change as new inputs arrive, so no single benchmark can certify safety forever.
This scenario treats model merging as a control plane, similar in spirit to how software systems separate policy decisions from local execution. The policy decides which expert components or corrections should be active, while the serving system applies that choice and reports problems back. In the first year, research tests whether this control-loop idea is more than a metaphor. Early work combines admission checks, conflict detection, and routing updates to see whether a merged system can add or remove experts without losing protected capabilities.
By the second year, credible prototypes would turn merge policies into formal research objects. Admission tests, interference budgets, and rollback rules become part of the method rather than background engineering. Researchers also have to confront a core limit: neural representations are not simple network flows. Interference may be nonlinear, and a controller can improve visible scores while missing harmful behavior that is harder to inspect.
Around the third year, the application shape depends on whether those limits remain manageable. If they do, model fleets can shift toward fewer base models plus many governed expert components. Serving platforms then manage registries, routing policies, and evaluation hooks as ordinary infrastructure. A strong monitoring cue would be a dynamic controller that beats static merged checkpoints when experts arrive or are removed, while keeping latency and data needs bounded. The caveat is that serious routing errors or blind spots in evaluation would narrow the approach. In that case, the control-plane model would still be useful, but mainly in settings where the expert set and test coverage are easier to control.
This scenario revalues the same technical progress around model merging by asking whether merged experts remain traceable. The first-year setup is a shift from only asking whether accuracy improves to asking whether a named expert can be found, removed, or reduced after a merge. Methods based on retrievable deltas, projection, and representation correction become important because they give engineers handles for selective change. Application work begins with better records: the base model, expert sources, and merge process are documented so a team can rebuild or reroute a system without restarting from scratch.
By the second year, the question becomes more formal. Research moves from small removal tests toward benchmarks that measure how much unwanted behavior remains after an expert is taken out. The central mechanism is partial recall: a system does not need perfect deletion, but it must estimate what was removed, what traces remain, and what useful ability was lost. This is harder than ordinary software rollback because knowledge can be entangled across weights and representations.
Around the third year, a successful path leads to recallable composition. Serving systems treat experts as managed components rather than as ingredients permanently blended into one opaque checkpoint. Release pipelines include attribution gates and recall drills, where a team removes an expert, measures leftover behavior, and records the recovery path. A monitoring cue would be the appearance of shared evaluation tools or platform features that make expert-level provenance practical. A disconfirming cue would be selective removal still causing large utility loss or leaving too much residual behavior. If that happens, the scenario stalls at better documentation rather than becoming a true recallability-first workflow.
1-Year / 3-Year Research-Application Infographic

References
- Twin-Merging: Dynamic Integration of Modular Expertise in Model Merging - Authors: Zhenyi Lu, Chenghao Fan, Wei Wei, Xiaoye Qu, Dangyang Chen, Yu Cheng, / <See Details on Fugu-MT> / License: CC-BY-4.0
- Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Merging - Authors: Anke Tang, Enneng Yang, Li Shen, Yong Luo, Han Hu, Bo Du, Dacheng Tao, / <See Details on Fugu-MT> / License: CC-BY-4.0
- From Parameter to Representation: A Closed-Form Approach for Controllable Model Merging - Authors: Jialin Wu, Jian Yang, Handing Wang, Jiajun Wen, Zhiyong Yu, / <See Details on Fugu-MT> / License: CC-BY-4.0