mlsanityData to 7 Oct 2026

AdaRank: Adaptive Rank Pruning for Enhanced Model Merging

arXiv 2503.22178 ↗First posted 28 Mar 2025cs.LG cs.AI cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

Model merging has emerged as a promising approach for unifying independently fine-tuned models into an integrated framework, significantly enhancing computational efficiency in multi-task learning. Recently, several SVD-based techniques have been introduced to exploit low-rank structures for enhanced merging, but their reliance on such manually designed rank selection often leads to cross-task interference and suboptimal performance. In this paper, we propose AdaRank, a novel model merging framework that adaptively selects the most beneficial singular directions of task vectors to merge multiple models. We empirically show that the dominant singular components of task vectors can cause critical interference with other tasks, and that naive truncation across tasks and layers degrades performance. In contrast, AdaRank dynamically prunes the singular components that cause interference and offers an optimal amount of information to each task vector by learning to prune ranks during test-time via entropy minimization. Our analysis demonstrates that such method mitigates detrimental overlaps among tasks, while empirical results show that AdaRank consistently achieves state-of-the-art performance with various backbones and number of tasks, reducing the performance gap between fine-tuned models to nearly 1%.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 45 of its 79 references that are in the map. First posted on arXiv 28 Mar 2025.

Builds on

45 of 79 references.

References · 45

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  7. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  8. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  9. 2013Describing Textures in the Wildcited by 2,110
  10. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  11. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
  12. 2022Editing Models with Task Arithmeticcited by 1,076
33 more
  1. 2018Neural Network Acceptability Judgmentscited by 952
  2. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  3. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
  4. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
  5. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  6. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  7. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  8. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  9. 2018Rotation Equivariant CNNs for Digital Pathologycited by 420
  10. 2018Deep Learning for Classical Japanese Literaturecited by 415
  11. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  12. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  13. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  14. 2016On the Expressive Power of Deep Neural Networkscited by 302
  15. 2013Challenges in Representation Learning: A report on three machine learning contestscited by 301
  16. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
  17. 2013Predicting Parameters in Deep Learningcited by 223
  18. 2017EMNIST: an extension of MNIST to handwritten letterscited by 212
  19. 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
  20. 2024Localizing Task Information for Improved Model Merging and Compressioncited by 130
  21. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 114
  22. 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 108
  23. 2015Convolutional neural networks with low-rank regularizationcited by 102
  24. 2024Representation Surgery for Multi-Task Model Mergingcited by 95
  25. 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 90
  26. 2023Deep Model Fusion: A Surveycited by 89
  27. 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
  28. 2024A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learningcited by 52
  29. 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
  30. 2024Revisiting Weight Averaging for Model Mergingcited by 24
  31. 2024SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgerycited by 12
  32. 2025STAR: Spectral Truncation and Rescale for Model Mergingcited by 11
  33. 2023Towards Higher Ranks via Adversarial Weight Pruningcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 5.

8 papers.