mlsanityData to 7 Oct 2026

Information Theory in Open-world Machine Learning Foundations, Frameworks, and Future Direction

arXiv 2510.15422 ↗First posted 17 Oct 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Open world Machine Learning (OWML) aims to develop intelligent systems capable of recognizing known categories, rejecting unknown samples, and continually learning from novel information. Despite significant progress in open set recognition, novelty detection, and continual learning, the field still lacks a unified theoretical foundation that can quantify uncertainty, characterize information transfer, and explain learning adaptability in dynamic, nonstationary environments. This paper presents a comprehensive review of information theoretic approaches in open world machine learning, emphasizing how core concepts such as entropy, mutual information, and Kullback Leibler divergence provide a mathematical language for describing knowledge acquisition, uncertainty suppression, and risk control under open world conditions. We synthesize recent studies into three major research axes: information theoretic open set recognition enabling safe rejection of unknowns, information driven novelty discovery guiding new concept formation, and information retentive continual learning ensuring stable long term adaptation. Furthermore, we discuss theoretical connections between information theory and provable learning frameworks, including PAC Bayes bounds, open-space risk theory, and causal information flow, to establish a pathway toward provable and trustworthy open world intelligence. Finally, the review identifies key open problems and future research directions, such as the quantification of information risk, development of dynamic mutual information bounds, multimodal information fusion, and integration of information theory with causal reasoning and world model learning.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 104 of its 144 references that are in the map. First posted on arXiv 17 Oct 2025.

Builds on

104 of 144 references.

References · 104

  1. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2016Learning without Forgettingcited by 2,465
  4. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  5. 2020Energy-based Out-of-distribution Detectioncited by 1,296
  6. 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
  7. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  8. 2016Deep Variational Information Bottleneckcited by 915
  9. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
  10. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  11. 2021Domain Generalization: A Surveycited by 760
  12. 2021A Survey of Uncertainty in Deep Neural Networkscited by 675
38 more
  1. 2019Benign Overfitting in Linear Regressioncited by 544
  2. 2015Towards Open Set Deep Networkscited by 533
  3. 2022Continual Test-Time Domain Adaptationcited by 520
  4. 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
  5. 2015Optimal Transport for Domain Adaptationcited by 457
  6. 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
  7. 2020Planning to Explore via Self-Supervised World Modelscited by 365
  8. 2023A Comprehensive Survey on Test-Time Adaptation under Distribution Shiftscited by 353
  9. 2021Open-Set Recognition: a Good Closed-Set Classifier is All You Need?cited by 351
  10. 2018Recent Advances in Open Set Recognition: A Surveycited by 309
  11. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
  12. 2021How to Train Your Energy-Based Modelscited by 271
  13. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 223
  14. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 189
  15. 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
  16. 2021A Fine-Grained Analysis on Distribution Shiftcited by 171
  17. 2018Reducing Network Agnostophobiacited by 165
  18. 2021Open-World Semi-Supervised Learningcited by 165
  19. 2017Generative OpenMax for Multi-Class Open Set Classificationcited by 157
  20. 2016Variance-based regularization with convex objectivescited by 153
  21. 2021Adversarial Reciprocal Points Learning for Open Set Recognitioncited by 153
  22. 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 141
  23. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
  24. 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 118
  25. 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116
  26. 2022Causal Machine Learning: A Survey and Open Problemscited by 107
  27. 2023How Does Information Bottleneck Help Deep Learning?cited by 92
  28. 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
  29. 2020A Wholistic View of Continual Learning with Deep Neural Networks: Forgotten Lessons and the Bridge to Active and Open World Learningcited by 86
  30. 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
  31. 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
  32. 2018Generalization Bounds for Uniformly Stable Algorithmscited by 56
  33. 2020Estimating Generalization under Distribution Shifts via Domain-Invariant Representationscited by 56
  34. 2021Information-theoretic generalization bounds for black-box learning algorithmscited by 49
  35. 2022Open-environment Machine Learningcited by 48
  36. 2021Energy-Based Open-World Uncertainty Modeling for Confidence Calibrationcited by 46
  37. 2021Generalization Bounds For Meta-Learning: An Information-Theoretic Analysiscited by 45
  38. 2018Open-world Learning and Application to Product Classificationcited by 39

50 most cited of 104 All 104 (JSON)

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2020A Critical Evaluation of Open-World Machine Learning
  2. 2024Learning World Models With Hierarchical Temporal Abstractions: A Probabilistic Perspective
  3. 2026From Observation to Insight: Mechanistic World Models and the Quest for Autonomous Discovery
  4. 2026A Path-Space Formulation of Prediction in World Models: From a Single Action to Prediction, Planning, and Irreversibility
  5. 2026Information Theory and Statistical Learning
  6. 2026Can In-Context Learning Support Intrinsic Curiosity?
  7. 2026OpenWorldLib: A Unified Codebase and Definition of Advanced World Models
  8. 2022IRL with Partial Observations using the Principle of Uncertain Maximum Entropy