about
Shared LoRA Subspaces for Almost Strict Continual Learning (arxiv.org)
1 point by unisub_guy 237 days ago | hide | past | pdf | 1 comment on HN

In plain words: Instead of a separate small weight update per task, it keeps one shared set of update directions, folding in each new task's key directions. It cuts parameters up to 100-fold and memory 281-fold versus one-adapter-per-task, while matching models trained on all tasks together.

Abstract · Shared LoRA Subspaces for almost Strict Continual Learning

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.

Prakhar Kaushik, Ankit Vaidya, Shravan Chaudhari, Rama Chellappa, Alan Yuille
arXiv:2602.06043 · cs.LG, cs.AI, cs.CV · submitted Feb 5, 2026
abstract · pdf · html

add comment on HN

Strict Continual Learning for LLMs and Diffusion Models.