A dimension-free reverse logarithmic Sobolev inequality for low-complexity functions in Gaussian space
Ronen Eldan, Michel Ledoux

TL;DR
This paper introduces a new, dimension-free reverse logarithmic Sobolev inequality for low-complexity functions in Gaussian space, improving upon previous results and providing novel proofs and formulations.
Contribution
It presents a dimension-free version of the reverse logarithmic Sobolev inequality for low-complexity functions, enhancing prior work by Eldan (2018) with new proofs and forms.
Findings
Dimension-free inequality established
Improved bounds for low-complexity functions in Gaussian space
New proofs and formulations provided
Abstract
We discuss new proofs, and new forms, of a reverse logarithmic Sobolev inequality, with respect to the standard Gaussian measure, for low complexity functions, measured in terms of Gaussian-width. In particular, we provide a dimension-free improvement for a related result given in [Eldan '18].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFatigue and fracture mechanics
A dimension-free reverse logarithmic Sobolev inequality for low-complexity functions in Gaussian space
Ronen Eldan
Weizmann Insitute, Israel Incumbent of the Elaine Blond career development chair. Supported by a European Research Commission Starting Grant and by an Israel Science Foundation grant no. 715/16
Michel Ledoux
University of Toulouse, France
Abstract
We discuss new proofs, and new forms, of a reverse logarithmic Sobolev inequality, with respect to the standard Gaussian measure, for low complexity functions, measured in terms of Gaussian-width. In particular, we provide a dimension-free improvement for a related result given in [5].
1 A reverse logarithmic Sobolev inequality
The recent work [5] has put forward a reverse logarithmic Sobolev inequality, with respect to the standard Gaussian measure, for low complexity functions measured in terms of Gaussian-width. To briefly recall this inequality, we take again the notation from [5].
Let denote the standard Gaussian measure on , and let be the probability measure where is twice-differentiable. Let
[TABLE]
be respectively the Kullback-Leibler divergence (relative entropy) and the Fisher information of with respect to , assumed to be finite in the following. In particular has a second moment. The standard logarithmic Sobolev inequality of L. Gross (cf. e.g. [11, 3]) ensures that
[TABLE]
Let
[TABLE]
be the Gaussian-width of the set . The quantity is a measure of the complexity of (rather the gradient-complexity of ). It is assumed there that is integrable with respect to . The following reverse logarithmic Sobolev inequality for measures of low complexity has been established in [5, Theorem 4]. Set , assumed to be finite. Then one has
[TABLE]
where .
Our first theorem gives the following related bound.
Theorem 1**.**
In the preceding notation,**
[TABLE]
As discussed in [5], the inequality is sharp on the extremal functions , , , of the logarithmic Sobolev inequality which have complexity .
To compare between Theorem 1 and the bound (2), observe that the latter trivially holds true in the case that , thus we may generally assume that . Unlike inequality (2), the bound of the theorem has the feature that both sides of the inequality are additive with respect to taking products and in this sense it is dimension-free. In Section 2 below, we give a slightly different form which improves on equation (2) and also essentially improves on Theorem 1.
Such a reverse logarithmic Sobolev inequality is of theoretical interest in the study of approximations of partition functions and of low-complexity Gibbs measures on product spaces (cf. [5, 1]). An analogous definition of low-complexity for Boolean functions was considered in [5], where it is shown that a low-complexity condition implies that the measure can be decomposed as a mixture of approximate product measures.
In fact, it was very recently shown ([7]) that if a measure satisfies a reverse logarithmic Sobolev inequality, then it is close, in transportation distance, to a mixture of translated Gaussian measures. The combination of such a result with Theorem 1 gives a structure theorem for measures of low-complexity, analogous to the one given in [5], but for the Gaussian setting. We formulate this as a corollary.
Recall the quadratic Kantorovich metric between and defined by
[TABLE]
where the infimum is taken over all couplings on with respective marginals and . A combination of Theorem 1 with [7, Theorem 5] gives,
Corollary 2**.**
In the preceding notation, there exists a probability measure such that**
[TABLE]
In particular, the above corollary gives a meaningful result whenever . It is also conjectured that a dimension-free analogue of [7, Theorem 5] should hold true, which, combined with our bound would imply the existence of a probability measure such that
[TABLE]
where is a universal constant.
The proof of (2) strongly relies on a construction coming from stochastic control theory, of an entropy-optimal coupling of the measure to a Brownian motion. We will come back to it in Section 2. In contrast, our proof of Theorem 1 follows a simple and direct approach.
Proof of Theorem 1.
By integration by parts with respect to the Gaussian measure ,
[TABLE]
where is the Ornstein-Uhlenbeck operator. Therefore
[TABLE]
Let be a coupling on with respective marginals and . Then,
[TABLE]
Now, on the one hand,
[TABLE]
On the other hand, by the standard quadratic inequality,
[TABLE]
Taking the infimum over all couplings with respective marginals and , it holds true that
[TABLE]
Therefore, together with (3),
[TABLE]
It remains to recall the quadratic transportation cost inequality by M. Talagrand (cf. [11, 3])
[TABLE]
and the proof is complete. ∎
Together with the logarithmic Sobolev inequality (1) , the step (4) of the preceding proof actually also yields a reverse transportation cost inequality
[TABLE]
Theorem 1 may also be deduced from a classical integrability result for the supremum of a Gaussian process. Given a set such that is integrable with respect to , setting Z=Z(x)=\sup_{t\in K}\big{[}\langle x,t\rangle-\frac{1}{2}|t|^{2}\big{]}, , it holds true that
[TABLE]
This inequality was originally put forward in [10, 12] in the context of concentration properties of suprema of Gaussian processes. Now, the classical entropic inequality (Gibbs variational principle) expresses that
[TABLE]
With , it therefore follows that
[TABLE]
Again, together with (3), this yields the conclusion of the theorem.
At the same time, the integrability inequality (7) may be seen as a consequence of the transportation cost inequality (5) and the Kantorovich duality. The argument actually works for any probability on the Borel sets of satisfying the transportation cost inequality
[TABLE]
for some constant and every ( for ).
Namely, the Kantorovich duality (cf. [11]) expresses that
[TABLE]
where the supremum runs over the set of measurable functions satisfying
[TABLE]
for -almost all and -almost all . Given then a couple of functions satisfying (9), the choice in (8) of where yields that , that is
[TABLE]
For every , and ,
[TABLE]
Therefore, if \varphi(x)=\sup_{t\in K}\big{[}\langle x,t\rangle-\frac{1}{2}|t|^{2}\big{]}, , then is a valid candidate for (9). Hence
[TABLE]
which amounts to (7) when .
2 Stochastic calculus and the Föllmer process
As mentioned above, the proof of (2) developed in [5] uses tools from stochastic control theory, and in particular the so-called Föllmer process [8] to achieve an entropy-optimal coupling of the measure to a Brownian motion. This argument has already been proved useful in the study of various functional inequalities [4, 9, 6].
To summarize a few facts from [9, 5], let be standard Brownian motion in (starting from the origin) adapted to a filtration . Set , , , where
[TABLE]
The Föllmer process solves the stochastic differential equation
[TABLE]
where . Amongst its relevant properties, the random variable has distribution , is a martingale, and
[TABLE]
The arguments developed in [5] thus make use of these properties towards a proof of the inequality (2). Now, actually, a small variation in the same spirit allows for the following inequality.
Theorem 3**.**
In the notation of Section 1, assume that has a finite second moment. Then
[TABLE]
Proof.
Note first that by integration by parts
[TABLE]
so that the inequality of the theorem amounts to
[TABLE]
Recall that . Arguing as for the proof of Theorem 1, for any coupling with respective marginals and ,
[TABLE]
The inequality (10) would then follow if for some coupling ,
[TABLE]
But the point is that the Föllmer process actually produces an exact coupling for this identity to hold. Namely, by the definition and properties of , has law , has law and
[TABLE]
Since is a martingale,
[TABLE]
from which the claim follows since . ∎
For the sake of intuition, let us consider an equivalent form of the bound provided by the theorem. Denote,
[TABLE]
the differential entropy of . It is straightforward to check that the theorem is equivalent to
[TABLE]
Note that, in the special case that has the form \log\frac{d\nu}{dx}=\sup_{t\in K}\big{[}\langle x,t\rangle-\frac{1}{2}|t|^{2}\big{]}+\mathrm{const}, this bound becomes somewhat similar to the bound (7).
It remains to connect Theorem 3, or rather inequality (10), to Theorem 1. By the definition of the Fisher information (cf. (3))
[TABLE]
so that (10) expresses that
[TABLE]
While presented and established with the quantity , the proof of Theorem 1 shows in the same way that
[TABLE]
Hence, if (which is likely), the inequality (11) improves upon (12). On the other hand, it does not seem possible to reach (11) as simply as (12), and in any case, the inequality of Theorem 3, even up to a constant, may not be deduced from Theorem 1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Austin. The structure of low-complexity Gibbs measures on product spaces. ar Xiv:1810.07278 (2018).
- 2[2] T. Austin. Multi-variate correlation and mixtures of product measures. Arxiv:1809.10272 (2018).
- 3[3] D. Bakry, I. Gentil, M. Ledoux. Analysis and geometry of Markov diffusion operators. Grundlehren der mathematischen Wissenschaften 348. Springer (2014).
- 4[4] C. Borell. Isoperimetry, log-concavity, and elasticity of option prices. In New directions in Mathematical Finance, 73–91, Wiley (2002).
- 5[5] R. Eldan. Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations. Geom. Funct. Anal. 28, 1548–1596 (2018).
- 6[6] R. Eldan, J. R. Lee. Regularization under diffusion and anti-concentration of the information content. Duke Math. J. 167, 969–993 (2018).
- 7[7] R. Eldan, J. Lehec, Y. Shenfeld. Stability of the logarithmic Sobolev inequality via the Föllmer Process. Arxiv: 1903.04522 (2019).
- 8[8] H. Föllmer. An entropy approach to the time reversal of diffusion processes. In Stochastic differential systems (Marseille-Luminy, 1984), Lecture Notes in Control and Inform. Sci. 69, 156–163 (1985). Springer.
