Orthogonal Low-rank Adaptation in Lie Groups for Continual Learning of Large Language Models
Kefan Cao, Shuaicheng Wu
TL;DR
The paper tackles catastrophic forgetting in sequential fine-tuning of large language models (LLMs) by introducing OLieRA, a Lie-group–based continual learning framework that applies multiplicative updates $W \odot \exp(\Delta W)$ and enforces full-subspace orthogonality to preserve parameter geometry.OLieRA builds on low-rank adaptation (LoRA) while embedding updates in a Lie group and conducting them in the corresponding Lie algebra, enabling structure-preserving updates and interpretability via Hadamard-based operations and Taylor approximations of the exponential map.Empirical results show state-of-the-art performance on the Standard CL benchmark and competitive results on long-task sequences, with replay-free training and privacy-friendly inference, while Fisher-information analyses suggest updates that meaningfully interact with sensitive directions rather than avoiding them entirely.Overall, OLieRA provides a principled, efficient approach to continual learning for LLMs, unifying geometric parameter preservation with orthogonality constraints and low-rank updates to mitigate forgetting across many tasks.
Abstract
Large language models (LLMs) suffer from catastrophic forgetting in sequential multi-task learning. Existing parameter regularization methods (e.g., O-LoRA, N-LoRA) mitigate interference via low-rank subspace orthogonality, but additive updates distort the intrinsic geometry of model parameters. We propose \textbf{OLieRA}, a Lie group based fine-tuning framework that preserves parameter geometry through multiplicative updates while enforcing orthogonality across task subspaces. OLieRA achieves state-of-the-art performance on the Standard CL benchmark and remains highly competitive under large task sequences. It further inherits the replay-free and task-ID free inference properties of O-LoRA, establishing a principled paradigm for continual learning in LLMs.
