Related papers: Bernstein's inequalities for general Markov chains

We consider Markov chain with spectral gap in $L^2$ space. Assume that $f$ is a bounded function. Then the probabilities of large deviations of average along trajectory satisfy Hoeffding's-type inequalities. These bounds depend only on the…

When implementing Markov Chain Monte Carlo (MCMC) algorithms, perturbation caused by numerical errors is sometimes inevitable. This paper studies how perturbation of MCMC affects the convergence speed and Monte Carlo estimation accuracy.…

We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…

We study the convergence of Bernstein type operators leading to two results. The first: The kernel $K_n$ of the Bernstein-Durrmeyer operator at each point $x \in (0, 1)$ $\unicode{x2013}$ that is $K_n(x, t) dt$ $\unicode{x2013}$ once…

In this paper we obtain a Bernstein type inequality for a class of weakly dependent and bounded random variables. The proofs lead to a moderate deviations principle for sums of bounded random variables with exponential decay of the strong…

Bernstein inequalities and inverse theorems are a recent development in the theory of radial basis function(RBF) approximation. The purpose of this paper is to extend what is known by deriving $L^p$ Bernstein inequalities for RBF networks…

Simple inequalities are established for some integrals involving the modified Bessel functions of the first and second kind. In most cases, we show that we obtain the best possible constant or that our bounds are tight in certain limits. We…

We extend the classical Bernstein technique to the setting of integro-differential operators. As a consequence, we provide first and one-sided second derivative estimates for solutions to fractional equations, including some convex fully…

There is a lack of simple and scalable algorithms for uncertainty quantification. Bayesian methods quantify uncertainty through posterior and predictive distributions, but it is difficult to rapidly estimate summaries of these…

We give a number of results on approximations of Markov kernels in total variation and Wasserstein norms weighted by a Lyapunov function. The results are applied to examples from Bayesian statistics where approximations to transition…

We consider Markov chains which are polynomially mixing, in a weak sense expressed in terms of the space of functions on which the mixing speed is controlled. In this context, we prove polynomial large and moderate deviations inequalities.…

We investigate the use of a certain class of functional inequalities known as weak Poincar\'e inequalities to bound convergence of Markov chains to equilibrium. We show that this enables the straightforward and transparent derivation of…

We study Poisson's equation in the context of general state space Markov chains. For chains satisfying a contraction assumption w.r.t. a Wasserstein distance, we show that a solution exists for Lipschitz functions and investigate its…

In this paper we establish for the first time local semiconvexity estimates for fully nonlinear equations and for obstacle problems driven by integro-differential operators with general kernels. Our proof is based on the Bernstein…

We revisit the Markov approximation necessary to derive ordinary Brownian motion from a model widely adopted in literature for this specific purpose. We show that this leads to internal inconsistencies, thereby implying that further search…

Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…

We establish the weak large deviations principle for empirical measures of Markov chains on $\mathbb R^d$ under mild assumptions. In particular, no irreducibility is assumed and the initial measure may be arbitrary. The proof is entirely…

The generalized perturbative approach is an all purpose variant of Stein's method used to obtain rates of normal approximation. Originally developed for functions of independent random variables this method is here extended to functions of…

We introduce a new framework that yields spectral bounds on norms of functions of transition maps for finite, homogeneous Markov chains. The techniques employed work for bounded semigroups, in particular for classical as well as for quantum…

A Bernstein-type exponential inequality for (generalized) canonical U-statistics of order 2 is obtained and the Rosenthal and Hoffmann-J{\o}rgensen inequalities for sums of independent random variables are extended to (generalized)…