Minimax Forward and Backward Learning of Evolving Tasks with Performance Guarantees
Not on the map. Why?
Abstract (arXiv)
For a sequence of classification tasks that arrive over time, it is common that tasks are evolving in the sense that consecutive tasks often have a higher similarity. The incremental learning of a growing sequence of tasks holds promise to enable accurate classification even with few samples per task by leveraging information from all the tasks in the sequence (forward and backward learning). However, existing techniques developed for continual learning and concept drift adaptation are either designed for tasks with time-independent similarities or only aim to learn the last task in the sequence. This paper presents incremental minimax risk classifiers (IMRCs) that effectively exploit forward and backward learning and account for evolving tasks. In addition, we analytically characterize the performance improvement provided by forward and backward learning in terms of the tasks' expected quadratic change and the number of tasks. The experimental evaluation shows that IMRCs can result in a significant performance improvement, especially for reduced sample sizes.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 42 references that are in the map. First posted on arXiv 24 Oct 2023.
Builds on
23 of 42 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 426
- 2017Variational Continual Learningcited by 335
- 2021Online Continual Learning in Image Classification: An Empirical Surveycited by 242
- 2018Reinforced Continual Learningcited by 186
- 2022The CLEAR Benchmark: Continual LEArning on Real-World Imagerycited by 92
- 2020Gradient-based Editing of Memory Examples for Online Task-free Continual Learningcited by 62
- 2015A Century of Portraits: A Visual Historical Record of American High School Yearbookscited by 54
11 more
- 2021Posterior Meta-Replay for Continual Learningcited by 45
- 2016A Minimax Approach to Supervised Learningcited by 33
- 2017On the Reliable Detection of Concept Drift from Streaming Unlabeled Datacited by 32
- 2017Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamicscited by 28
- 2021Optimizing Reusable Knowledge for Continual Learning via Metalearningcited by 24
- 2018Handling Concept Drift via Model Reusecited by 15
- 2020Generalized Maximum Entropy for Supervised Classificationcited by 12
- 2020Minimax Classification with 0-1 Loss and Performance Guaranteescited by 11
- 2020The Strength of Nesterov's Extrapolation in the Individual Convergence of Nonsmooth Optimizationcited by 9
- 2022Minimax risk classifiers with 0-1 losscited by 9
- 2022Minimax Classification under Concept Drift with Multidimensional Adaptation and Performance Guaranteescited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.