Backend
Minimax estimation of the pseudo-spectral gap of continuous Markov chains, with applications to empirical concentration bounds
arXiv stat.TH0 views
arXiv:2610.20007v1 Announce Type: cross Abstract: We study the minimax estimation of the pseudo-spectral gap $\gamma_{ps}$ of a Markov chain from the observation of a single trajectory. Extending earlier works on finite-state space chains by Wolfer and Kontorovich (2024), we provide an estimator in the case of a compact, continuous state-space. Our estimator appears to be minimax-optimal on the class of chains with a transition operator with Lipschitz density, up to logarithmic terms. Our estimator, combined with Paulin's version of Bernstein inequality, allows to derive empirical concentration inequalities for Markov chains. This unlocks many applications, from confidence intervals, to active learning and generalization bounds. In particular, for rested bandits with Markov rewards, we provide a version of UCB with a regret bound similar to the one in the iid case, without assuming any knowledge on the pseudo-spectral gap of the chains.
Source:https://arxiv.org/abs/2610.20007Related posts
I Had a Perfect Sprint Board. 18 AI Subagents Still Wrecked the Repo.
0dev.to GitHub
What Is Attribution? AI Music Needs a Trail Back to the People Who Made the Work
0dev.to News
A Free Google Alerts Alternative: Monitoring Global News With the GDELT DOC API
0dev.to News
Butter Scraped Over Too Much Bread
0dev.to Discuss
From Six Seven to Six Zeros to What Next?
0dev.to Discuss
When a document assistant refuses: quota, context, and the missing model call
0dev.to C#