Three rates of convergence or separation via U-statistics in a dependent framework

by   Quentin Duchemin, et al.

Despite the ubiquity of U-statistics in modern Probability and Statistics, their non-asymptotic analysis in a dependent framework may have been overlooked. In a recent work, a new concentration inequality for U-statistics of order two for uniformly ergodic Markov chains has been proved. In this paper, we put this theoretical breakthrough into action by pushing further the current state of knowledge in three different active fields of research. First, we establish a new exponential inequality for the estimation of spectra of trace class integral operators with MCMC methods. The novelty is that this result holds for kernels with positive and negative eigenvalues, which is new as far as we know. In addition, we investigate generalization performance of online algorithms working with pairwise loss functions and Markov chain samples. We provide an online-to-batch conversion result by showing how we can extract a low risk hypothesis from the sequence of hypotheses generated by any online learner. We finally give a non-asymptotic analysis of a goodness-of-fit test on the density of the invariant measure of a Markov chain. We identify some classes of alternatives over which our test based on the L_2 distance has a prescribed power.


page 1

page 2

page 3

page 4


Concentration inequality for U-statistics of order two for uniformly ergodic Markov chains, and applications

We prove a new concentration inequality for U-statistics of order two fo...

Hoeffding's lemma for Markov Chains and its applications to statistical learning

We establish the counterpart of Hoeffding's lemma for Markov dependent r...

Efficient shape-constrained inference for the autocovariance sequence from a reversible Markov chain

In this paper, we study the problem of estimating the autocovariance seq...

Stein's Method Meets Statistics: A Review of Some Recent Developments

Stein's method is a collection of tools for analysing distributional com...

Markov Chain Importance Sampling - a highly efficient estimator for MCMC

Markov chain algorithms are ubiquitous in machine learning and statistic...

Recovery guarantees for polynomial approximation from dependent data with outliers

Learning non-linear systems from noisy, limited, and/or dependent data i...

PCMC-Net: Feature-based Pairwise Choice Markov Chains

Pairwise Choice Markov Chains (PCMC) have been recently introduced to ov...

Please sign up or login with your details

Forgot password? Click here to reset