Related papers: Concentration in unbounded metric spaces and algor…
This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm's iterates under the…
In this work we provide performance guarantees for hypocoercive non-reversible MCMC samplers $X_t$ with invariant measure $\mu_*$; our results apply in particular to the Langevin equation, Hamiltonian Monte-Carlo, and the bouncy particle…
We have previously reported a Bayesian algorithm for determining the coordinates of points in three-dimensional space from uncertain constraints. This method is useful in the determination of biological molecular structure. It is limited,…
The aim of this note is to investigate the concentration properties of unbounded functions of geometrically ergodic Markov chains. We derive concentration properties of centered functions with respect to the square of the Lyapunov's…
Uniform stability is a notion of algorithmic stability that bounds the worst case change in the model output by the algorithm when a single data point in the dataset is replaced. An influential work of Hardt et al. (2016) provides strong…
In this paper, we explore some links between transforms derived by Stein's method and concentration inequalities. In particular, we show that the stochastic domination of the zero bias transform of a random variable is equivalent to…
Matrix concentration inequalities provide information about the probability that a random matrix is close to its expectation with respect to the $l_2$ operator norm. This paper uses semigroup methods to derive sharp nonlinear matrix…
We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a…
We provide a simple, general argument to obtain improvements of concentration-type inequalities starting from improvements of their corresponding isoperimetric-type inequalities. We apply this argument to obtain robust improvements of the…
This work is concerned with approximating multivariate functions in unbounded domain by using discrete least-squares projection with random points evaluations. Particular attention are given to functions with random Gaussian or Gamma…
We show several variants of concentration inequalities on the sphere stated as subgaussian estimates with optimal constants. For a Lipschitz function, we give one-sided and two-sided bounds for deviation from the median as well as from the…
The method to derive uniform bounds with Gaussian and Rademacher complexities is extended to the case where the sample average is replaced by a nonlinear statistic. Tight bounds are obtained for U-statistics, smoothened L-statistics and…
We prove concentration inequalities and associated PAC bounds for continuous- and discrete-time additive functionals for possibly unbounded functions of multivariate, nonreversible diffusion processes. Our analysis relies on an approach via…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
We study various generalizations of concentration of measure on the unit sphere, in particular by means of log-Sobolev inequalities. First, we show Sudakov-type concentration results and local semicircular laws for weighted random matrices.…
Gaussian distributions are plentiful in applications dealing in uncertainty quantification and diffusivity. They furthermore stand as important special cases for frameworks providing geometries for probability measures, as the resulting…
We prove higher order concentration bounds for functions on Stiefel and Grassmann manifolds equipped with the uniform distribution. This partially extends previous work for functions on the unit sphere. Technically, our results are based on…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
Machine learning models with inputs in a Euclidean space $\mathbb{R}^d$, when implemented on digital computers, generalize, and their generalization gap converges to $0$ at a rate of $c/N^{1/2}$ concerning the sample size $N$. However, the…
The decentralized gradient descent (DGD) algorithm, and its sibling, diffusion, are workhorses in decentralized machine learning, distributed inference and estimation, and multi-agent coordination. We propose a novel, principled framework…