Convergence of Continual Learning in Homogeneous Deep Networks
We characterize weakly regularized continual classification in homogeneous models as sequential projections onto task margin sets. This result generalizes prior analyses restricted to either stationary (single-task) deep models or continual linear models. We show that global convergence generally fails, even for simple models linear in data but nonlinear in parameters. Nevertheless, by leveraging results from nonconvex projection theory, we identify regularity properties of homogeneous deep networks that guarantee local linear convergence under random and cyclic task sequences. Finally, we ext
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- LinkedLinked via unknownLive Continual Learning in Machine Learning [D] →
- PossiblePossibly related (embedding) · 52%What's your take on continual learning? [D] →
- PossiblePossibly related (embedding) · 58%Exploring continual learning without replay buffers: Our findings using dynamic task-similarity routing [P] →
