Pith. sign in

REVIEW 2 cited by

Sequential Learning Of Neural Networks for Prequential MDL

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 2210.07931 v1 pith:7QZTSAYA submitted 2022-10-14 stat.ML cs.LG

classification stat.MLcs.LG
keywords descriptionprequentialclassificationdatadatasetsestimationimagelarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. To Retain or to Adapt? Generalizing Continual Learning

    stat.ML 2026-07 accept novelty 7.5 of 10

    When retention induces positive stationary bias, historical knowledge becomes an optimization liability beyond a closed-form Critical Task Duration; Predictive CL with finite windows can beat both full Joint-Task and ...

  2. Efficient compression of neural networks and datasets

    cs.LG 2025-05 unverdicted novelty 5.0 of 10

    Refined probabilistic and smooth l0 pruning techniques approximate minimum description length for neural networks, achieving high compression with minimal accuracy loss and empirically verifying better sample efficien...

Pith tools