Stein's method, logarithmic Sobolev and transport inequalities
Michel Ledoux, Ivan Nourdin, Giovanni Peccati
Introduction
is the relative entropy of with respect to and
where stands for the Hessian of , whereas and denote the usual Hilbert-Schmidt scalar product and norm, respectively. Note that while Stein kernels appear implicitly in the literature about Stein’s method (see the original monograph [Ste, Lecture VI] of C. Stein, as well as [C2, C3, G-S1, G-S2]…), they gained momentum in recent years, specially in connection with probabilistic approximations involving random variables living on a Gaussian (Wiener) space (see the recent monograph [N-P2] for an overview of this emerging area). The terminology ‘kernel’ with respect to ‘factor’ seems the most appropriate to avoid confusion with related but different existing notions.
becomes relevant as a measure of the proximity of and . This quantity is actually at the root of the Stein method [C-G-S, N-P2]. For example, in dimension one, the classical Stein bound expresses that the total variation distance between a probability measure and the standard Gaussian distribution is bounded from above as
justifying therefore the interest in the Stein discrepancy (see also [C-P-U]). It is actually a main challenge addressed in [N-P-S1] and this work to investigate the multidimensional setting in which inequalities such as (1.2) are no more available.
With the Stein discrepancy , we emphasize here the inequality, for every probability ,
as a new improved form of the logarithmic Sobolev inequality (1.1). In addition, this inequality (1.3) transforms bounds on the Stein discrepancy into entropic bounds, hence allowing for entropic approximations (under finiteness of the Fisher information). Indeed as is classical, the relative entropy is another measure of the proximity between two probabilities and (note that and if and only if ), which is moreover stronger than the total variation distance by the Pinsker-Csizsár-Kullback inequality
The proof of (1.3) is achieved by the classical interpolation scheme along the Ornstein-Uhlenbeck semigroup towards the logarithmic Sobolev inequality, but modified for time away from by a further integration by parts involving the Stein kernel. Indeed, while the exponential decay of the Fisher information classically produces the logarithmic Sobolev inequality (1.1), the argument is supplemented by a different control of by the Stein discrepancy for .
We call the inequality (1.3) HSI, connecting entropy H, Stein discrepancy S and Fisher information I, by analogy with the celebrated Otto-Villani HWI inequality [O-V] relating entropy H, (quadratic) Wasserstein distance W () and Fisher information I. We actually provide in Section 3 a comparison between the HWI and HSI inequalities (suggesting even an HWSI inequality). Moreover, based on the approach developed in [O-V], we prove that
an inequality that improves upon the celebrated Talagrand quadratic transportation cost inequality [T]
(since for every ). We shall refer to (1.4) as the ‘WSH inequality’. Note also that so that, as entropy, the Stein discrepancy is a stronger measurement than the Wasserstein metric .
The new HSI inequality put forward in this work has a number of significant applications to exponential convergence to equilibrium and concentration inequalities. For example, the standard exponential decay of entropy along the flow , (, ), which characterizes the logarithmic Sobolev inequality (1.1) may be strengthened under finiteness of the Stein discrepancy into
for all where according to the growth of as .
As alluded to above, the HSI inequality (1.3) is designed to yield entropic central limit theorems for sequences of probability measures of the form , , such that and
of the relative entropy of the distribution of a vector on with respect to by the Stein discrepancy , where depend on integrability properties of , the carré du champ operators , , and the inverse of the determinant of the matrix . In particular, as providing therefore entropic convergence under the Stein discrepancy. The general results obtained here cover not only normal approximation but also gamma approximation.
The inequality (1.7) thus transfers bounds on the Stein discrepancy to entropic bounds. The issue of controlling the Stein discrepancy itself (in terms of moment conditions for example) is not addressed here, and has been the subject of numerous recent studies around the so-called Nualart-Peccati fourth moment theorem (cf. [N-P2]). This investigation is in particular well adapted to functionals whose coordinates are eigenfunctions of the underlying Markov generator. See [A-C-P, A-M-P, L3] for several results in this direction and [N-P2, Chapters 5-6] for a detailed discussion of estimates on that are available for random vectors living on the Wiener space.
The structure of the paper thus consists of two main parts, the first one devoted to the new HSI and WSH inequalities, the second one to an investigation of entropic bounds via the Stein discrepancy. Section 2 is devoted to the proof and discussions of the HSI inequality in the Gaussian case, with a first sample of illustrations and applications to convergence to equilibrium and measure concentration. In Section 3, we investigate connections between the Stein discrepancy, Wasserstein distances and transportation cost inequalities, in particular the HWI inequality, and establish the WSH inequality. Extensions of the HSI inequality to more general distributions arising as invariant probability measures of second order differential operators are addressed in Section 4. The second part consists of Section 5 which develops a general methodology (in the context of Markov Triples) to reach entropic bounds on densities of families of functionals under conditions which do not necessarily involve the Fisher information.
Logarithmic Sobolev inequality and Stein discrepancy
Observe from (2.1) that, without loss of generality, one may and will assume in the sequel that -a.e., . Also, by choosing , , in (2.1) one sees that, if admits a Stein kernel, then is necessarily centered. Moreover, by selecting , , and since ,
(and in particular has finite second moments).
In dimension , a Stein kernel may not be unique – see [N-P-S2, Appendix A].
It is important to notice that, in dimension , the definition (2.1) of Stein kernel is actually weaker than the one used in [N-P-S1, N-P-S2]. Indeed, in those references a Stein kernel is required to satisfy the stronger ‘vector’ (as opposed to the trace identity (2.1)) relation
Definition (2.1) is directly inspired by the Gaussian integration by parts formula according to which
so that the proximity of with the identity matrix indicates that should be close to . In particular, it should be clear that the notion of Stein kernel in the sense of (2.1) is motivated by normal approximation. Section 4 will introduce analogous definitions adapted to the target measure in the context of the generator approach to Stein’s method. Whenever a Stein kernel exists, we consider to this task the quantity, called Stein discrepancy of with respect to in the introduction,
(Note that may be infinite if one of the ’s is not in .) Whenever , then since is the identity matrix (see e.g. [N-P2, Lemma 4.1.3]). Observe also that if denotes the covariance matrix of , then
where indicates the variance under the probability measure .
2 The Gaussian HSI inequality
The following result emphasizes the Gaussian HSI inequality connecting entropy , Stein discrepancy and Fisher information . In the statement, we use the conventions and for every , and for every .
from which , and therefore , which is in contrast with the assumption . As a consequence, we infer that , from which it follows that .
Let be as above (with non-singular), and let be centered with smooth probability density with respect to . Assume that admits a Stein kernel in the sense of (2.1). Then,
where denotes the unique symmetric non-singular matrix such that .
Corollary 2.3 is easily deduced from Theorem 2.2 and details are left to the reader. The argument simply uses that if is the unique non-singular symmetric matrix such that , then where .
3 Proof of the Gaussian HSI inequality
According to our conventions, if either or is infinite, then (2.6) coincides with the logarithmic Sobolev inequality (1.1). On the other hand, if or equals zero, then , and therefore . It follows that, in order to prove (2.6), we can assume without loss of generality that and are both non-zero and finite.
owing to a standard integration by parts of the Gaussian density.
The generator is a diffusion and satisfies the integration by parts formula
(These expressions should actually be considered for as .) Using instead of in the previous relations and writing , one deduces from the symmetry of that
Recall finally that if , (with and ), the classical de Bruijn’s formula (see e.g. [B-G-L, Proposition 5.2.2]) indicates that
Theorem 2.2 will follow from the next Proposition 2.4. In this proposition, (i) corresponds to the integral version of (2.13) whereas (ii) describes the well-known exponential decay of the Fisher information along the Ornstein-Uhlenbeck semigroup. This decay actually yields the logarithmic Sobolev inequality (1.1), see [B-G-L, Section 5.7]. The new third point (iii) is a reformulation of [N-P-S1, Theorem 2.1] for which we provide a self-contained proof. It describes an alternate bound on the Fisher information along the semigroup in terms of the Stein discrepancy for values of away from . It is the combination of (ii) and (iii) which will produce the HSI inequality. Point will be needed in the forthcoming proof of the WSH inequality (1.4), as well as in the proof of Proposition 3.1 providing a direct bound of the Wasserstein distance by the Stein discrepancy.
Under the above notation and assumptions, denote by a Stein kernel of . For every , recall , and write . Then,
(Exponential decay of Fisher information) For every ,
(Exponential decay of Stein discrepancy) For every ,
In view of the preceding discussion, only the proofs of (iii) and need to be detailed. Throughout the various analytical arguments below, it may be assumed that the density is regular enough, the final conclusions being then reached by approximation arguments as e.g. in [O-V, B-G-L]. Starting with (iii), use (2.12) and the definition (2.1) of to write, for any ,
Now, for all , by (2.8) and (2.9),
which is (2.16). To deduce the estimate (2.17), it suffices to apply (twice) the Cauchy-Schwarz inequality to the right-hand side of (2.16) in such a way that, by integrating out the variable,
by symmetry of , the proof of (2.17) is complete.
By the integral representation of ,
Use now the definition of in the variable and integration by parts in the variable to get that
As a consequence, a Stein kernel for is
By the Cauchy-Schwarz inequality along ,
that is the announced result (iv). Proposition 2.4 is established.
For every , it is easily checked that the mapping appearing in (2.20) admits the probabilistic representation
We are now in a position to prove Theorem 2.2.
Proof of Theorem 2.2. As announced, on the basis of the interpolation (2.14), we apply (2.15) and (2.17) respectively to bound the Fisher information for around and away from . We thus get, for every ,
Optimizing in (set ) concludes the proof. ∎
It is worth mentioning that a slight modification of the proof of (iii) in Proposition 2.4 leads to the improved form of the exponential decay (2.15) of the Fisher information
As for the classical logarithmic Sobolev inequality, the inequality (2.22) may be integrated along de Bruijin’s formula (2.13) towards the better, although less tractable, HSI inequality
(understood in the limit as ), where , and .
Together with the de Bruijn identity (2.13), the classical logarithmic Sobolev inequality (1.1) ensures the exponential decay in of the relative entropy
along the Ornstein-Uhlenbeck semigroup (cf. e.g. [B-G-L, Theorem 5.2.1]). The new HSI produces a reinforcement of this exponential convergence to equilibrium under finiteness of the Stein discrepancy.
Let with Stein discrepancy . For any ,
Together with (2.18) and since r\mapsto r\log\big{(}1+\frac{s}{r}\big{)} is increasing for any fixed , the HSI inequality applied to implies that
Set , , so that by (2.13), . The latter inequality therefore rewrites as
Since for , this inequality may be relaxed into . Setting , , it follows that so that, after integration,
By definition of , this inequality amounts to the conclusion of Corollary 2.7 and the proof is complete. ∎
4 Stein discrepancy and concentration inequalities
Equivalently (up to numerical constants) in terms of moment growth,
Hence is the Stein discrepancy as defined earlier. Recall the operator norm on the matrices.
Before turning to the proof of this result, let us comment on its measure concentration content. One first important aspect is that the constant is dimension free. When , (2.28) exactly fits the Gaussian case (2.27). In general, the moment growth in describes various concentration regimes of (cf. [L2, Section 1.3], [B-L-M, Chapter 14]) according to the growth of the -Stein discrepancy .
In view of the elementary estimate , the conclusion (2.28) immediately yields the moment growth (1.6) emphasized in the introduction
Note that there is already an interest to write this bound for ,
Together with E. Milman’s Lipschitz characterization of Poincaré inequalities for log-concave measures [M], it shows that the Stein discrepancy with respect to the standard Gaussian measure is another control of the spectral properties in this class of measures.
Similar inequalities hold for arbitrary covariances by suitably adapting the Stein kernel as in Corollary 2.3.
By the triangle inequality, the latter is bounded from above by
which produces a first bound of interest. If it is assumed in addition that the covariance matrix of is the identity, we may use classical inequalities for sums of independent centered random vectors (in Euclidean space) to the family , . Hence, by for example Rosenthal’s inequality (see e.g. [B-L-M, M-J-C-F-T]), for ,
for some numerical . Note that the bound is optimal both for and as describing the standard Gaussian concentration (2.27). By Markov’s inequality, optimizing in , one deduces that for some numerical ,
for all where according to the growth of as . For example, if for some (see below for such illustrations), then
(for some possibly different numerical ) for every . By Markov’s inequality in this range of ,
and with , the claims follows with of the order of .
For concreteness, we describe two classes of one-dimensional distributions such that the associated Stein kernel has finite moments of all orders. Denote by a centered real-valued random variable with law and Stein kernel . Recall from (2.2) of Remark 2.1, that if has density with respect to the Lebesgue measure, a version of is given by for inside the support of .
Assume that the support of coincides with an open interval of the type , with . Say then that the law of is a (centered) member of the Pearson family of continuous distributions if the density satisfies the differential equation
for some real numbers . We refer the reader e.g. to [DZ, Sec. 5.1] for an introduction to the Pearson family. It is a well-known fact that there are basically five families of distributions satisfying (2.30): the centered normal distributions, centered gamma and beta distributions, and distributions that are obtained by centering densities of the type or ( being a suitable normalizing constant). According to [Ste, Theorem 1, p. 65], if satisfies
then , (with real constants) if and only if is a member of the Pearson family in the sense that satisfies (2.30) for every with , , , and . It follows that if is centered member of the Pearson family such that (2.31) is satisfied and has finite moments of all orders, so has . This includes the case of Gaussian, gamma and beta distribution for example.
In concrete instances, such as Wiener chaos for example, the latter expression may be easily controled so to yield concentration properties of the underlying distribution of . For example, in the setting of the recent [A-C-P], it may be shown by hypercontractive means that for the Hermite, Laguerre or Jacobi (or mixed ones) chaos structures, for any ,
According to the respective growth in of , concentration properties on may be achieved.
Using that (since is -Lipschitz) and furthermore
it easily follows as in the previous section that for every ,
where and , and
where and . Therefore (2.32) implies that, for every ,
Integrating this differential inequality yields that
where , . It follows that and therefore
Since is bounded above by for some numerical , the announced claim follows. The proof of Theorem 2.8 is therefore complete. ∎
5 On the rate of convergence in the entropic central limit theorem
On the other hand, as in the previous paragraph,
where .
As a consequence therefore of the HSI inequality of Theorem 2.2,
This result has to be compared with the works [A-B-B-N] and [B-J] (cf. [J]) which produce the bound
under the hypothesis that satisfies a Poincaré inequality with constant .
For the classical average , (2.34) yields a rate in the entropic central limit theorem while (2.33) only produces , however at a cheap expense and under potentially different conditions as described in Remark 2.9. For this classical average, the recent works [B-C-G1, B-C-G2] actually provide a complete picture with rate under a fourth-moment condition on based on local central limit theorems and Edgeworth expansions. General sums are studied in [B-C-G3] as a particular case of sums of independent non-identically distributed random variables. Vector-valued random variables may be considered similarly.
Transport distances and Stein discrepancy
We shall subdivide the analysis into two parts. In Section 3.1, we deal with the special case of the quadratic Wasserstein distance , for which we use the definition (2.1) of a Stein kernel. In Section 3.2, we deal with general Wasserstein distances possibly of order , for which it seems necessary to use the stronger definition (2.3) adopted in [N-P-S1, N-P-S2].
Note that (3.2) is actually the central argument in the Otto-Villani theorem [O-V] asserting that a logarithmic Sobolev inequality implies a Talagrand transport inequality. Here, by making use of (3.2) and then (2.17) we get that
The general case is obtained by a simple regularization procedure which is best presented in probabilistic terms. Fix and introduce the auxiliary random variable where and are independent with respective laws and . It is immediately checked that: (a) the distribution of , denoted by , admits a smooth density with respect to (of course, this density coincides with whenever the distribution of admits a density with respect to as in the first part of the proof); (b) a Stein kernel for is given by
(consistent with (2.21)); (c) ; (d) as , converges to in , so that, in particular, . One therefore infers that
The inequality (3.1) may of course be compared to the Talagrand quadratic transportation cost inequality [T, V, B-G-L]
As announced in the introduction, one can actually further refine (3.1) in order to deduce an improvement of (3.3) in the form of a WSH inequality. The refinement relies on the HSI inequality itself.
Proof. For any , recall (in particular, and as ). The HSI inequality (2.6) applied to yields that
Now, by (2.18) and r\mapsto r\log\big{(}1+\frac{s}{r}\big{)} is increasing for any fixed from which it follows that
By exponentiating both sides, this inequality is equivalent to
Combining with (3.2) and recalling (2.13) leads to
The desired conclusion is achieved by integrating between and . The proof of Theorem 3.2 is complete. ∎
Proposition 3.1 and Theorem 3.2 raise a number of observations.
Since for every , the WSH inequality thus represents an improvement upon the Talagrand inequality (3.3). Moreover, as for the HSI inequality, the WSH inequality produces the case of equality in (3.3) since is an equality only at .
The Talagrand inequality may combined with the HSI inequality of Theorem 2.2 to yield the bound
(HWI inequality). As described in the introduction, a fundamental estimate connecting entropy , Wassertein distance and Fisher information is the so-called HWI inequality of Otto and Villani [O-V] stating that, for all with density with respect to ,
(see, e.g. [V, pp. 529-542] or [B-G-L, Section 9.3.1] for a general discussion). Recall that the HWI inequality (3.5) improves upon both the logarithmic Sobolev inequality (1.1) and the Talagrand inequality (3.3). It is natural to look for a more general inequality, involving all four quantities , , and the Stein discrepancy , and improving both the HSI and HWI inequalities. One strategy towards this task would be to follow again the heat flow approach of the proof of Theorem 2.2 and write, for ,
Here, we used (2.15) and (2.17), as well as the known reverse Talagrand inequality along the semigroup given by
(cf. e.g. [B-G-L, p. 446]). Setting , the preceding estimate yields
However, elementary computations show that, unless the rather unnatural inequality is verified, the minimum in the above expression is attained at a point such that either (and in this case one recovers HWI) or (yielding HSI). Hence, at this stage, it seems difficult to outperform both HWI and HSI estimates with a single ‘HWSI’ inequality. In the subsequent point (d), we provide an elementary explicit example in which the HSI estimate perform better than the HWI inequality.
In this item, we thus compare the HWI and HSI inequalities on a specific example in dimension . For every , consider the probability measure with density
where is such that for every , a_{n}=o\big{(}\frac{1}{\log n}\big{)} and . A direct computation easily shows that . Also, since
one may show after simple (but a bit lengthy) computations that
We next examine the Stein discrepancy and Wassertein distance . Since a Stein kernel of is given by
Concerning the Wasserstein distance, from the inequality (3.1), we deduce that . On the other hand, by the Lipschitz characterization of (specializing to the Lipschitz function ), cf. e.g. [V, Remark 6.5]),
Now, the right-hand side of this inequality multiplied by is equal to
which, by dominated convergence, converges to a non-zero limit. As a consequence, there exists such that, for large enough, .
Summarizing the conclusions, the quantity
is bigger than a sequence of the order of , which (by construction) diverges to infinity as . This fact implies that, in this specific case, the bound in the HWI inequality diverges to infinity, whereas . On the other hand, the HSI bound converges to zero, since
2 General Wasserstein distances under a stronger notion of Stein kernel
(where if and if not), possibly infinite if . In particular, .
Let . If has finite moments of order , then (with the same as in (i))
In particular, for we recover (3.1).
Owing to an approximation argument analogous to the one rehearsed at end of the proof of Proposition 3.1, it is sufficient to consider the case where is a smooth density. Write as before and . By virtue of [N-P-S1, Lemma 2.9], under thus the strengthened assumption (2.3), a version of , , is given by
where, as in Remark 2.5, and are independent with respective law and , and . Moreover, one can straightforwardly modify the proof of [O-V, Lemma 2] (cf. also [V, Theorem 24.2(iv)]) in order to obtain the general estimate
yielding (i). On the other hand, if , then
which immediately yields (ii). The proof of Proposition 3.4 is complete. ∎
Specializing (3.6) to the case yields the estimate
which improves previous dimensional bounds obtained by an application of the multidimensional Stein method (cf. the proof of [N-P2, Theorem 6.1.1]). It is important to note that, apart from the results obtained in the present paper, there is no other version of Stein’s method allowing one to deal with Wasserstein distances of order . Observe that coupling results from [C3] (that are based on completely different methods) may be used to deduce analogous estimates in the case when and the Stein kernel is bounded.
HSI inequalities for further distributions
The operator satisfies the chain rule formula and defines a diffusion operator. We assume that is the generator of a symmetric Markov semigroup , where the symmetry is with respect to an invariant probability measure .
A central object of interest in this context is the carré du champ operator defined from the generator by
for all . Note that is bilinear and symmetric and . Moreover, the integration by parts property for with respect to the invariant measure is expressed by the fact that, for functions ,
The structure then defines a Markov Triple in the sense of [B-G-L] to which we refer for the necessary background.
The requested semigroup analysis toward HSI inequalities will actually involve in addition the iterated gradient operators , , defined inductively for via the relations and
In particular and the operators , , are similarly symmetric and bilinear. In what follows, we shall often adopt the shorthand notation instead of . The operator is part of the famous Bakry-Émery criterion for logarithmic Sobolev inequalities [B-E], [B-G-L, Section 5.7]. As a new feature of the analysis here, the iterated gradient will turn essential towards a suitable analogue of (iii) in Proposition 2.4.
Given thus the preceding Markov Triple associated to the second order differential operator of (4.1), let where is a smooth probability density with respect to . As in the Gaussian case, the relative entropy of with respect to is the quantity
Similarly, the Fisher information of (or ) with respect to is defined as
The (integrated) de Bruijn’s identity (cf. Proposition 5.2.2 in [B-G-L]) reads as in (i) of Proposition 2.4,
is a Stein kernel for the probability on with respect to the generator of of (4.1), where is part of the definition of . For the Ornstein-Uhlenbeck operator , the definition corresponds to (2.1). Since , observe that is a Stein kernel for . The main result in this section is an HSI inequality that relates , and the Stein discrepancy of with respect to
that we regard, as in the Gaussian case of Section 2, as a measure of the distance between and (since ). Note that choosing in (4.4), with non-singular, yields the quantity arising in Corollary 2.3. It should also be mentioned that the Stein discrepancy (4.4) is somewhat in contrast with the bounds one customarily obtains when applying Stein’s method (see e.g. [N-P1] for the specific example of the one-dimensional Gamma distribution, or [R] for a general reference), which typically involve quantities of the type . The appearance of the inverse matrices seems to be inextricably connected with the fact that we deal with information-theoretical functionals.
The following general statement collects the necessary assumptions on the iterated gradients , and to achieve the expected HSI inequality by the semigroup interpolation scheme. The next paragraphs will provide illustrations in various concrete instances of interest. In Theorem 4.1 below, (i) amounts to the Bakry-Émery criterion to ensure the logarithmic Sobolev inequality (cf. [B-G-L, Section 5.7]) while condition (ii) linking the and operators will provide (together with (iii)) the suitable semigroup bound for the time control of away from . Recall if and if .
In the preceding context, let where is a smooth density with Stein kernel with respect to . Assume that there exists such that, for any ,
;
(with as in (4.1)).
Note that in the Ornstein-Uhlenbeck example, from which we recover the HSI inequality (2.6), however in a slightly weaker formulation.
It is therefore a classical fact (see e.g. [B-G-L, (5.7.4)]) that (i) ensures the exponential decay of the Fisher information along the semigroup
for every (and then yields a logarithmic Sobolev inequality for .) Now, fix and let . The -calculus as developed in [B-G-L], but at the level of the and operators, yields on (by the very definition of from ),
By (ii), the latter is non-negative so that the map is increasing on , and thus
Together with (iii), it then follows that
We shall apply (4.6) to (with regular enough). First, by symmetry of with respect to ,
where the last step follows from (4.6). Since
Finally, using (4.5) for small and (4.8) for large , one deduces that, for every ,
Now, using that for , a simple (non-optimal) optimization yields the desired conclusion. The proof of Theorem 4.1 is complete. ∎
It should be pointed out that, on the basis of (4.8), transport inequalities as studied in Section 3 may be investigated similarly in the preceding general context, and with similar illustrations as developed below. For example, as an analogue of (3.1),
In order not to expand too much the exposition, we leave the details to the reader.
The next paragraphs present various illustrations of Theorem 4.1.
2 Multivariate gamma distribution
After some easy but cumbersome calculations, it may be checked that, along suitable smooth functions ,
Note that (recall )
Since , it follows at once that . Analogous computations lead to
As a consequence, Theorem 4.1 applies with to yield the following result (the numerical constants there are not sharp). The restrictions , , are probably not optimal. For example, it is not difficult to see from the preceding computations that in the one-dimensional case , it is actually enough to assume that .
3 One-dimensional uniform distribution on [−1,+1]11[-1,+1]
1[-1,+1] In this section, we examine the case of the one-dimensional Jacobi operator of parameters , that is,
whose associated invariant measure is uniform distribution on . The general family of parameters with the beta distributions as invariant measures (cf. [B-G-L, Section 2.7.4]) may be considered similarly, at the expense however of tedious computations, as well as multivariate (product) versions. For simplicity, we only detail this case to better illustrate the conclusion.
Easy calculations lead to, for a smooth function on ,
so that . Also,
Hence, Theorem 4.1 applies with and (note that ) to yield the following conclusion. Again, the numerical constants are not sharp.
Let be uniform probability measure on . Then, for any where is a smooth probability density,
4 Families of log-concave distributions
We consider here a diffusion operator on the line of the type
Assume that there exists such that, uniformly, ,
Then , and for every . Hence, Theorem 4.1 applies with , and .
Recall that in this context, the only condition ensures the logarithmic Sobolev inequality for [B-G-L, Corollary 5.7.2]. It is not difficult to find (simple) examples outside the Gaussian model (corresponding to ) such that conditions (4.9) and (4.10) are fulfilled. For example, if , it is easily seen that these hold for and (for instance). In the Gaussian case, the estimate obtained in this proposition is somewhat worse than the HSI inequality of Theorem 2.2. At the expenses of more involved conditions (4.9) and (4.10), multidimensional versions may be considered similarly.
Entropy bounds on laws of functionals
Referring as before to [B-G-L] for a complete account, we thus deal with a Markov Triple on a probability space , with Markov semigroup with symmetric and invariant probability measure , infinitesimal generator , associated carré du champ operator and underlying algebra of (smooth) functions . Integration by parts expresses that
The second order differential operators of Section 4 provide instances of this general framework. Gaussian and Wiener spaces with associated Ornstein-Uhlenbeck semigroup and generator are a prototypical example for the illustrations. Note in particular that Wiener chaoses as investigated in [N-P-S1] are eigenfunctions of the Ornstein-Uhlenbeck generator. Eigenfunctions of the underlying operator are actually of special interest in the context of the Stein method as illustrated in Section 5.1.
The first statement shows that, whenever the vector is composed of eigenfunctions of , a Stein kernel of with respect to as defined in (2.1) can be expressed in terms of the carré du champ operator .
Let on such that, for every , the random variable is an eigenfunction of , with eigenvalue . Assume moreover that for every . Then, the matrix-valued map defined as
is a Stein kernel for , that is, it satisfies (2.1). (The right-hand side of (5.2) indicates a version of the conditional expectation of with respect to under the probability measure .)
The proof is concluded by taking conditional expectations. ∎
As a consequence, together with (2.5) and Jensen’s inequality,
where denotes the covariance matrix of , providing therefore a tractable way to control the Stein discrepancy in this case. In addition, combining with the HSI inequality of Theorem 2.2 immediately yields the following statement.
Under the assumptions and notation of Proposition 5.1,
In particular, if and , whenever (cf. [N-P2, L3]).
A typical example of a Markov Triple for which the quantity appearing in the above bound can be estimated explicitly corresponds to the case where is a probability space supporting an isonormal Gaussian process over some real separable Hilbert space , and is the generator of the associated Ornstein-Uhlenbeck semigroup. In this case, for smooth functionals and , where stands for the Malliavin derivative operator, and the eigenspaces of are the so-called Wiener chaoses of . For , the eigenvalue of is given by . A detailed discussion about how to bound a quantity such as in the case of random vectors with components inside a Wiener chaos can be found in [N-P2, Chapter 6]. In particular, if and belongs to , then can be controlled by the second and fourth moments of as
In particular, such an estimate provides a proof of the famous ‘fourth moment theorem’ for chaotic random variables, cf. [N-P2, Theorem 5.2.7].
While eigenfunctions appear as functionals of particular interest for the control of the Stein discrepancy itself, the -calculus actually provides a formal description of Stein kernels of a given functional on (in dimension one for simplicity) as the conditional expectation with respect to of (where ). This observation further expands on the preceding example, allowing for a rather general analysis.
2 Bounds on the Fisher information
When dealing with the upper-bound (5.4), the Fisher information of the density of the law of cannot always be explicitly deduced from the data concerning the random vector . The task of this paragraph is therefore to deduce some useful bounds on in terms of and its gradients.
Let be the symmetric matrix with entries , . Applying the latter to , symmetric in , yields
Applied to , by the Cauchy-Schwarz inequality and (4.2),
The consequences of the previous computations are gathered together in the next statement, where we point out a set of sufficient conditions on and its gradients ensuring that the random variable is indeed square-integrable.
Let be a vector of elements of on . Assume that all the , , , , and are in for every . Then, and
The condition on in Proposition 5.5 has some similarity with basic assumptions in Malliavin calculus (cf. [N, N-P2]).
3 Fisher information growth and normal approximation
One evident drawback of Proposition 5.5 of the previous paragraph is that, since the quantity is singular as the determinant of is close to , one is forced to assume that is in all spaces (or at least for some large enough depending on ). This assumption is in general too strong, and very difficult to check in concrete situations. The idea developed in this section (which generalizes the approach initiated in [N-P-S1]) is that, under weaker moment assumptions, while the Fisher information might be infinite, it is nevertheless possible to control the growth as of . Together with the control in terms of the Stein discrepancy for large time achieved in Section 2, one may then reach entropic bounds which can be handled in concrete examples (such as those of random vectors whose components belong to some Wiener chaos).
As before, let be a general vector of centered and square-integrable random variables (in the algebra or some natural extension), with distribution . As a crucial assumption, has a Stein kernel with respect to as defined in (2.1) (see also Proposition 5.1 and Remark (5.4)). Recall the matrix with entries , . Also, in what follows we use the convention that, if is singular, then the matrix must be understood as the transpose of usual adjugate matrix operator of (both quantities being of course equal for non-singular matrices).
Choose in (5.5), so that
Apply now the preceding to , , . Since and
by the Cauchy-Schwarz inequality, assuming for simplicity that ,
On the other hand, using the same semigroup computations as in Section 2,
Collecting the preceding bounds and recalling from (4.7) that
yields that, for and ,
Let be a vector of centered elements of on . Assume that all the , , , , are in for every , and that
for some . Then, (as defined in (5.7)) and
where . In particular, under the assumptions on , as .
First of all, we have that the parameter is finite, since the expressions , and only involve products of , and , .
Now, for every and ,
The choice of yields (5.8) with . Let then , , for (). Then
from which, as a consequence of (5.9), for every ,
To conclude, recall, as in the proof of Theorem 2.2, the decomposition for every ,
and the bound (5.11) in the statement follows by optimizing in (set .) Theorem 5.7 is established. ∎
so that, under the assumptions of Theorem 5.7, one also has that , a conclusion of independent interest.
The quantity of (5.7) involves integrability conditions on and its gradients (they may actually be weakened according to the precise expression of ). On the other hand, of (5.10) is rather concerned with a small ball behavior. For a vector of eigenvectors of the underlying Markov generator , Theorem 5.7 may be combined with (5.3) to fully control the relative entropy in terms of and its gradients as now illustrated in some instances.
We describe, in part following [N-P-S1], how the preceding developments may be applied to concrete examples of interest.
for every , where is an integer related to the degrees of the ’s. Under (5.14), the second hypothesis of Theorem 5.7 clearly holds for any (cf. (5.12)). The latter then applies to basically recover the main conclusion of [N-P-S].
4 Fisher information growth and gamma approximation
This final section develops the analogous investigation towards gamma approximation, for simplicity one-dimensional. Denote by the gamma distribution (on the positive real line) with parameter , invariant measure of the Laguerre operator
for every smooth test function . In particular, . Note that, in this case,
From the study of Gaussian chaoses for example, and as already mentioned earlier, it appears that the latter might not always be the relevant quantity of interest (cf. [N-P1, R]). Indeed, for an eigenfunction with eigenvalue , , the Stein kernel may be identified with the conditional expectation of knowing . Now, for such a functional, moment conditions on may be used to rather control the variance of , and similarly higher moments (cf. [A-C-P, A-M-P, L3]). Of course, by Hölder’s inequality,
for , . Provided it may be ensured that for some , the results here are nevertheless still of interest.
We assume below that so that the estimates (4.6) and (4.8) are verified, with the choice of parameters and (see the comment preceding Proposition 4.3). The proof of the following statement will follow the one developed for Theorem 5.7.
On , let in . Assume that , , and are in for every and that
where . In particular, under the assumptions on , as .
Denoting by the semigroup with infinitesimal generator , we have as in (4.7),
where . Now, for every ,
As a consequence, with the notation introduced in the statement,
Since (Theorem 3.2.4 in [B-G-L]),
On the other hand, the estimate (4.6) yields the bound
Gathering together all the previous estimates, we deduce that, for every and ,
On the basis of this estimate, we then conclude exactly as in the proof of Theorem 5.7. ∎