arXiv Machine Learning By Gilad Karpel, Edward Moroshko, Ran Levinstein, Ron Meir, Daniel Soudry, Itay Evron

Optimal L2 Regularization in High-dimensional Continual Linear Regression

Read the original on arXiv Machine Learning →

arXiv:2601. 13844v3 Announce Type: replace Abstract: We study generalization in an overparameterized continual linear regression setting, where a model is trained with L2 (isotropic) regularization across a sequence of tasks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 16

Optimal Explicit and Implicit Regularization Strengths in High-Dimensional Continual Linear Regression

The paper investigates continual linear regression in high-dimensional settings, deriving a closed-form expression for the generalization loss when using gradient descent with a fixed number of steps per task. It shows that the optimal fixed step size decays roughly as “ln T / T” for a single teacher and i.i.d. teachers, matching the performance of optimally tuned L2 regularization. The study also extends to generalized ridge regression with diagonal regularizers, identifies conditions for isotropic optimality, and reveals a regime where the step size stays finite as the number of tasks grows, highlighting a tradeoff between task variability and implicit regularization.

By Gilad Karpel, Daniel Soudry
arXiv AI
Sep 25

The Sequential Price of Continual Learning

The paper investigates the performance cost, termed the sequential price, incurred by sequential task updates in continual learning. In an overparameterized linear‑regression setting with i.i.d. task sampling, the authors prove that distribution‑level forgetting and population loss converge to a stationary limit that splits into the intrinsic loss of joint training and an additional sequential price. They further analyze elastic weight consolidation (EWC), showing how its regularization strength affects the stationary sequential price and demonstrate the theory on the Jester joke‑rating dataset.

By Zonghuan Xu, Xingjun Ma
Hugging Face Trending Papers
Jun 8

Preserving Plasticity in Continual Learning via Dynamical Isometry

Continual training of deep neural networks under non-stationarity often leads to a progressive loss of plasticity, eventually limiting further learning. We relate plasticity to the empirical Neural Tangent Kernel, and identify dynamical isometry (the condition that layer-wise Jacobian singular values remain close to one) as a key mechanism for preserving plasticity in continual learning.