PaLoRA: Paced Low-Rank Adaptation for Continual Learning
Summary
PaLoRA introduces a paced low-rank adaptation method for LoRA-based continual learning, deriving an optimal adaptive pacing law that scales gradient step magnitude with the effective rank of accumulated knowledge. The method combines adaptive SVD truncation, null-space gradient projection, and rank-aware pacing, achieving consistent gains including 4% accuracy improvements on 50-task ImageNet-A and ImageNet-R benchmarks.
View Cached Full Text
Cached at: 10/06/26, 04:53 AM
Paper page - PaLoRA: Paced Low-Rank Adaptation for Continual Learning
Source: https://huggingface.co/papers/2610.04226
Abstract
LoRA-basedcontinuallearningmethodsmitigatecatastrophicforgettingthroughvariousmechanisms,yetnearlyallcomplementthesewithsmalllearningratesasaheuristictorestrictgradientscalingmagnitude.Suchfixedheuristicslacktheoreticalguidanceonhowthestrengthofthisrestrictionshouldevolveastasksaccumulate.Werevealthatevenunderdirectionalconstraintssuchasnullspaceprojection,finite-precisionupdatesinevitablyleakintothesubspaceofaccumulatedpriorknowledgealongmultipledirections.Whilesmalllearningratesattenuatesuchleakage,theycannotpreventtheaccumulatedforgettingfromintensifyingastheeffectiverankofhistoricalknowledgegrows.Weshowthattheoptimalmagnituderestrictionshouldadaptivelyincreasewiththiseffectiveranktobalancestabilityandplasticity,i.e.,preservationofpreviousknowledgeandacquisitionofnewtaskinformation.Underananisotropicleakagemodel,wederiveapacinglaws^*=R/cthatcharacterizestheoptimalscalingofgradientsteps,i.e.,themagnituderestrictionitself,whereRistheeffectiverankofpastupdates.Basedonthisinsight,weproposePaLoRA,whichcompresseshistoricalknowledgeviaadaptiveSVDtruncation,projectsgradientsontothenullspaceofpriortasks,andappliesrank-awareadaptivepacing.Experimentsdemonstrateconsistentimprovementsoverpriormethods,withparticularlystrongperformanceinlong-horizonsettings,achievingsubstantialgainsof4%accuracyonchallenging50-taskImageNet-AandImageNet-Rbenchmarks.
View arXiv pageView PDFGitHub0Add to collection
Get this paper in your agent:
hf papers read 2610\.04226
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2610.04226 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2610.04226 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2610.04226 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
MuLoRA: Spectrally Balanced Low-Rank Adaptation for Continual Learning
MuLoRA introduces a spectrally balanced low-rank adaptation method for continual learning that identifies 'spectral plasticity collapse' in LoRA updates and addresses it via historical whitening and momentum-based orthogonalization, achieving the best mean accuracy in 15 of 16 reported metrics across class-incremental benchmarks.
LoRA-GA$^2$: Low Rank Adaptation with Multi-step Gradient Adaptive Alignment
This paper introduces LoRA-GA2, a fine-tuning algorithm that leverages multi-step gradient information to improve the performance of Low-Rank Adaptation for large language models, achieving better results on benchmarks while preserving efficiency.
BaLoRA: Bayesian Low-Rank Adaptation of Large Scale Models
BaLoRA introduces a Bayesian extension to Low-Rank Adaptation (LoRA) that provides calibrated uncertainty estimates and improves prediction accuracy by narrowing the gap with full fine-tuning.
Automatic Rank Allocation for Low-Rank Adaptation in Large Language Models via lp Regularization
This paper introduces ℓp-LoRA, a principled method for automatic rank allocation in low-rank adaptation using ℓp regularization, demonstrating competitive performance on NLP tasks.
Normalized Low-Rank Adaptation
Normalized Low-Rank Adaptation (NoRA) stabilizes LoRA training by normalizing down-projection matrices, accelerating convergence and improving performance without extra parameters or inference cost.