arXiv AI
CoDe-LoRA: Mitigating the Orthogonality Dilemma in Continual Learning of LLMs via Knowledge Consolidation and Decoupling
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Statistics ML
6d ago
ChainLoRA: Geometry-Preserving Task Vector Merging for Continual Learning in LLMs
ChainLoRA is a replay‑free continual learning framework for large language models that merges task vectors while preserving geometry. It uses chain‑updated training with a one‑sided orthogonality proxy to keep historical state and regularization overhead constant, and applies post‑stream adaptive SVD merging with Procrustes adaptation to separate shared and task‑specific components. Experiments demonstrate state‑of‑the‑art performance on Large and SuperNI benchmarks and competitive results on Standard CL, approaching the scores of replay‑based methods.
arXiv AI
Jun 8
Sparse Subspace-to-Expert Sharing for Task-Agnostic Continual Learning
arXiv:2606. 07500v1 Announce Type: cross Abstract: Continual learning in Large Language Models (LLMs) is hindered by the plasticity-stability dilemma, where acquiring new capabilities often leads to catastrophic forgetting of previous knowledge.
arXiv AI
Aug 7
CP-MoE: Consistency-Preserving Mixture-of-Experts for Continual Learning
arXiv:2605. 20247v2 Announce Type: replace-cross Abstract: Catastrophic forgetting remains a major obstacle to continual learning in large language models (LLMs) and vision--language models (VLMs).
arXiv Machine Learning
Jul 28
Latent-LoRA: Compact Latent-Space Adapters with Gradient-Free Routing for Continual Learning
arXiv:2607. 23837v1 Announce Type: new Abstract: Large language models generalize well to individual tasks but lack an inherent mechanism for learning them sequentially, leading to catastrophic forgetting.
arXiv AI
Sep 28
Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Models
The paper introduces EoupCT, a framework that estimates and orthogonalizes unknown pre‑training gradients to mitigate catastrophic forgetting during continual fine‑tuning of large language models. It generates pseudo data most susceptible to forgetting using a learnable soft prompt with Gumbel‑Softmax, then jointly optimizes model parameters and the prompt via a first‑order Pareto optimizer to enforce orthogonality between new task updates and the estimated gradients. Experiments on multiple LLMs show that EoupCT preserves both task‑specific performance and the models’ inherent general‑purpose knowledge.
arXiv Machine Learning
Jun 25
BOFA: Bridge-Layer Orthogonal Low-Rank Fusion for CLIP-Based Class-Incremental Learning
arXiv:2511. 11421v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) aims to continually learn new categories without forgetting previously acquired knowledge.