Related papers: Normal approximation for stabilizing functionals
We combine Malliavin calculus with Stein's method to derive bounds for the Variance-Gamma approximation of functionals of isonormal Gaussian processes, in particular of random variables living inside a fixed Wiener chaos induced by such a…
In this paper we consider stochastic composite convex optimization problems with the objective function satisfying a stochastic bounded gradient condition, with or without a quadratic functional growth property. These models include the…
This paper is devoted to improvements of functional inequalities based on scalings and written in terms of relative entropies. When scales are taken into account and second moments fixed accordingly, deficit functionals provide explicit…
We present a de Bruijn type approximation for quantifying the content of m smooth numbers, derived from samples obtained through a probability measure over the set of integers less than or equal to n, with point mass function at k inversely…
We provide novel theoretical results regarding local optima of regularized $M$-estimators, allowing for nonconvexity in both loss and penalty functions. Under restricted strong convexity on the loss and suitable regularity conditions on the…
A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…
Shape restrictions such as monotonicity on functions often arise naturally in statistical modeling. We consider a Bayesian approach to the problem of estimation of a monotone regression function and testing for monotonicity. We construct a…
We consider the problem of minimizing the sum of two convex functions: one is the average of a large number of smooth component functions, and the other is a general convex function that admits a simple proximal mapping. We assume the whole…
Using lattice approximations of Euclidean space, we develop a way to approximate stable processes that are represented by stochastic integrals over Euclidean space. Via a stable version of the Lindeberg-Feller Theorem we show that the…
We prove a Poisson process approximation result for stabilizing functionals of a determinantal point process. Our results use concrete couplings of determinantal processes with different Palm measures and exploit their association…
We obtain explicit Berry-Esseen bounds in the Kolmogorov distance for the normal approximation of non-linear functionals of vectors of independent random variables. Our results are based on the use of Stein's method and of random difference…
We establish quantitative estimates for sampling (dominating) sets in model spaces associated with meromorphic inner functions, i.e. those corresponding to de Branges spaces. Our results encompass the Logvinenko-Sereda-Panejah (LSP) Theorem…
One of the key assumptions in the stability and convergence analysis of variational regularization is the ability of finding global minimizers. However, such an assumption is often not feasible when the regularizer is a black box or…
Certain Petrov-Galerkin schemes are inherently stable formulations of variational problems on a given mesh. This stability is primarily obtained by computing an optimal test basis for a given approximation space. Furthermore, these…
Initiated around the year 2007, the Malliavin-Stein approach to probabilistic approximations combines Stein's method with infinite-dimensional integration by parts formulae based on the use of Malliavin-type operators. In the last decade,…
Existing fundamental theorems for mean-square convergence of numerical methods for stochastic differential equations (SDEs) require globally or one-sided Lipschitz continuous coefficients, while strong convergence results under merely local…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
A key problem in approximation theory is the recovery of high-dimensional functions from samples. In many cases, the functions of interest exhibit anisotropic smoothness, and, in many practical settings, the nature of this anisotropy may be…
Based on the idea of randomizing the traditional space theory of functional analysis, random functional analysis has been developed as functional analysis over random metric spaces, random normed modules and random locally convex modules.…
Stochastic gradient descent (SGD) is a popular algorithm for minimizing objective functions that arise in machine learning. For constant step-sized SGD, the iterates form a Markov chain on a general state space. Focusing on a class of…