Estimating stationary mass, frequency by frequency
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
- 2023Calibrated Language Models Must Hallucinatecited by 115
- 2020Conformal prediction for time seriescited by 53
- 2021Optimal and instance-dependent guarantees for Markovian linear stochastic approximationcited by 33
- 2021Accelerated and instance-optimal policy evaluation with linear function approximationcited by 18
- 2018On Learning Markov Chainscited by 13
- 2018Statistical Estimation of Ergodic Markov Chain Kernel over Discrete State Spacecited by 10
- 2021How good is Good-Turing for Markov samples?cited by 4
- 2024Just Wing It: Near-Optimal Estimation of Missing Mass in a Markovian Sequencecited by 4
- 2024Markov Chain Variance Estimation: A Stochastic Approximation Approachcited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Predictive inference for time series: why is split conformal effective despite temporal dependence?cited by 9
- 2026Leave a Window Out: Modifying the Jackknife for Predictive Inference in Time Seriescited by 4
- 2026Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffercited by 1
- 2026Next-token functional estimationcited by 0
- 2026Next-token functional estimation17 Sep 2026
- 2026Leave a Window Out: Modifying the Jackknife for Predictive Inference in Time Series28 May 2026
- 2026Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer4 Jan 2026
- 2025Predictive inference for time series: why is split conformal effective despite temporal dependence?2 Oct 2025