mlsanityData to 7 Oct 2026

A Controlled Counterexample to Strong Proxy-Based Explanations of OOD Performance: in a Fixed Pretraining-and-Probing Setup

arXiv 2605.11554 ↗First posted 12 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Task-agnostic structure proxies are often used to interpret why one pretraining corpus transfers better than another, but such explanations require the proxy to track the structure that matters for the downstream task. We test this requirement in a fixed pretraining-and-probing setup motivated by computationally bounded notions of learned structure, including epiplexity. The core question is whether a proxy ranking of two pretraining datasets must agree with their ranking by OOD probe accuracy. We show that it need not. First, we give a controlled construction in which a formal structure quantity, its operational proxy, and the task-relevant structure for a target family separate. We then instantiate the same mechanism in a synthetic sequence-model experiment: under the primary all-sample evaluation, the OOD accuracy ranking reverses the proxy ranking in two of three seeds, with auxiliary diagnostics and ablations supporting the same interpretation. The counterexample does not reject structure-based explanations in general; it identifies a boundary on strong proxy-based explanations. A proxy for total learned structure can fail to track the task-relevant structure that drives OOD performance, even in a controlled setting.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 13 references that are in the map. First posted on arXiv 12 May 2026.

Builds on

6 of 13 references.

References · 6

  1. 2016Understanding intermediate layers using linear classifier probescited by 1,279
  2. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  3. 2019Designing and Interpreting Probes with Control Taskscited by 608
  4. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
  5. 2020Information-Theoretic Probing with Minimum Description Lengthcited by 230
  6. 2026From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligencecited by 39

Built on by

Not cited yet.