相关论文: On the tradeoff between almost sure error toleranc…
Martingale methods are used to study the almost everywhere convergence of general function series. Applications are given to ergodic series, which improves recent results of Fan \cite{FanETDS}, and to dilated series, including Davenport…
The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…
Consider a discrete-time martingale, and let $V^2$ be its normalized quadratic variation. As $V^2$ approaches 1, and provided that some Lindeberg condition is satisfied, the distribution of the rescaled martingale approaches the Gaussian…
We quantify the elementary Borel-Cantelli Lemma by higher moments of the overlap count statistic in terms of the weighted summability of the probabilities. Applications include mean deviation frequencies in the Strong Law and the Law of the…
This paper first introduces a refined version of the Azuma-Hoeffding inequality for discrete-parameter martingales with uniformly bounded jumps. The refined inequality is used to revisit the large deviations analysis of binary hypothesis…
We consider the moderate deviations behaviors for two (co-) volatility estima-tors: generalised bipower variation, Hayashi-Yoshida estimator. The results are obtained by using a new result about the moderate deviations principle for…
This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…
In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle and a variant of Chernoff bound in finite-state hidden Markov models. These limit…
Variational inference has recently emerged as a popular alternative to the classical Markov chain Monte Carlo (MCMC) in large-scale Bayesian inference. The core idea is to trade statistical accuracy for computational efficiency. In this…
This work develops change-point methods for statistics of high-frequency data. The main interest is in the volatility of an It\^{o} semi-martingale, the latter being discretely observed over a fixed time horizon. We construct a…
The typical central limit theorems in high-frequency asymptotics for semimartingales are results on stable convergence to a mixed normal limit with an unknown conditional variance. Estimating this conditional variance usually is a hard…
We study a stochastically perturbed version of the well-known Krasnoselski--Mann iteration for computing fixed points of nonexpansive maps in finite dimensional normed spaces. We discuss sufficient conditions on the stochastic noise and…
Simple Monte Carlo is a versatile computational method with a convergence rate of $O(n^{-1/2})$. It can be used to estimate the means of random variables whose distributions are unknown. Bernoulli random variables, $Y$, are widely used to…
This work explores the use of a forward-backward martingale method together with a decoupling argument and entropic estimates between the conditional and averaged measures to prove a strong averaging principle for stochastic differential…
The theory of stochastic approximations form the theoretical foundation for studying convergence properties of many popular recursive learning algorithms in statistics, machine learning and statistical physics. Large deviations for…
This paper establishes the first almost sure convergence rate and the first maximal concentration bound with exponential tails for general contractive stochastic approximation algorithms with Markovian noise. As a corollary, we also obtain…
In this paper, we develop necessary and sufficient conditions for the validity of a martingale approximation for the partial sums of a stationary process in terms of the maximum of consecutive errors. Such an approximation is useful for…
We precisely quantify the impact of statistical error in the quality of a numerical approximation to a random matrix eigendecomposition, and under mild conditions, we use this to introduce an optimal numerical tolerance for residual error…
In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…
For martingales with a wide range of integrability, we will quantify the rate of convergence of the central limit theorem via Wasserstein distances of order $r$, $1\le r\le 3$. Our bounds are in terms of Lyapunov's coefficients and the…