Minimax Forward and Backward Learning of Evolving Tasks with Performance Guarantees

Verónica Álvarez, Santiago Mazuelas, J. A. Lozano
10/1/2023

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{lvarez2023minimax,
  title  = {Minimax Forward and Backward Learning of Evolving Tasks with Performance Guarantees},
  author = {Verónica Álvarez and Santiago Mazuelas and J. A. Lozano},
  year   = {2023},
  eprint = {2310.15974},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2310.15974},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.15974.svg)](https://codeofpaper.com/paper/2310.15974)

Discussion