Task-Free Continual Learning via Online Discrepancy Distance Learning
Fei Ye, Adrian G. Bors

TL;DR
This paper introduces a theoretical framework and a novel method for task-free continual learning that addresses forgetting and sample relevance, achieving state-of-the-art results in non-stationary data stream scenarios.
Contribution
It provides the first theoretical analysis of forgetting in TFCL and proposes ODDL, a discrepancy-based approach with dynamic expansion and sample selection for improved performance.
Findings
Achieves state-of-the-art results in TFCL tasks.
Provides theoretical insights into forgetting behavior.
Demonstrates effectiveness of discrepancy-based sample selection.
Abstract
Learning from non-stationary data streams, also called Task-Free Continual Learning (TFCL) remains challenging due to the absence of explicit task information. Although recently some methods have been proposed for TFCL, they lack theoretical guarantees. Moreover, forgetting analysis during TFCL was not studied theoretically before. This paper develops a new theoretical analysis framework which provides generalization bounds based on the discrepancy distance between the visited samples and the entire information made available for training the model. This analysis gives new insights into the forgetting behaviour in classification tasks. Inspired by this theoretical model, we propose a new approach enabled by the dynamic component expansion mechanism for a mixture model, namely the Online Discrepancy Distance Learning (ODDL). ODDL estimates the discrepancy between the probabilistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Data Stream Mining Techniques · Anomaly Detection Techniques and Applications
