Rosenthal-type inequalities for linear statistics of Markov chains
Not on the map. Why?
Abstract (arXiv)
In this paper, we establish novel concentration inequalities for additive functionals of geometrically ergodic Markov chains similar to Rosenthal inequalities for sums of independent random variables. We pay special attention to the dependence of our bounds on the mixing time of the corresponding chain. Precisely, we establish explicit bounds that are linked to the constants from the martingale version of the Rosenthal inequality, as well as the constants that characterize the mixing properties of the underlying Markov kernel. Finally, our proof technique is, up to our knowledge, new and is based on a recurrent application of the Poisson decomposition.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 9 of its 66 references that are in the map. First posted on arXiv 10 Mar 2023.
Builds on
9 of 66 references.
References · 9
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
- 2020On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentrationcited by 68
- 2022Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximationcited by 41
- 2022Adapting to Mixing Time in Stochastic Optimization with Markovian Datacited by 36
- 2021Optimal and instance-dependent guarantees for Markovian linear stochastic approximationcited by 33
- 2022Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizescited by 30
- 2021Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsizecited by 27
- 2021Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimensioncited by 11
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3; 2026: 1.
6 papers.
- 2023First Order Methods with Markovian Noise: from Acceleration to Variational Inequalitiescited by 14
- 2024Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson-Romberg Extrapolationcited by 6
- 2025High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolationcited by 1
- 2025Differential privacy guarantees of Markov chain Monte Carlo algorithmscited by 0
- 2025Statistical analysis of Inverse Entropy-regularized Reinforcement Learningcited by 0
- 2026Minimax estimation of the pseudo-spectral gap of continuous Markov chains, with applications to empirical concentration boundscited by 0
- 2026Minimax estimation of the pseudo-spectral gap of continuous Markov chains, with applications to empirical concentration bounds14 Oct 2026
- 2025Statistical analysis of Inverse Entropy-regularized Reinforcement Learning7 Dec 2025
- 2025High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolation7 Aug 2025
- 2025Differential privacy guarantees of Markov chain Monte Carlo algorithms24 Feb 2025
- 2024Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson-Romberg Extrapolation7 Oct 2024
- 2023First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities25 May 2023