Pith. sign in

REVIEW 4 cited by

A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learning

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 2408.07057 v2 pith:7SKFEFY3 submitted 2024-08-13 cs.LG cs.AIcs.CL

A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learning

classification cs.LG cs.AIcs.CL
keywords moergingmethodsmodelmodelsexpertsurveyapplicationsdesign
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The availability of performant pre-trained models has led to a proliferation of fine-tuned expert models that are specialized to a particular domain or task. Model MoErging methods aim to recycle expert models to create an aggregate system with improved performance or generalization. A key component of MoErging methods is the creation of a router that decides which expert model(s) to use for a particular input or application. The promise, effectiveness, and large design space of MoErging has spurred the development of many new methods over the past few years. This rapid pace of development has made it challenging to compare different MoErging methods, which are rarely compared to one another and are often validated in different experimental setups. To remedy such gaps, we present a comprehensive survey of MoErging methods that includes a novel taxonomy for cataloging key design choices and clarifying suitable applications for each method. Apart from surveying MoErging research, we inventory software tools and applications that make use of MoErging. We additionally discuss related fields of study such as model merging, multitask learning, and mixture-of-experts models. Taken as a whole, our survey provides a unified overview of existing MoErging methods and creates a solid foundation for future work in this burgeoning field.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. StereoFactory: A Unified Merging Framework for Robust Stereo Matching

    cs.CV 2026-06 unverdicted novelty 6.0

    StereoFactory merges stereo matching foundation models via genetic subset search followed by CMA-ES module routing, reporting lower average errors on four benchmarks than baselines while using 2.7-3.7% of retraining time.

  2. From Parameters to Feature Space: Task Arithmetic for Backdoor Mitigation in Model Merging

    cs.CR 2026-06 unverdicted novelty 6.0

    LFPM mitigates backdoors in model merging by optimizing an anti-backdoor task vector in feature space under the Cross-Task Linearity framework to suppress backdoors without major clean-task degradation.

  3. Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories

    cs.LG 2026-06 unverdicted novelty 6.0

    Language models can use a two-stage sleep process of upward distillation for memory consolidation and RL-based dreaming for unsupervised self-improvement to enable continual learning.

  4. Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories

    cs.LG 2026-06 conditional novelty 6.0

    Sleep-time Knowledge Seeding plus Dreaming lets LLMs expand capacity, distill fragile in-context memories into stable parameters, and self-improve without human labels.