Related papers: Berry--Esseen Bounds for Multivariate Nonlinear St…

We study the Langevin equation with stationary-increment Gaussian noise. We show the strong consistency and the asymptotic normality with Berry--Esseen bound of the so-called alternative estimator of the mean reversion parameter. The…

Incomplete U-statistics have been proposed to accelerate computation. They use only a subset of the subsamples required for kernel evaluations by complete U-statistics. This paper gives a finite sample bound in the style of Bernstein's…

Given a weakly dependent stationary process, we describe the transition between a Berry-Esseen bound and a second order Edgeworth expansion in terms of the Berry-Esseen characteristic. This characteristic is sharp: We show that Edgeworth…

We derive novel concentration inequalities that bound the statistical error for a large class of stochastic optimization problems, focusing on the case of unbounded objective functions. Our derivations utilize the following key tools: 1) A…

Relative entropy, as a divergence metric between two distributions, can be used for offline change-point detection and extends classical methods that mainly rely on moment-based discrepancies. To build a statistical test suitable for this…

Berry Esseen type bounds to the normal, based on zero- and size-bias couplings, are derived using Stein's method. The zero biasing bounds are illustrated with an application to combinatorial central limit theorems where the random…

Variational inference (VI) is widely used for approximate inference in Bayesian machine learning. In addition to this practical success, generalization bounds for variational inference and related algorithms have been developed, mostly…

We study in this paper lower bounds for the generalization error of models derived from multi-layer neural networks, in the regime where the size of the layers is commensurate with the number of samples in the training data. We show that…

Let $(g_{n})_{n\geq 1}$ be a sequence of independent and identically distributed (i.i.d.) $d\times d$ real random matrices. For $n\geq 1$ set $G_n = g_n \ldots g_1$. Given any starting point $x=\mathbb R v\in\mathbb{P}^{d-1}$, consider the…

In this paper, we obtain uniform bounds for a number of expressions that involve derivatives and integrals of modified Bessel functions. These uniform bounds are motivated by the need to bound such expressions in the study of variance-gamma…

This paper considers M-estimation of a nonlinear regression model with multiple change-points occuring at unknown times. The multi-phase random design regression model, discontinuous in each change-point, have an arbitrary error $\epsilon$.…

Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem…

We establish a finite-sample Berry-Esseen theorem for the entrywise limits of the eigenvectors for a broad collection of signal-plus-noise random matrix models under challenging weak signal regimes. The signal strength is characterized by a…

In this paper, we propose a new approach for deriving probabilistic inequalities. Our main idea is to exploit the information of underlying distributions by virtue of the monotone likelihood ratio property and Berry-Essen inequality.…

Let $\{{X}_k\}_{k\geq\mathbb{Z}}$ be a stationary sequence. Given $p\in(2,3]$ moments and a mild weak dependence condition, we show a Berry-Esseen theorem with optimal rate $n^{p/2-1}$. For $p\geq4$, we also show a convergence rate of…

We introduce a new family of distributions to approximate $\mathbb {P}(W\in A)$ for $A\subset\{...,-2,-1,0,1,2,...\}$ and $W$ a sum of independent integer-valued random variables $\xi_1$, $\xi_2$, $...,$ $\xi_n$ with finite second moments,…

Bayesian neural networks perform variational inference over the weights however calculation of the posterior distribution remains a challenge. Our work builds on variational inference techniques for bayesian neural networks using the…

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…

A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias…

We obtain non asymptotic bounds for the Monte Carlo algorithm associated to the Euler discretization of some diffusion processes. The key tool is the Gaussian concentration satisfied by the density of the discretization scheme. This…