arXiv Machine Learning

When Muon Meets Task Interference: A Spectral Perspective on Continual Learning and Model Merging

arXiv AI
Jul 22

Soft-TransFormers for Continual Learning

arXiv:2411. 16073v4 Announce Type: replace-cross Abstract: Inspired by the Well-initialized Lottery Ticket Hypothesis (WLTH), we introduce Soft-TransFormers (Soft-TF), a continual learning framework that adapts a frozen pre-trained Transformer through task-specific soft subnetworks: real-valued multiplicative masks over the query, key, value, and output projections of selected self-attention layers.

By Haeyong Kang, Chang D. Yoo
arXiv Machine Learning
1d ago

Muon Can Outperform Dedicated Continual Learning Methods

arXiv:2609.24678v1 Announce Type: new Abstract: Continual learning with Low-Rank Adapters (LoRA) typically mitigates forgetting by penalizing the overlap between a new update and the accumulated past...

By Sebastian George Sincari (Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania), Bogdan Alexandru Gheorghe (Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania), Antonio Barbalau (Bitdefender, Bucharest, Romania)
arXiv Machine Learning
Aug 28

Unifying Detection and Adaptation in Task-Free Continual Learning

The paper introduces FiUni, a Fisher-guided unified framework that performs batch-level task detection and parameter-efficient continual adaptation for large language models. By exploiting orthogonality in the Fisher information matrix’s Kronecker-Factored Approximate Curvature subspaces, FiUni constructs frozen subspaces to guide low-rank adaptation and matches incoming batch windows to historical subspaces. This approach allows the model to decide whether to reuse, expand, or create new subspaces, balancing knowledge sharing and task isolation while achieving competitive performance with fewer trainable parameters.

By Dezheng Han, Anbang Zhang, Zhihao Zhu, Shuaishuai Guo
arXiv Machine Learning
5d ago

A Noise Optimum in Rehearsal-Free Continual Learning: Isolation, Mechanism, and Scope

The paper demonstrates that adding stochastic noise to a consolidation rule can improve a neural network’s retention of earlier tasks up to an optimal level, after which performance degrades, forming an inverted‑U relationship. Through simulations on related‑task continual‑learning benchmarks, the authors isolate the conditions that produce this optimum, showing it requires coherent restoration toward consolidated weights and is linked to the noise variance. The study further maps the scope of the effect, noting it depends on shared task structure and diminishes with more tasks, while a single‑seed hardware demonstration is referenced elsewhere.

By Gunner Levi Howe