mlsanityData to 14 Oct 2026

Next-token functional estimation

arXiv 2609.19529 ↗First posted 17 Sep 2026stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Suppose we observe the first n points of a sequence of random variables having length n+1, and wish to estimate a functional of the unobserved final point and the empirical measure of the n observed training points. Such next-token functionals include the probability that the next token is novel (also known as the surprise probability), the tail probability of the minimum distance between the next token and training points, and the test error of a classifier trained on the observed points. All of these quantities are classically estimated by the leave-one-out method, which is inconsistent under temporal dependence. We propose a leave-a-window-out estimator, which deletes a window of length τ after each index before forming the empirical measure and reduces to leave-one-out at τ = 1. Under natural assumptions, we show that the error of our estimator decays at a parametric rate for any stationary β-mixing process that also admits a Marton coupling. Our results thus cover several natural functionals on a large class of stochastic processes. We complement these upper bounds with a sharp minimax lower bound for estimating the surprise probability on mixing Markov chains. Simulations on Markov chains, moving-average processes, and autoregressive processes show that our estimator succeeds in many scenarios where leave-one-out and add-constant baselines fail.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 45 references that are in the map. First posted on arXiv 17 Sep 2026.

Builds on

13 of 45 references.

References · 13

  1. 2023Calibrated Language Models Must Hallucinatecited by 115
  2. 2019High probability generalization bounds for uniformly stable algorithms with nearly optimal ratecited by 98
  3. 2019Sharper bounds for uniformly stable algorithmscited by 93
  4. 2018Generalization Bounds for Uniformly Stable Algorithmscited by 56
  5. 2021Optimal and instance-dependent guarantees for Markovian linear stochastic approximationcited by 33
  6. 2018On Learning Markov Chainscited by 13
  7. 2025Predictive inference for time series: why is split conformal effective despite temporal dependence?cited by 10
  8. 2024Just Wing It: Near-Optimal Estimation of Missing Mass in a Markovian Sequencecited by 5
  9. 2021How good is Good-Turing for Markov samples?cited by 4
  10. 2025Estimating stationary mass, frequency by frequencycited by 4
  11. 2026Leave a Window Out: Modifying the Jackknife for Predictive Inference in Time Seriescited by 4
  12. 2024Generalization Bounds for Dependent Data using Online-to-Batch Conversioncited by 3
1 more
  1. 2026Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffercited by 2

Built on by

Not cited yet.