mlsanityData to 14 Oct 2026

Modular Delta Merging with Orthogonal Constraints: A Scalable Framework for Continual and Reversible Model Composition

arXiv 2507.20997 ↗First posted 28 Jul 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In real-world machine learning deployments, models must be continually updated, composed, and when required, selectively undone. However, existing approaches to model merging and continual learning often suffer from task interference, catastrophic forgetting, or lack of reversibility. We propose Modular Delta Merging with Orthogonal Constraints (MDM-OC), a novel framework that enables scalable, interference-free, and reversible composition of fine-tuned models. Each task-specific model is encoded as a delta from a shared base and projected into an orthogonal subspace to eliminate conflict. These projected deltas are then merged via gradient-based optimization to form a unified model that retains performance across tasks. Our approach supports continual integration of new models, structured unmerging for compliance such as GDPR requirements, and model stability via elastic weight consolidation and synthetic replay. Extensive experiments on vision and natural language processing benchmarks demonstrate that MDM-OC outperforms prior baselines in accuracy, backward transfer, and unmerge fidelity, while remaining memory-efficient and computationally tractable. This framework offers a principled solution for modular and compliant AI system design.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 28 references that are in the map. First posted on arXiv 28 Jul 2025.

Builds on

20 of 28 references.

References · 20

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  5. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  6. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  7. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  8. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  9. 2016Learning without Forgettingcited by 2,496
  10. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  11. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  12. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
8 more
  1. 2022Editing Models with Task Arithmeticcited by 1,120
  2. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  3. 2022Mass-Editing Memory in a Transformercited by 1,001
  4. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  5. 2019Orthogonal Gradient Descent for Continual Learningcited by 369
  6. 2021Gradient Projection Memory for Continual Learningcited by 348
  7. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  8. 2020Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descentcited by 68

Built on by

Not cited yet.