Pith. sign in

REVIEW 1 cited by

Understanding Continual Learning Settings with Data Distribution Drift Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.01678 v2 pith:3LFSYMLJ submitted 2021-04-04 cs.LG cs.AI

classification cs.LGcs.AI
keywords distributionlearningcontinualdatadriftcontextdriftsalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Classical machine learning algorithms often assume that the data are drawn i.i.d. from a stationary probability distribution. Recently, continual learning emerged as a rapidly growing area of machine learning where this assumption is relaxed, i.e. where the data distribution is non-stationary and changes over time. This paper represents the state of data distribution by a context variable $c$. A drift in $c$ leads to a data distribution drift. A context drift may change the target distribution, the input distribution, or both. Moreover, distribution drifts might be abrupt or gradual. In continual learning, context drifts may interfere with the learning process and erase previously learned knowledge; thus, continual learning algorithms must include specialized mechanisms to deal with such drifts. In this paper, we aim to identify and categorize different types of context drifts and potential assumptions about them, to better characterize various continual-learning scenarios. Moreover, we propose to use the distribution drift framework to provide more precise definitions of several terms commonly used in the continual learning field.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Exploring Kolmogorov-Arnold Network Expansions in Vision Transformers for Mitigating Catastrophic Forgetting in Continual Learning

    cs.CV 2025-07 reject novelty 3.0 of 10

    KAN-based ViTs show slight average incremental accuracy gains over MLP-ViTs in continual learning, but the paper's own data show worse forgetting on CIFAR-100 and worse last-task accuracy on MNIST.

Pith tools