RanDeS: Randomized Delta Superposition for Multi-Model Compression
Not on the map. Why?
Abstract (arXiv)
From a multi-model compression perspective, model merging enables memory-efficient serving of multiple models fine-tuned from the same base, but suffers from degraded performance due to interference among their task-specific parameter adjustments (i.e., deltas). In this paper, we reformulate model merging as a compress-and-retrieve scheme, revealing that the task interference arises from the summation of irrelevant deltas during model retrieval. To address this issue, we use random orthogonal transformations to decorrelate these vectors into self-cancellation. We show that this approach drastically reduces interference, improving performance across both vision and language tasks. Since these transformations are fully defined by random seeds, adding new models requires no extra memory. Further, their data- and model-agnostic nature enables easy addition or removal of models with minimal compute overhead, supporting efficient and flexible multi-model serving.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 60 references that are in the map. First posted on arXiv 16 May 2025.
Builds on
44 of 60 references.
References · 44
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2013Describing Textures in the Wildcited by 2,125
- 2020Knowledge Distillation: A Surveycited by 1,603
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2019Relational Knowledge Distillationcited by 889
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
32 more
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2018Rotation Equivariant CNNs for Digital Pathologycited by 422
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2022Decoupled Knowledge Distillationcited by 388
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2019On the Efficacy of Knowledge Distillationcited by 381
- 2020What is being transferred in transfer learning?cited by 368
- 2013Challenges in Representation Learning: A report on three machine learning contestscited by 302
- 2021Post-Training Quantization for Vision Transformercited by 278
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
- 2019Structured Pruning of Large Language Modelscited by 203
- 2023DepGraph: Towards Any Structural Pruningcited by 203
- 2021PTQ4ViT: Post-training quantization for vision transformers with twin uniform quantizationcited by 179
- 2015Structured Pruning of Deep Convolutional Neural Networkscited by 149
- 2024Localizing Task Information for Improved Model Merging and Compressioncited by 131
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
- 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
- 2019Superposition of many models into onecited by 64
- 2022Machine Learning Model Sizes and the Parameter Gapcited by 39
- 2024BitDelta: Your Fine-Tune May Only Be Worth One Bitcited by 39
- 2023Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?cited by 20
- 2024Delta-CoMe: Training-Free Delta-Compression with Mixed-Precision for Large Language Modelscited by 17
- 2019Structured Compression by Weight Encryption for Unstructured Pruning and Quantizationcited by 16
- 2023Efficient Storage of Fine-Tuned Models via Low-Rank Approximation of Weight Residualscited by 12
- 2023PELA: Learning Parameter-Efficient Models with Low-Rank Approximationcited by 9
- 2024SMILE: Zero-Shot Sparse Mixture of Low-Rank Experts Construction From Pre-Trained Foundation Modelscited by 9
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Breaking the Compression Ceiling: Data-Free Pipeline for Ultra-Efficient Delta Compression
- 2025ImPart: Importance-Aware Delta-Sparsification for Improved Model Compression and Merging in LLMs
- 2026Prune-then-Quantize or Quantize-then-Prune? Understanding the Impact of Compression Order in Joint Model Compression
- 2025Dynamic Base model Shift for Delta Compression
- 2026Vision Token Reduction via Attention-Driven Self-Compression for Efficient Multimodal Large Language Models
- 2026Break Through the Compression Bottleneck: From Theory to Practice
- 2025When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models
- 2024SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression