English
Related papers

Related papers: Modified log-Sobolev inequalities for strongly log…

200 papers

We establish universal modified log-Sobolev inequalities for reversible Markov chains on the boolean lattice $\{0,1\}^n$, under the only assumption that the invariant law $\pi$ satisfies a form of negative dependence known as the stochastic…

Probability · Mathematics 2020-02-28 Jonathan Hermon , Justin Salez

In this work, we develop a comparison procedure for the Modified log-Sobolev Inequality (MLSI) constants of two reversible Markov chains on a finite state space. Efficient comparison of the MLSI Dirichlet forms is a well known obstacle in…

Probability · Mathematics 2022-06-28 Konstantin Tikhomirov , Pierre Youssef

Logarithmic Sobolev inequalities are a powerful way to estimate the rate of convergence of Markov chains and to derive concentration inequalities on distributions. We prove that the log-Sobolev constant of any isotropic logconcave density…

Probability · Mathematics 2017-12-06 Yin Tat Lee , Santosh S. Vempala

We prove that in the context of general Markov semigroups Beckner inequalities with constants separated from zero as $p\to 1^+$ are equivalent to the modified log Sobolev inequality (previously only one implication was known to hold in this…

Probability · Mathematics 2022-02-02 Radosław Adamczak , Bartłomiej Polaczyk , Michał Strzelecki

For reversible Markov chains on finite state spaces, we show that the modified log-Sobolev inequality (MLSI) can be upgraded to a log-Sobolev inequality (LSI) at the surprisingly low cost of degrading the associated constant by $\log…

Probability · Mathematics 2022-12-13 Justin Salez , Konstantin Tikhomirov , Pierre Youssef

A key task in Bayesian statistics is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). However, without any assumptions, sampling (even approximately) can be #P-hard, and few…

Machine Learning · Computer Science 2018-12-03 Rong Ge , Holden Lee , Andrej Risteski

We consider finite-state Markov chains that can be naturally decomposed into smaller ``projection'' and ``restriction'' chains. Possibly this decomposition will be inductive, in that the restriction chains will be smaller copies of the…

Probability · Mathematics 2007-05-23 Mark Jerrum , Jung-Bae Son , Prasad Tetali , Eric Vigoda

We establish a log-Sobolev inequality for the stationary distribution of mean-field Langevin dynamics with a constant that is independent of the number of particles $N$. Our proof proceeds by establishing the existence of a Lipschitz…

Probability · Mathematics 2024-09-17 Sinho Chewi , Atsushi Nitanda , Matthew S. Zhang

The chain rule lies at the heart of the powerful Gamma calculus for Markov diffusions on manifolds, providing remarkable connections between several fundamental notions such as Bakry-\'Emery curvature, entropy decay, and hypercontractivity.…

Probability · Mathematics 2025-03-05 Justin Salez , Pierre Youssef

Classically, the continuous-time Langevin diffusion converges exponentially fast to its stationary distribution $\pi$ under the sole assumption that $\pi$ satisfies a Poincar\'e inequality. Using this fact to provide guarantees for the…

Statistics Theory · Mathematics 2024-07-11 Sinho Chewi , Murat A. Erdogdu , Mufan Bill Li , Ruoqi Shen , Matthew Zhang

We provide a mild sufficient condition for a probability measure on the real line to satisfy a modified log-Sobolev inequality for convex functions, interpolating between the classical log-Sobolev inequality and a Bobkov-Ledoux type…

Probability · Mathematics 2016-08-08 Radosław Adamczak , Michał Strzelecki

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Data Structures and Algorithms · Computer Science 2021-11-08 Nima Anari , Vishesh Jain , Frederic Koehler , Huy Tuan Pham , Thuy-Duong Vuong

We provide a sufficient condition for a measure on the real line to satisfy a modified logarithmic Sobolev inequality, thus extending the criterion of Bobkov and G\"{o}tze. Under mild assumptions the condition is also necessary.…

Probability · Mathematics 2007-05-23 Franck Barthe , Cyril Roberto

Let $\kappa \in \mathbb{N}_+^\ell$ satisfy $\kappa_1 + \dots + \kappa_\ell = n$ and let $\mathcal{U}_\kappa$ denote the "multislice" of all strings $u$ in $[\ell]^n$ having exactly $\kappa_i$ coordinates equal to $i$, for all $i \in…

Probability · Mathematics 2018-09-12 Yuval Filmus , Ryan O'Donnell , Xinyu Wu

We present a general subadditivity inequality for log-Sobolev constants of convolution measures. As a corollary, we show that the log-Sobolev constant is monotone along the sequence of standardized convolutions in the central limit theorem.

Functional Analysis · Mathematics 2025-08-28 Thomas A. Courtade , Edric Wang

We study functional inequalities for Markov chains on discrete spaces with entropic Ricci curvature bounded from below. Our main results are that when curvature is non-negative, but not necessarily positive, the spectral gap, the Cheeger…

Probability · Mathematics 2016-12-05 Matthias Erbar , Max Fathi

We consider a Markov chain on invertible $n\times n$ matrices with entries in $\mathbb{Z}_2$ which moves by picking an ordered pair of distinct rows and add the first one to the other, modulo $2$. We establish a logarithmic Sobolev…

Probability · Mathematics 2025-09-29 Anna Ben-Hamou

We prove logarithmic Sobolev inequality for measures $$ q^n(x^n)=\text{dist}(X^n)=\exp\bigl(-V(x^n)\bigr), \quad x^n\in \Bbb R^n, $$ under the assumptions that: (i) the conditional distributions $$ Q_i(\cdot| x_j, j\neq i)=\text{dist}(X_i|…

Probability · Mathematics 2015-06-23 Katalin Marton

We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials. For a matroid of rank $k$ on a ground set of $n$…

Data Structures and Algorithms · Computer Science 2021-04-13 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant , Thuy Duong Vuong

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…

Probability · Mathematics 2021-04-13 Holger Sambale , Arthur Sinulis
‹ Prev 1 2 3 10 Next ›