Signals 4 · free daily AI digest

BISECT: Bilevel Spectral Decomposition for Low-Rank Continual Learning

Paper recorded by Signals 4 on 2026-11-02 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-11-02 on arXiv · recorded by Signals 4 on 2026-11-03

Category: cs.LG · 机器学习 · first seen 2026-11-03

Abstract

Exemplar-free continual learning on pre-trained Vision Transformers increasingly relies on Low-Rank Adaptation (LoRA), yet prevailing methods govern the low-rank update space through strict subspace isolation. By projecting each incoming task into the approximate null space of historical token activations, isolation-based learners equate any cross-task feature overlap with catastrophic interferenc

Read on arXiv →

#26 most recent of 703 cs.LG papers we have recorded · ↑ newer: A Scaling Theory of Multi-Epoch Pretraining: Late-Time Overfitting and · ↓ older: Nonparametric Intensity Estimation for Covariate-Driven Poisson Proces
Cite this page: BISECT: Bilevel Spectral Decomposition for Low-Rank Continual Learning: the #26 most recent of 703 cs.LG papers we have recorded (as of 2026-11-02). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/bisect-bilevel-spectral-decomposition-for-low-rank-continual-learning.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions