Related papers: A new method of normal approximation
We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…
This paper analyzes local convergence of the block Newton (BN) method introduced in [5, 6] for one-dimensional shallow neural network approximation to functions and diffusion-reaction problems. The BN method consists of the 2x2 block…
This paper investigates a local central limit theorem for a normalized sequence of random variables belonging to a fixed order Wiener chaos and converging to the standard normal distribution. We prove, without imposing any additional…
Using Bernstein polynomial approximations, we prove the central limit theorem for linear spectral statistics of sample covariance matrices, indexed by a set of functions with continuous fourth order derivatives on an open interval including…
In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…
In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the…
We establish presumably optimal rates of normal convergence with respect to the Kolmogorov distance for a large class of geometric functionals of marked Poisson and binomial point processes on general metric spaces. The rates are valid…
We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…
We present a general central limit theorem with simple, easy-to-check covariance-based sufficient conditions for triangular arrays of random vectors when all variables could be interdependent. The result is constructed from Stein's method,…
Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…
The purpose of this dissertation is to introduce a version of Stein's method of exchangeable pairs to solve problems in measure concentration. We specifically target systems of dependent random variables, since that is where the power of…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We consider a real random walk S_n = X_1 + ... + X_n attracted (without centering) to the normal law: this means that for a suitable norming sequence a_n we have the weak convergence S_n / a_n --> f(x) dx, where f(x) is the standard normal…
In this work we study and establish some quenched functional Central Limit Theorems (CLTs) for stationary random fields under a projective criteria. These results are functional generalizations of the theorems obtained by Zhang et al.…
We introduce a class of Boltzmann equations on the real line, which constitute extensions of the classical Kac caricature. The collisional gain operators are defined by smoothing transformations with quite general properties. By…
Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…
This paper concerns the development of Stein's method for chi-square approximation and its application to problems in statistics. New bounds for the derivatives of the solution of the gamma Stein equation are obtained. These bounds involve…
Finite element methods provide accurate and efficient methods for the numerical solution of partial differential equations by means of restricting variational problems to finite-dimensional approximating spaces. However, they do not…
Superlinear convergence has been an elusive goal for black-box nonsmooth optimization. Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular…