Research / Repairing frozen models

Discover-Then-Distill: Separating Test-Time Adaptation from Self-Distillation Consolidation

Builds a compute-matched Discover–Then–Distill protocol that separates ephemeral test-time LoRA adaptation from self-distillation consolidation and reports a gain–retention diagnosis, with stable retention (ΔPPL −1.321).

Published
13 February 2026
Author
Ali Uyar
DOI
10.5281/zenodo.18634021
Code
github.com/aliuyar1234/discover-then-distill-paper

Abstract

We study an end-to-end Discover–Then–Distill loop for language models under a strict update policy: per-instance test-time adaptation is confined to ephemeral LoRA parameters, while persistent improvements are allowed only through demonstration-conditioned self-distillation (SDFT). The pipeline couples (i) an mHC Transformer backbone, (ii) test-time discovery via LoRA-only policy-gradient updates with archive reuse and KL-to-base shaping, and (iii) consolidation via reverse-KL distillation from high-reward discovered demonstrations.

We report a fully audited A→F campaign; phases A/B were completed in an initial pass and phases C–F were resumed under a phase-C throughput tweak that affects runtime accounting only (A/B outputs are unchanged). On 120 held-out discovery tasks with a compute-matched budget of N = 96 samples per task, held-out mean best reward is 0.8436 for base best-of-N, 0.8396 for main test-time training (TTT), and 0.8288 for post-SDFT best-of-N. The corresponding exact-match (reward = 1) rates are 30.8%, 32.9%, and 31.2%. Bootstrap confidence intervals for reward deltas overlap zero (TTT−Base: −0.0040, 95% CI [−0.0289, 0.0215]; Post-SDFT−Base: −0.0148, 95% CI [−0.0400, 0.0108]).

Ablations indicate sensitivity to objective and regularization: removing KL shaping or replacing the entropic objective with expected-reward updates degrades held-out reward at this budget, while disabling reuse slightly improves reward on the same seed. Consolidation does not increase held-out reward in this compute-matched profile, but retention is stable with an improved validation perplexity (ΔPPL = −1.321). Overall, this paper contributes an artifact-first, compute-bounded protocol and a calibrated gain–retention diagnosis rather than an over-claimed performance win.

Why it matters

Per-instance test-time updates can undermine a stable base checkpoint. Keeping that adaptation in ephemeral LoRA parameters and routing persistent updates through self-distillation lets test-time training and post-consolidation sampling be compared with best-of-N at a matched compute budget, with retention measured separately.

Cite

@misc{uyar2026discover,
  title     = {Discover-Then-Distill: Separating Test-Time Adaptation from Self-Distillation Consolidation},
  author    = {Uyar, Ali},
  year      = {2026},
  doi       = {10.5281/zenodo.18634021},
  publisher = {Zenodo},
  url       = {https://doi.org/10.5281/zenodo.18634021}
}
AU-18
Vapour: the task's 96 rollouts. Under TTT it climbs one row of indentations per LoRA step and is vented after the taskReceiver: the persistent checkpoint, filled by take-off alone over the 300 SDFT stepsThermometer: each condition's mean best reward on 120 held-out tasks. The collar marks the 0.95 demonstration filterSplitter on take-off: SDFT on the 38 train-side demonstrations above the collarDiscover-Then-Distill builds a compute-matched protocol with a strict update policy: test-time training on each held-out task is confined to an ephemeral LoRA adapter (12 steps × 8 rollouts, N = 96), and updates to the persistent checkpoint are reserved for self-distillation (SDFT, 300 steps, replay 0.2) on train-side demonstrations that reach reward 0.95, 38 of 160 tasks. On 120 held-out tasks with an mHC Transformer backbone, mean best reward is 0.8436 for base best-of-N, 0.8396 for TTT and 0.8288 after SDFT, with exact match 30.8%, 32.9% and 31.2%. Validation perplexity moves from 161.7 to 160.4 after consolidation (ΔPPL −1.321).