- Volume 25, Number 4B (2019), 3912-3938.
Rademacher complexity for Markov chains: Applications to kernel smoothing and Metropolis–Hastings
The concept of Rademacher complexity for independent sequences of random variables is extended to Markov chains. The proposed notion of “regenerative block Rademacher complexity” (of a class of functions) follows from renewal theory and allows to control the expected values of suprema (over the class of functions) of empirical processes based on Harris Markov chains as well as the excess probability. For classes of Vapnik–Chervonenkis type, bounds on the “regenerative block Rademacher complexity” are established. These bounds depend essentially on the sample size and the probability tails of the regeneration times. The proposed approach is employed to obtain convergence rates for the kernel density estimator of the stationary measure and to derive concentration inequalities for the Metropolis–Hastings algorithm.
Bernoulli, Volume 25, Number 4B (2019), 3912-3938.
Received: June 2018
Revised: December 2018
First available in Project Euclid: 25 September 2019
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Bertail, Patrice; Portier, François. Rademacher complexity for Markov chains: Applications to kernel smoothing and Metropolis–Hastings. Bernoulli 25 (2019), no. 4B, 3912--3938. doi:10.3150/19-BEJ1115. https://projecteuclid.org/euclid.bj/1569398789