mlsanityData to 14 Oct 2026

Towards a theory of out-of-distribution learning

arXiv 2109.14501 ↗First posted 29 Sep 2021stat.ML cs.AI cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Learning is a process wherein a learning agent enhances its performance through exposure of experience or data. Throughout this journey, the agent may encounter diverse learning environments. For example, data may be presented to the leaner all at once, in multiple batches, or sequentially. Furthermore, the distribution of each data sample could be either identical and independent (iid) or non-iid. Additionally, there may exist computational and space constraints for the deployment of the learning algorithms. The complexity of a learning task can vary significantly, depending on the learning setup and the constraints imposed upon it. However, it is worth noting that the current literature lacks formal definitions for many of the in-distribution and out-of-distribution learning paradigms. Establishing proper and universally agreed-upon definitions for these learning setups is essential for thoroughly exploring the evolution of ideas across different learning scenarios and deriving generalized mathematical bounds for these learners. In this paper, we aim to address this issue by proposing a chronological approach to defining different learning tasks using the provably approximately correct (PAC) learning framework. We will start with in-distribution learning and progress to recently proposed lifelong or continual learning. We employ consistent terminology and notation to demonstrate how each of these learning frameworks represents a specific instance of a broader, more generalized concept of learnability. Our hope is that this work will inspire a universally agreed-upon approach to quantifying different types of learning, fostering greater understanding and progress in the field.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 19 of its 74 references that are in the map. First posted on arXiv 29 Sep 2021.

Builds on

19 of 74 references.

References · 19

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  6. 2016Progressive Neural Networkscited by 1,361
  7. 2018Taskonomy: Disentangling Task Transfer Learningcited by 634
  8. 2013Domain Generalization via Invariant Feature Representationcited by 623
  9. 2020Inductive Biases for Deep Learning of Higher-Level Cognitioncited by 275
  10. 2018Task-Free Continual Learningcited by 221
  11. 2020The Next Decade in AI: Four Steps Towards Robust Artificial Intelligencecited by 195
  12. 2018Strike (with) a Pose: Neural Networks Are Easily Fooled by Strange Poses of Familiar Objectscited by 143
7 more
  1. 2019Online Meta-Learningcited by 137
  2. 2020A Neural Dirichlet Process Mixture Model for Task-Free Continual Learningcited by 134
  3. 2018Don't forget, there is more than forgetting: new metrics for Continual Learningcited by 115
  4. 2018Task Agnostic Continual Learning Using Online Variational Bayescited by 61
  5. 2021Out of Distribution Generalization in Machine Learningcited by 60
  6. 2020The Unreasonable Effectiveness of Deep Learning in Artificial Intelligencecited by 57
  7. 2019Task Agnostic Continual Learning via Meta Learningcited by 53

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 4; 2025: 1.

11 papers.