Related papers: Stochastic Localization + Stieltjes Barrier = Tigh…
We are interested in Sobolev type inequalities and their relationship with concentration properties on higher dimensions. We consider unbounded spin systems on the d-dimensional lattice with interactions that increase slower than a…
The Robbins-Siegmund theorem is one of the most important results in stochastic optimization, where it is widely used to prove the convergence of stochastic algorithms. We provide a quantitative version of the theorem, establishing a bound…
We consider a generic modified logarithmic Sobolev inequality (mLSI) of the form $\mathrm{Ent}_{\mu}(e^f) \le \tfrac{\rho}{2} \mathbb{E}_\mu e^f \Gamma(f)^2$ for some difference operator $\Gamma$, and show how it implies two-level…
We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…
``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization…
We prove a curvature-dimension criterion and obtain logarithmic Sobolev inequalities for generalised Cauchy measures with optimal weights and explicit constants. In the one-dimensional case, this constant is even optimal. From these…
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…
In this paper we establish some explicit and sharp estimates of the spectral gap and the log-Sobolev constant for mean field particles system, uniform in the number of particles, when the confinement potential have many local minimums. Our…
In a statistical mechanics model with unbounded spins, we prove uniqueness of the Gibbs measure under various assumptions on finite volume functional inequalities. We follow the approach of G. Royer (1999) and obtain uniqueness by showing…
Langevin diffusions are rapidly convergent under appropriate functional inequality assumptions. Hence, it is natural to expect that with additional smoothness conditions to handle the discretization errors, their discretizations like the…
We consider two most studied standard models in the theory of elasto-plasticity with hardening in arbitrary dimension $d\ge 2$, namely, the kinematic hardening and the isotropic hardening problem. While the existence and uniqueness of the…
Potential functions in highly pertinent applications, such as deep learning in over-parameterized regime, are empirically observed to admit non-isolated minima. To understand the convergence behavior of stochastic dynamics in such…
We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…
We prove stability estimates for the Bakry-Emery bound on Poincar\'e and logarithmic Sobolev constants of uniformly log-concave measures. In particular, we improve the quantitative bound in a result of De Philippis and Figalli asserting…
We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group…
In this paper, we are concerned with the optimal asymptotic lower bound for the stability of Sobolev inequality on the Heisenberg group. We first establish the optimal local stability of Sobolev inequality on the CR sphere through…
We put forward a new method for obtaining quantitative lower bounds on the top Lyapunov exponent of stochastic differential equations (SDEs). Our method combines (i) an (apparently new) identity connecting the top Lyapunov exponent to a…
We consider the problem of sampling from a strongly log-concave density in $\mathbb{R}^d$, and prove an information theoretic lower bound on the number of stochastic gradient queries of the log density needed. Several popular sampling…
Prior work (Klochkov $\&$ Zhivotovskiy, 2021) establishes at most $O\left(\log (n)/n\right)$ excess risk bounds via algorithmic stability for strongly-convex learners with high probability. We show that under the similar common assumptions…
We establish new sharp inequalities of Poincar\'{e} or log-Sobolev type, on geodesically-convex weighted Riemannian manifolds $(M,\mathfrak{g},\mu)$ whose (generalized) Ricci curvature $Ric_{\mathfrak{g},\mu,N}$ with effective dimension…