A PECL method for ASR partitions weight matrices via singular values, adapts only via rotations in the tail subspace, and averages rotations across tasks to reduce forgetting while outperforming baselines on two benchmarks.
Parameter-Efficient Continual Learning for Automatic Speech Recognition
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Speech foundation models enable strong general-purpose ASR and are attractive for downstream adaptation. However, their size and the catastrophic forgetting induced by sequential fine-tuning demand parameter-efficient and regularized training methods, motivating parameter-efficient continual learning (PECL). While PECL has been widely studied in NLP and vision, it has received less attention in ASR. In this paper, we propose a simple yet effective PECL method based on recent advances in parameter-efficient fine-tuning for ASR. We partition pretrained weight matrices into head and tail subspaces according to singular values and restrict adaptation to approximate rotations within the low-energy tail subspace, preserving dominant components and reducing forgetting. For subsequent tasks, rotations are combined via weight averaging to further improve retention. Experiments on two benchmarks demonstrate reduced forgetting and superior overall performance compared to recent PECL baselines.
fields
eess.AS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parameter-Efficient Continual Learning for Automatic Speech Recognition
A PECL method for ASR partitions weight matrices via singular values, adapts only via rotations in the tail subspace, and averages rotations across tasks to reduce forgetting while outperforming baselines on two benchmarks.