Shared LoRA Subspaces for almost Strict Continual Learning
Not on the map. Why?
Abstract (arXiv)
Adapting large pretrained models to new tasks efficiently and continually is crucial for real-world deployment but remains challenging due to catastrophic forgetting and the high cost of retraining. While parameter-efficient tuning methods like low rank adaptation (LoRA) reduce computational demands, they lack mechanisms for strict continual learning and knowledge integration, without relying on data replay, or multiple adapters. We propose Share, a novel approach to parameter efficient continual finetuning that learns and dynamically updates a single, shared low-rank subspace, enabling seamless adaptation across multiple tasks and modalities. Share constructs a foundational subspace that extracts core knowledge from past tasks and incrementally integrates new information by identifying essential subspace directions. Knowledge from each new task is incorporated into this evolving subspace, facilitating forward knowledge transfer, while minimizing catastrophic interference. This approach achieves up to 100x parameter reduction and 281x memory savings over traditional LoRA methods, maintaining performance comparable to jointly trained models. A single Share model can replace hundreds of task-specific LoRA adapters, supporting scalable, asynchronous continual learning. Experiments across image classification, natural language understanding, 3D pose estimation, and text-to-image generation validate its effectiveness, making Share a practical and scalable solution for lifelong learning in large-scale AI systems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 5 Feb 2026.
Builds on
31 of 48 references.
References · 31
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2021Learning to Prompt for Continual Learningcited by 938
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
19 more
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
- 2024Boosting Continual Learning of Vision-Language Models via Mixture-of-Experts Adapterscited by 199
- 2023ZipLoRA: Any Subject in Any Style by Effectively Merging LoRAscited by 194
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
- 2023S-LoRA: Serving Thousands of Concurrent LoRA Adapterscited by 146
- 2023Continual Diffusion: Continual Customization of Text-to-Image Diffusion with C-LoRAcited by 138
- 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 120
- 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 115
- 2021Unraveling the Hidden Environmental Impacts of AI Solutions for Environmentcited by 32
- 2023Batched Low-Rank Adaptation of Foundation Modelscited by 32
- 2024Compress then Serve: Serving Thousands of LoRA Adapters with Little Overheadcited by 24
- 2025The Universal Weight Subspace Hypothesiscited by 22
- 2023Continual Diffusion with STAMINA: STack-And-Mask INcremental Adapterscited by 10
- 2024iNeMo: Incremental Neural Mesh Models for Robust Class-Incremental Learningcited by 10
- 2025EigenLoRAx: Recycling Adapters to Find Principal Subspaces for Resource-Efficient Adaptation and Inferencecited by 9
- 2024Source-Free and Image-Only Unsupervised Domain Adaptation for Category Level Object Pose Estimationcited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.