mlsanityData to 7 Oct 2026

SOLAR: Communication-Efficient Model Adaptation via Subspace-Oriented Latent Adapter Reparametrization

arXiv 2604.08368 ↗First posted 9 Apr 2026cs.LG cs.CL cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient fine-tuning (PEFT) methods, such as LoRA, enable scalable adaptation of foundation models by injecting low-rank adapters. However, their communication and storage costs remain a major bottleneck in resource-constrained settings. We propose SOLAR (Subspace-Oriented Latent Adapter Reparameterization), a post-training compression framework that substantially reduces the communication cost (i.e., the number of parameters to transmit or store) of PEFT adapters. SOLAR expresses each PEFT update as a linear combination of basis vectors formed from the foundation model's singular vectors with controlled random perturbations. By exploiting the subspace similarity (the alignment of principal directions) between the foundation model and task-specific fine-tuned updates, SOLAR decouples the adapter size from PEFT structure and ensures compact yet expressive representations. It is model-agnostic and compatible with existing PEFT methods, including LoRA, AdaLoRA, and other adapter modules. We theoretically establish a bound on the reconstruction error. Experiments on language and vision tasks using LLaMA, GPT, and ViT models demonstrate that SOLAR preserves task performance while significantly reducing model representation sizes, offering an effective and communication-efficient solution for deployment in distributed systems and edge devices.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 60 references that are in the map. First posted on arXiv 9 Apr 2026.

Builds on

33 of 60 references.

References · 33

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  6. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  7. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  9. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  10. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  11. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  12. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
21 more
  1. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
  2. 20218-bit Optimizers via Block-wise Quantizationcited by 395
  3. 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
  4. 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
  5. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  6. 2023Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuningcited by 171
  7. 2022A Kernel-Based View of Language Model Fine-Tuningcited by 118
  8. 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
  9. 2024SVFT: Parameter-Efficient Fine-Tuning with Singular Vectorscited by 57
  10. 2024Mixture-of-Subspaces in Low-Rank Adaptationcited by 47
  11. 2023Revisiting the Parameter Efficiency of Adapters from the Perspective of Precision Redundancycited by 44
  12. 2024BitDelta: Your Fine-Tune May Only Be Worth One Bitcited by 38
  13. 2025LoRA-One: One-Step Full Gradient Could Suffice for Fine-Tuning Large Language Models, Provably and Efficientlycited by 35
  14. 2023NOLA: Compressing LoRA using Linear Combination of Random Basiscited by 28
  15. 2023Neural (Tangent Kernel) Collapsecited by 18
  16. 2023ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantizationcited by 18
  17. 2023DeltaZip: Efficient Serving of Multiple Full-Model-Tuned LLMscited by 17
  18. 2024Delta-CoMe: Training-Free Delta-Compression with Mixed-Precision for Large Language Modelscited by 17
  19. 2023When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactionscited by 11
  20. 2025EigenLoRAx: Recycling Adapters to Find Principal Subspaces for Resource-Efficient Adaptation and Inferencecited by 9
  21. 2025Efficient Federated Fine-Tuning of Large Language Models with Layer Dropoutcited by 2

Built on by

Not cited yet.