arXiv Machine Learning

PRISM-AMC: Replay-Free Continual Learning for Automatic Modulation Classification

arXiv AI
Oct 9

Stability-Plasticity Balance via Singular-Vector Selection in LLM Continual Learning

The paper introduces SVC, a parameter‑efficient continual‑learning method for large language models that uses singular‑vector channels as the unit for balancing plasticity and stability. By estimating each channel’s adaptation benefit and forgetting cost from domain‑specific and general‑domain data, SVC selectively updates only the most beneficial channels, employing knee‑based cost screening, Pareto‑front filtering, and Otsu thresholding. Experiments on four LLM families and eight downstream tasks show that SVC preserves pretrained capabilities while achieving strong performance compared to existing PEFT baselines.

By Lingxiang Wang, Hainan Zhang, Liang Pang, Hongwei Zheng, Zhiming Zheng
arXiv Machine Learning
Oct 23

Fine-Grained Analysis of Catastrophic Forgetting in Continual Learning via Algorithmic Stability

The paper introduces an algorithmic stability framework to analyze catastrophic forgetting in continual learning using SGD, without assuming a specific model architecture. It decomposes forgetting into intra‑task and cross‑task generalization gaps plus empirical forgetting, and derives bounds for different learning‑rate schedules. Experiments on Split CIFAR‑100 and Split MiniImageNet illustrate the theoretical insights.

By Guodong Zheng, Yan Sun, Peng Wang, Enneng Yang, Jiafei Lyu, Xiaochun Cao, Dacheng Tao, Li Shen
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.

By Bing Wang, Changchun Li, Xin-Qiang Cai, Lin Yuanbo Wu, Ximing Li, Gang Niu, Masashi Sugiyama