Pith. sign in

REVIEW 2 cited by

Information-Theoretic Probing with Minimum Description Length

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 2003.12298 v1 pith:OPUXJ6LJ submitted 2020-03-27 cs.CL

classification cs.CL
keywords probingaccuracyproberepresentationsamountdescriptionlengthdata
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

To measure how well pretrained representations encode some linguistic property, it is common to use accuracy of a probe, i.e. a classifier trained to predict the property from the representations. Despite widespread adoption of probes, differences in their accuracy fail to adequately reflect differences in representations. For example, they do not substantially favour pretrained representations over randomly initialized ones. Analogously, their accuracy can be similar when probing for genuine linguistic labels and probing for random synthetic tasks. To see reasonable differences in accuracy with respect to these random baselines, previous work had to constrain either the amount of probe training data or its model size. Instead, we propose an alternative to the standard probes, information-theoretic probing with minimum description length (MDL). With MDL probing, training a probe to predict labels is recast as teaching it to effectively transmit the data. Therefore, the measure of interest changes from probe accuracy to the description length of labels given representations. In addition to probe quality, the description length evaluates "the amount of effort" needed to achieve the quality. This amount of effort characterizes either (i) size of a probing model, or (ii) the amount of data needed to achieve the high quality. We consider two methods for estimating MDL which can be easily implemented on top of the standard probing pipelines: variational coding and online coding. We show that these methods agree in results and are more informative and stable than the standard probes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Compute-Optimal LLMs Provably Generalize Better With Scale

    cs.LG 2025-04 conditional novelty 7.0 of 10

    A fully empirical Freedman-type concentration bound shows the token-level generalization gap of compute-optimal LLMs shrinks with scale, provided measured loss variance and quantization error decrease.

  2. Slowing Learning by Erasing Simple Features

    cs.LG 2025-02 conditional novelty 7.0 of 10

    QLEACE removes all quadratically available class information from a representation, reliably slows feedforward networks, but can inject higher-order information that lets stronger architectures learn faster.

Pith tools