Sequential Learning Of Neural Networks for Prequential MDL
Not on the map. Why?
Abstract (arXiv)
Minimum Description Length (MDL) provides a framework and an objective for principled model evaluation. It formalizes Occam's Razor and can be applied to data from non-stationary sources. In the prequential formulation of MDL, the objective is to minimize the cumulative next-step log-loss when sequentially going through the data and using previous observations for parameter estimation. It thus closely resembles a continual- or online-learning problem. In this study, we evaluate approaches for computing prequential description lengths for image classification datasets with neural networks. Considering the computational cost, we find that online-learning with rehearsal has favorable performance compared to the previously widely used block-wise estimation. We propose forward-calibration to better align the models predictions with the empirical observations and introduce replay-streams, a minibatch incremental training technique to efficiently implement approximate random replay while avoiding large in-memory replay buffers. As a result, we present description lengths for a suite of image classification datasets that improve upon previously reported results by large margins.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 25 of its 47 references that are in the map. First posted on arXiv 14 Oct 2022.
Builds on
25 of 47 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2016Wide Residual Networkscited by 3,070
- 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 308
- 2020Information-Theoretic Probing with Minimum Description Lengthcited by 232
13 more
- 2021D'ya like DAGs? A Survey on Structure Learning and Causal Discoverycited by 211
- 2022The CLEAR Benchmark: Continual LEArning on Real-World Imagerycited by 93
- 2018The Description Length of Deep Learning Modelscited by 72
- 2020We Need to Talk About Random Splitscited by 71
- 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 69
- 2019Micro-Batch Training with Batch-Channel Normalization and Weight Standardizationcited by 46
- 2020Small Data, Big Decisions: Model Selection in the Small-Data Regimecited by 23
- 2021Rissanen Data Analysis: Examining Dataset Characteristics via Description Lengthcited by 22
- 2021Causal Direction of Data Collection Matters: Implications of Causal and Anticausal Learning for NLPcited by 21
- 2021On Anytime Learning at Macroscalecited by 20
- 2020Evaluating representations by the complexity of learning low-loss predictorscited by 16
- 2020Continual Learning from the Perspective of Compressioncited by 4
- 2021Prequential MDL for Causal Structure Learning with Neural Networkscited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 4; 2026: 3.
13 papers.
Sort:
- 2023Kalman Filter for Online Classification of Non-Stationary Datacited by 15
- 2024A Complexity-Based Theory of Compositionalitycited by 13
- 2024In-context learning and Occam's razorcited by 8
- 2025Understanding Prompt Tuning and In-Context Learning via Meta-Learningcited by 6
- 2025Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformerscited by 6
- 2024Transformers for Supervised Online Continual Learningcited by 5
- 2022Testing Independence of Exchangeable Random Variablescited by 2
- 2023Evaluating Representations with Readout Model Switchingcited by 2
- 2025Fine-Tuned In-Context Learners for Efficient Adaptationcited by 2
- 2025Efficient compression of neural networks and datasetscited by 1
- 2026Prediction Under Imperfect Compression: A Theory of Approximate MDLcited by 1
- 2026Information Abundance Paradox: Long-Context Training Undermines Parametric Knowledgecited by 1
1 more
- 2026Information Abundance Paradox: Long-Context Training Undermines Parametric Knowledge12 Aug 2026
- 2026Prediction Under Imperfect Compression: A Theory of Approximate MDL3 Jun 2026
- 2026Preliminary Insights in Chronos Frequency Data Understanding and Reconstruction7 May 2026
- 2025Fine-Tuned In-Context Learners for Efficient Adaptation22 Dec 2025
- 2025Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers26 Sep 2025
- 2025Efficient compression of neural networks and datasets23 May 2025
- 2025Understanding Prompt Tuning and In-Context Learning via Meta-Learning22 May 2025
- 2024A Complexity-Based Theory of Compositionality18 Oct 2024
- 2024In-context learning and Occam's razor17 Oct 2024
- 2024Transformers for Supervised Online Continual Learning3 Mar 2024
- 2023Kalman Filter for Online Classification of Non-Stationary Data14 Jun 2023
- 2023Evaluating Representations with Readout Model Switching19 Feb 2023
1 more
- 2022Testing Independence of Exchangeable Random Variables22 Oct 2022
- 2023Kalman Filter for Online Classification of Non-Stationary Datacited by 15
- 2024A Complexity-Based Theory of Compositionalitycited by 13
- 2024In-context learning and Occam's razorcited by 8
- 2025Understanding Prompt Tuning and In-Context Learning via Meta-Learningcited by 6
- 2025Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformerscited by 6
- 2024Transformers for Supervised Online Continual Learningcited by 5
- 2022Testing Independence of Exchangeable Random Variablescited by 2
- 2023Evaluating Representations with Readout Model Switchingcited by 2
- 2025Fine-Tuned In-Context Learners for Efficient Adaptationcited by 2
- 2025Efficient compression of neural networks and datasetscited by 1
- 2026Prediction Under Imperfect Compression: A Theory of Approximate MDLcited by 1
- 2026Information Abundance Paradox: Long-Context Training Undermines Parametric Knowledgecited by 1
12 most cited of 13 All 13 (JSON)
- 2026Information Abundance Paradox: Long-Context Training Undermines Parametric Knowledge12 Aug 2026
- 2026Prediction Under Imperfect Compression: A Theory of Approximate MDL3 Jun 2026
- 2026Preliminary Insights in Chronos Frequency Data Understanding and Reconstruction7 May 2026
- 2025Fine-Tuned In-Context Learners for Efficient Adaptation22 Dec 2025
- 2025Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers26 Sep 2025
- 2025Efficient compression of neural networks and datasets23 May 2025
- 2025Understanding Prompt Tuning and In-Context Learning via Meta-Learning22 May 2025
- 2024A Complexity-Based Theory of Compositionality18 Oct 2024
- 2024In-context learning and Occam's razor17 Oct 2024
- 2024Transformers for Supervised Online Continual Learning3 Mar 2024
- 2023Kalman Filter for Online Classification of Non-Stationary Data14 Jun 2023
- 2023Evaluating Representations with Readout Model Switching19 Feb 2023
12 newest of 13 All 13 (JSON)