Hypocoercivity of Piecewise Deterministic Markov Process-Monte Carlo
Christophe Andrieu, Alain Durmus, Nikolas Nüsken, Julien Roussel
Introduction
which is assumed to be finite. For any , will be referred to as a jump rate and as the refreshment rate.
in which case the velocity is drawn afresh from the marginal invariant distribution, while the position is left unchanged. In this scenario the informal description of the process given above carries on with added to the rate , an additional possible update to the velocity chosen with probability proportional to . Another possible choice is the generator of an Ornstein-Uhlenbeck operator leaving invariant.
In all the paper we assume the following condition to hold for either or , a condition satisfied by the examples covered in this manuscript.
The particular choice and corresponds to the procedure described in as a motivation for the popular hybrid Monte Carlo method. This process is also known as the Linear Boltzman/kinetic equation in the statistical physics literature or randomized Hamiltonian Monte Carlo . In this scenario the process follows the isocontours of for random times distributed according to an inhomogeneous Poisson law of parameter , triggering events where the velocity is sampled afresh from .
The scenario where , and for , where is the canonical basis, corresponds to the Zig-Zag (ZZ) process , where the component of the process follows straight lines in the direction which remains constant between events. In this scenario, the choice of to update the velocity, consists of negating its -th component; see also for related ideas motivated by other applications.
The standard Bouncy Particle Sampler (BPS) of , extended by , correspond to the choice , and .
More elaborate versions of the ZZ and BPS processes, motivated by computational considerations, take advantage of the possibility to decompose the energy as and corresponds to the choice , where in the former the sign flip operation is replaced with a component swap.
It should be clear that one can consider more general deterministic dynamics with , effectively covering the Hamiltonian Bouncy Particle Sampler, suggested in .
We remark that the well-known Langevin algorithm corresponds to , and the situation where is the Ornstein-Uhlenbeck process.
More general bounces involving randomization (see ) can also be considered in our framework, at the cost of additional complexity and reduced tightness of our bounds.
Main results and organization of the paper
there exists such that, for any , ;
Further, 1-(b) also implies the existence of and such that for any ,
1-(b) indeed implies that the quantity considered is bounded from below, the scaling in in front of will appear natural in the sequel. We have opted for this formulation of the assumption required of the potential to favour intuition and link it to the necessary and sufficient condition for geometric convergence of Langevin diffusions, but our quantitative bounds below will be given in terms of the Poincaré constant for simplicity (see [4, Section 4.2] for quantitative estimates of depending on potentially further conditions on ). 1-(a) is realistic in most applications, can be checked in practice and has the advantage of leading to simplified developments. It is possible to replace this assumption with and rephrase our results in terms of any finite upper bound of this quantity (see [22, Sections 2 and 3]). Finally the Poincaré inequality (14) implies by [4, Proposition 4.4.2] that there exists such that
for all , ;
for all there exists such that for all ,
such that for any and , .
Assume that and satisfy the following conditions.
has finite fourth order marginal moment and for
and for any such that
Under the previous assumptions we can prove exponential convergence of the semigroup.
The constants and are given in explicit form in (45) in Theorem 4 (Section 3), in terms of the constant appearing in 1, 2, 4, 5 and 6, where can be taken to be given in (47), , and where
and .
The following details the expected scaling behaviour with of and . The proof can be found in Section 4.3.
Consider the assumptions and notation of Theorem 1. Further suppose that there exists satisfying
which together with and are independent of . Then and there exists , independent of and , such that for large enough,
Thus, if , , and are fixed, we get that is in general at most of order if .
Now further assume that and that the refreshment rate are uniformly bounded in the position , implying . Then by Section 2-(30), there exists such that for sufficiently large
from which we deduce the optimal scaling of the refreshment rate, namely for (which we denote hereafter to alleviate notation). Using the description of RHMC, ZZ and BPS provided in the introduction we deduce the first three lines of Table 1, where is used as a short hand notation for for . The fourth line uses our specialised results of Section 5, showing that the conclusion of Theorem 2 is not optimal for ZZ.
In scaling limits of particular functionals of the ZZ and BPS processes are studied, leading to quantitative estimates of the time required to achieve near independence at equilibrium. More specifically they consider the scenario where the target distribution is a centred normal distribution of covariance matrix and focus on the angular momentum, the negative log-target density and the first coordinate of the process. Our more general results, obtained using a different argument, are in agreement after noticing that considered the scenario and using our earlier remark on the dependence of our estimate of the absolute spectral gap on . In it is shown, again using an approach different from ours, that the RHMC has dimension free convergence rate in a scenario similar to ours.
The paper is organised as follows. In Section 3 we develop our framework for hypocoercivity suited to PDMP-MC processes, based on the ideas of . In addition to providing a rigorous framework we further optimize the constants involved, ultimately leading to Theorem 1. The proofs of Theorem 1 and its corollary are given in Section 4. In Section 5, we specialize our results to the case of the Zig-Zag process for which better estimates are possible, leading to attractive scaling properties with the dimension . Various intermediate technical results have been moved to Appendices where, for completeness, we have also included classical facts from functional analysis.
The DMS framework for hypocoercivity
As stated above our results rely on the ideas proposed by for which a rigorous framework was subsequently given in . We derive here a novel proof, which borrows elements of but leads to a different set of conditions motivated by our application to PDMP-Monte Carlo methods. We further provide explicit and optimized estimates of the constants involved in terms of accessible characteristics of the process. We first present abstract results which form the core of all of our proofs and then establish more specific ones common to all the processes considered in this paper, implying some of the abstract conditions. More specific results relating to the Zig-Zag process are treated in Section 5.
Consider the following additional assumption to 1.
where is defined by (8) and is given in 1.
Appendix B in Appendix B justifies the definition of the operator ,
To establish this result, we make use of classical results on unbounded operators in Hilbert spaces which for completeness, are given in Appendix B.
For any , since , (35) becomes
Therefore, we get for any ,
The main result of can be formulated under the following abstract assumption, which we shall assume to hold from now on, and the proof of our main theorem relies on optimized estimates of the constants involved.
Let be as in 1. Assume further that it satisfies 2 and the following conditions
there exists satisfying for any
there exists satisfying for any
there exists satisfying for any
for any , ;
finally, .
so that is well defined. In addition, if then .
Second, using that by Section 3.1-(b) and (52), we have for any ,
where are defined in (50). Then by Section 3.1, we obtain that for any ,
is the smallest eigenvalue of the symmetric matrix, positive for from Appendix A in Appendix A (as by 3-(b)). Using (49), we get
For notational simplicity we let and note that with the definitions in (45)-(46), for , and , and for the two norms are equivalent and is well defined. This concludes the proof of (a).
From Appendix A and associated notation in Appendix A, has a unique, but intractable, maximum, . However from Appendix A-(b) and Appendix A the unique maximum of , defined by (187), provides us with a tractable proxy such that . In addition, since and for we get
which implies that is well defined (and the two norms equivalent). The last statement follows from Appendix A-(c) in Appendix A.
The following lemma provides us with simple estimates of and defined in Theorem 4.
Let and be as in Theorem 4 and let . Then
for any ,
for any ,
2 DMS for PDMP: generic results
Using that by 2-(b) and that for any and by 3, concludes the proof.
Note that the symmetric parts of for are the same and equal to .
We define the directional derivative operator
where we have used the definition of (8) in the last step.
Establishing 3-(a) (referred to as microscopic coercivity in ) for the processes considered is fairly straightforward in the present framework.
The following lemma establishes equivalence between 3-(b) and the Poincaré inequality 1 , which allows one to refer to the expansive body of literature on the topic and implies dependence on the properties of the potential only.
In addition by [51, Theorem 5.1.9], is a self-adjoint operator. These results and (92) imply that by [16, Theorem 4.3.1].
On the other hand, since by Section 3.2-(a), , we have and
In the scenarios considered here, condition 3-(c) relies on estimates of , and which are obtained by noticing that by definition is solution of the following partial differential equation
In the next section, we show how general, but potentially rough, estimates can be obtained, while in Section 5 we show how tighter bounds can be obtained in specific scenarios where we can take advantage of the structure at hand, in particular when interested in the scaling properties of the algorithm with .
3 Computation of R0R_{0} in the general setting
with given for any by
We only consider the case since the case is obtained by taking .
The proof is completed upon using the Cauchy-Schwarz inequality.
A general, but potentially rough, bound on the right hand side of (108) can be obtained as follows. From the fact that , it holds that
Specific scenarios lead to simplifications of these bounds and the bounds in Lemma 5.1:
from Section D.1 in Section D.1, for radial distributions leading to a simplification of this bound,
further if is the centred normal distribution of covariance , then , leading to further simplifications,
if , and hence , the scenario considered by , then one finds that the bound depends on only.
We proceed as in the proof of Section 3.3. We only consider the case since the case is obtained by taking .
The proof is completed upon using the Cauchy-Schwarz inequality.
(b) Notice that for any ,
Combining this result and Appendix E, we deduce
Combining Appendix B and Appendix C in Appendix C, by definition of in (97) and using 6, we obtain that
Postponed proofs
where we have used that by Appendix C in Appendix C and Section 3.3, with and given in (226) and (233) respectively. The proof of 3-(c) is then completed using Section 3.3-(a) and Section 3.3-(a).
2 Proof of Section 3.1
Using that is nondecreasing on since , we obtain that for any , (64) is satisfied.
Since for any , for is nonincreasing, we deduce from above that for ,
For the second part of the statement, first note that
where for . Using that for any , we deduce that for ,
Further for we have from Theorem 4-(b), leading to
where we have used that for the last inequality. Finally we note that from (64)
where the leftmost inequality follows from the fact that for
3 Proof of Theorem 2
Since and by Theorem 1, from Theorem 4 and Section 3.1, while with
By (27), if are fixed, there exist , independent of , , and such that
where . Combining this bound with (132) concludes the proof. ∎
The Zig-Zag sampler–optimization
In the next two subsections we first consider general velocity distributions and then show how our results can be specialized to the scenario where for and is the uniform distribution on .
Then, Theorem 4 holds with as in (90), and
which is itself implied by for all , since the matrix is symmetric. Note that this is the case when for all , or , for example.
The proof is very similar to that of Theorem 1 and follows from the application of Theorem 4 and the following lemmas whose proofs can be found in Section 5.3.
The proof is then completed by Section 3.3-(a) and Section 3.3-(a). ∎
We discuss in the following the dependence on the dimension of the convergence rate and the constant given by Theorem 4 based on the constant provided by Theorem 17. Similarly to the general case, we need to impose some conditions on and . Here, we assume that does not depend on , which holds in the case where is the uniform distribution on or the -dimensional zero-mean Gaussian distribution with covariance matrix .
Consider now the case where the potential is strongly convex and gradient Lipschitz, i.e. there exist such that for any . Then, since for any and , by assumption, Section 5.1 implies that (136) holds for . In addition, 1 holds with and and by [4, Proposition 5.1.3, Corollary 5.7.2], satisfies (14) with . Then, the convergence rate and the constant in Theorem 4 do not depend on the dimension but only on , , and . In addition, we observe that the larger is, the larger given in (137) is, which in turn make the convergence rate worse since it is of order as by Section 3.1. This result is expected in the Gaussian case for any , since is the diameter of the set of eigenvalues of which is a characterization of the conditioning of the problem.
2 dd-dimensional Radmacher distribution
We now consider the case and is the uniform distribution on which corresponds to the original setting of the Zig-Zag process. This process has been proved to be ergodic even in the absence of refreshment, that is . We note that in this scenario and which leads to simplified expressions for the bounds in Section 5.1 and Section 5.1 upon revisiting their proofs. However this has no qualitative impact. In this section we show that hypocoercivity holds with our techniques for for “most of ” for a particular type of partial refreshment update.
In other words 3-(a) holds if for any , for all , vanishes everywhere, except on . We also note that a similar result holds for the case where , that is 3-(a) holds whenever vanishes everywhere, except on for .
3 Postponed proofs
To bound the sum we note that for by Appendix C-(a), which together with the fact leads to
Then, using that for twice and (176), we deduce
Then combining (164) and (166) completes the proof by Section 3.3-(b). ∎
Since , we obtain
We now bound . First, we apply the triangle inequality and use Appendix C-(a), to deduce that
These identities and the condition (136) imply
From this inequality, (169) and Section 3.3-(b), we deduce
since for , . ∎
Discussion and link to earlier work
An advantage of our approach is that it provides explicit and relatively simple bounds in terms of interpretable quantities which, we show, are informative, and is in contrast with those on minorization and drift conditions in most scenarios. One exception is the study of BPS on the torus carried out in for , using an appropriate coupling argument, which leads to a rate of convergence for the total variation distance with a favourable scaling. Although we have shown that for the Zig-Zag sampler with Rademacher distribution is not required to be bounded away from zero on , the results of hold with . It would be interesting to further investigate whether our results can be specialized to consider the scenario .
Appendix A Optimization and estimates of the rate of convergence α(ϵ)\alpha(\epsilon)
for and .
From (46) we see that requires
where the equality follows from , which completes the proof of (a). The proof of (b) is a simple calculation and is omitted. We now show (c). If we set , it implies that satisfies
and imposes the condition so
Squaring both sides of (189) implies the following sequence of equalities using (182)
where the inequality follows from and . Further
and since , this yields the simplified expression for the two roots
From the conditions on given by (a) and (190), and the fact that , we retain only. The last statement follows from the second statement and the fact that is continuous. ∎
The following lemma establishes in particular that is a global maximum.
for any , (implying concavity),
is maximized at defined by (187) and .
If in addition , .
We differentiate twice, yielding the first order derivative
Now from (182), with with all constants non-negative. Further and and therefore
which implies that for any .
From the concavity we deduce that is a maximum, and the inequality on follows from the fact that this is required for .
Using that for any , , and , we get that
The assumption completes the proof.
First note that for any ,
Then from Appendix A, for any
Now if we use we have by (187) that
Appendix B Some results on closed operators on Hilbert spaces
In this section we gather classical results concerning densely defined closed operators on a Hilbert space to which we repeatedly refer throughout the manuscript.
We start this section with a well-know result regarding the closure of anti-symmetric operators, for which a proof is given for completeness.
Let be a closed and densely defined operator on a Hilbert space of inner product , induced norm and operator norm \left\vvvert\cdot\right\vvvert.
is a bounded operator on which satisfies
Note that under the condition of Appendix B, we get that can be extended to a bounded operator and
(a) and (b) follow from [51, Theorem 5.1.9] and inspection of the proof. We now show (c).
First note that , from which we deduce that it is a self-adjoint and bounded operator by the triangle inequality with norm less or equal than . To prove the tighter upper bound we use [51, Proposition 3.2.27 p. 99] (twice), the identity for any
that is positive and from the first statement.
which implies that . Therefore, the operator is bounded on . The proof then follows by [51, Theorem 5.1.5] which implies that is closable and
A similar result can be obtained by using that is closable only, as a consequence of the following lemma.
This result is a just a consequence of [51, Theorem 5.1.5] which implies that is densely defined, and . ∎
We conclude this section by the following results which can be found in .
Appendix C Elliptic regularity estimates
The proof just follows by integration by parts. ∎
From the definition of , using Appendix B and 1-(a) we conclude that
From this result and (236), it follows that
Rearranging terms and setting completes the proof. The last statement is a direct consequence of the first one using the definition of in (231). ∎
Putting this with Proposition C, this implies the following.
where , , and are defined by (17), (231), (226) and (233) respectively.
Therefore using Appendix C and Appendix C successively, we obtain
Appendix D Supplementary material
We use the polar parametrization of the multivariate normal distribution. Let
. The probability distribution for ensuring uniformity of on the surface of the -sphere has density
and the latter term vanishes when the leftmost term does. We also deduce that
Appendix E Expectation of quadratic forms of the velocity
This section provides expressions for second order moments of quadratic forms of for a large class of distributions for which we could not find adequate references.
whenever .
where denotes the Hadamard product.
Using that is symmetric, and the expectation symbol for expectations with respect to ,
Assume that the potential is defined for any by , for . Then is strongly convex and there exists , dependent on only, such that (15) is satisfied with .
We have for and ,
which with completes the proof.
Assume that the potential is defined for any by with . Then is strongly convex and there exists , dependent on only, such that (15) is satisfied with .
from which we conclude that for any , . It remains to show that (15) holds. First we have for any ,
where we used in the last step which completes the proof, that for any , applying Hölder inequality, since . ∎
Acknowledgments
JR would like to thank Pierre Monmarché for showing him how ZZ and BPS fall under a general framework. CA acknowledges support from EPSRC “Intractable Likelihood: New Challenges from Modern Applications (ILike)” (EP/K014463/1). All the authors acknowledge the support of the Institute for Statistical Science in Bristol. AD acknowledges support from the Chaire BayeScale “P. Laffitte”.