arXiv cs.LGOctober 2, 2026
PMF-CL: Pareto-Minimal-Forgetting Continual Learner for Conflicting Tasks
Excerpt
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 approaches use some form of memory to retain information about past tasks, a grounded understanding of what information needs to be stored to minimize catastrophic forgetting remains elusive. Recently, it