English
Related papers

Related papers: Regularization under diffusion and anti-concentrat…

200 papers

Let $\gamma_n$ be the standard Gaussian measure on $\mathbb R^n$ and let $(Q_t)$ be the Ornstein--Ulhenbeck semigroup. Eldan and Lee recently established that for every non--negative function $f$ of integral $1$ and any time $t$ the…

Probability · Mathematics 2015-05-18 Joseph Lehec

We prove that under the heat semigroup $(P_\tau)$ on the Boolean hypercube, any nonnegative function exhibits a uniform tail bound that is better than Markov's inequality. Specifically, for any $\tau > 0$, $n \geq 1$, $\eta > e^3$, and $f:…

Probability · Mathematics 2026-05-04 Yuansi Chen

Sums of independent, bounded random variables concentrate around their expectation approximately as well a Gaussian of the same variance. Well known results of this form include the Bernstein, Hoeffding, and Chernoff inequalities and many…

Discrete Mathematics · Computer Science 2017-04-25 Thomas Steinke , Jonathan Ullman

It is well known that some important Markov semi-groups have a "regularization effect" -- as for example the hypercontractivity property of the noise operator on the Boolean hypercube or the Ornstein-Uhlenbeck semi-group on the real line,…

Probability · Mathematics 2023-03-07 Nathael Gozlan , Xue-Mei Li , Mokshay Madiman , Cyril Roberto , Paul-Marie Samson

Motivated by Talagrand's conjecture on regularization properties of the natural semigroup on the Boolean hypercube, and in particular its continuous analogue involving regularization properties of the Ornstein-Uhlenbeck semigroup acting on…

Probability · Mathematics 2020-02-07 Nathael Gozlan , Mokshay Madiman , Cyril Roberto , Paul-Marie Samson

Let $\gamma_{d}$ be the $d$-dimensional standard Gaussian measure and $\{Q_{t}\}_{t\ge 0}$ the Ornstein-Uhlenbeck semigroup acting on $L^{1}(\gamma_{d})$. We show that the hypercontractivity of $\{Q_{t}\}_{t\ge 0}$ is equivalent to the…

Probability · Mathematics 2018-08-21 Yuu Hariya

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…

Probability · Mathematics 2026-04-02 Guillaume Aubrun , Justin Jenkinson , Stanislaw J. Szarek

Let $\Omega\subset \mathbb R^{n+1}$, $n\geq1$, be a bounded open set satisfying the interior corkscrew condition with a uniformly $n$-rectifiable boundary but without any connectivity assumptions. We establish the estimate $$ \Vert…

Analysis of PDEs · Mathematics 2025-06-05 Josep M. Gallegos

The concentration of measure phenomenon in Gauss' space states that every $L$-Lipschitz map $f$ on $\mathbb R^n$ satisfies \[ \gamma_{n} \left(\{ x : | f(x) - M_{f} | \geqslant t \} \right) \leqslant 2 e^{ - \frac{t^2}{ 2L^2} }, \quad t>0,…

Probability · Mathematics 2017-06-30 Petros Valettas

In this short note, we give an easy proof of the following result: for $ n\geq 2, $ $\underset{t\to0}{\lim} \,e^{it\Delta }f\left(x+\gamma(t)\right) = f(x) $ almost everywhere whenever $ \gamma $ is an $ \alpha- $H\"older curve with $…

Classical Analysis and ODEs · Mathematics 2024-03-28 Javier Minguillón

Exponential tail bounds for sums play an important role in statistics, but the example of the $t$-statistic shows that the exponential tail decay may be lost when population parameters need to be estimated from the data. However, it turns…

Statistics Theory · Mathematics 2022-03-22 Guenther Walther

Let $t$ be random and uniformly distributed in the interval $[T,2T]$, and consider the quantity $N(t+1/\log T) - N(t)$, a count of zeros of the Riemann zeta function in a box of height $1/\log T$. Conditioned on the Riemann hypothesis, we…

Number Theory · Mathematics 2017-09-14 Brad Rodgers

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…

Number Theory · Mathematics 2024-03-27 Alexander Dobner

Uniform stability of a learning algorithm is a classical notion of algorithmic stability introduced to derive high-probability bounds on the generalization error (Bousquet and Elisseeff, 2002). Specifically, for a loss function with range…

Machine Learning · Computer Science 2019-03-19 Vitaly Feldman , Jan Vondrak

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

Classical Analysis and ODEs · Mathematics 2017-08-18 Ben Krause , Pavel Zorin-Kranich

We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability distribution $\nu = e^{-f}$ on $\mathbb{R}^n$. We prove a convergence guarantee in Kullback-Leibler (KL) divergence assuming $\nu$ satisfies a log-Sobolev…

Data Structures and Algorithms · Computer Science 2022-03-04 Santosh S. Vempala , Andre Wibisono

We characterize the domain of the realization of the linear parabolic operator Gu := u_t + L(t)u (where, for each real t, L(t) is an Ornstein-Uhlenbeck operator), in L^2 spaces with respect to a suitable measure, that is invariant for the…

Analysis of PDEs · Mathematics 2014-02-26 Matthias Geissert , Alessandra Lunardi

We consider the inverse problem of determining initial data in general Ornstein-Uhlenbeck equations on the Euclidean space from partial measurement localized on the so-called thick sets. Using the logarithmic convexity technique and recent…

Analysis of PDEs · Mathematics 2023-06-13 S. E. Chorfi , L. Maniar

For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…

Functional Analysis · Mathematics 2022-09-14 M. Ashraf Bhat , G. Sankara Raju Kosuru

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont
‹ Prev 1 2 3 10 Next ›