arxiv
PublishedOctober 3, 2026 at 4:00 AM
PMF-CL: Pareto-Minimal-Forgetting Continual Learner for Conflicting Tasks
Publisher summary· verbatim
arXiv:2605.19145v3 Announce Type: replace Abstract: In the literature, many continual learning (CL) algorithms have been proposed to address the issue of catastrophic forgetting in ML models (i.e., learning new tasks leads to the loss of performance on previously learned tasks). Although all CL appr
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSequential Capacity of Quantum Processes with Finite Memory13harxivQ-MINO: A Minimal-Norm Method for Quantization-Aware Training13harxivThe Price of Correlated Tests: How Strict Should a Model Release Gate Be?13harxivOpen Vocabulary Word Recognition From Transcribed Bangla Texts13hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗