mlsanityData to 13 Oct 2026

Estimating stationary mass, frequency by frequency

arXiv 2503.12808 ↗First posted 17 Mar 2025stat.ML cs.IT cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Suppose we observe a trajectory of length n from an exponentially α-mixing stochastic process over a finite but potentially large state space. We consider the problem of estimating the probability mass placed by the stationary distribution of any such process on elements that occur with a certain frequency in the observed sequence. We estimate this vector of probabilities in total variation distance, showing universal consistency in n and recovering known results for i.i.d. sequences as special cases. Our proposed methodology -- implementable in linear time -- carefully combines the plug-in (or empirical) estimator with a recently-proposed modification of the Good--Turing estimator called WingIt, which was originally developed for Markovian sequences. En route to controlling the error of our estimator, we develop new performance bounds on WingIt and the plug-in estimator for exponentially α-mixing stochastic processes. Importantly, the extensively used method of Poissonization can no longer be applied in our non i.i.d. setting, and so we develop complementary tools -- including concentration inequalities for a natural self-normalized statistic of mixing sequences -- that may prove independently useful in the design and analysis of estimators for related problems. Simulation studies corroborate our theoretical findings.

Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 9 of its 43 references that are in the map. First posted on arXiv 17 Mar 2025.

Builds on

9 of 43 references.

References · 9

  1. 2023Calibrated Language Models Must Hallucinatecited by 115
  2. 2020Conformal prediction for time seriescited by 53
  3. 2021Optimal and instance-dependent guarantees for Markovian linear stochastic approximationcited by 33
  4. 2021Accelerated and instance-optimal policy evaluation with linear function approximationcited by 18
  5. 2018On Learning Markov Chainscited by 13
  6. 2018Statistical Estimation of Ergodic Markov Chain Kernel over Discrete State Spacecited by 10
  7. 2021How good is Good-Turing for Markov samples?cited by 4
  8. 2024Just Wing It: Near-Optimal Estimation of Missing Mass in a Markovian Sequencecited by 4
  9. 2024Markov Chain Variance Estimation: A Stochastic Approximation Approachcited by 2

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.