Delocalization of bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin


Abstract

Unadjusted samplers such as unadjusted Hamiltonian Monte Carlo and underdamped Langevin are well-known to be biased. Metropolis–Hastings adjustment has been conventionally incorporated into Hamiltonian Monte Carlo to eliminate the bias. However, this adjustment can significantly increase the iteration complexity due to the small step size required for reasonable Metropolis acceptance rates. In this work, we extend the delocalization of bias phenomenon, previously established for the overdamped Langevin algorithm, to these two unadjusted algorithms. We show that to control the \(W_2\) bias of any \(K\)-dimensional marginal of a high-dimensional distribution, \(O(\sqrt{K})\) integration steps suffice up to \(\log d\) terms, assuming either weak or sparse interactions among variables. The discrete-time integrators here introduce technical difficulties beyond those of the overdamped setting, which we address through a broadly applicable matrix-polynomial framework that characterizes their propagators. Our result for the underdamped Langevin algorithm is valid for all large friction parameters, implying that the Leimkuhler-Matthews integrator for the overdamped Langevin dynamics also exhibits delocalization of bias.

1 Introduction↩︎

Hamiltonian (or Hybrid) Monte Carlo (HMC) and underdamped Langevin (UL)1 are widely used to sample from high dimensional probability distributions. For a target distribution \(\pi \propto \exp(-V)\), where \(V: \mathbb{R}^d \to \mathbb{R}\) denotes the potential energy, both sampling dynamics evolve in terms of a position variable \(q\), on which the potential \(V\) is defined, and an auxiliary momentum variable \(p\). HMC relies on the Hamiltonian ordinary differential equation \[\label{eqn-continuous-time-Hamiltonian} \begin{align} &\frac{{\rm d} q_t}{{\rm d}t} = p_t \,,\\ & \frac{{\rm d}p_t}{{\rm d}t} = -\nabla V(q_t)\,. \end{align}\tag{1}\] corresponding to the Hamiltonian \(\mathcal{H}(q,p) = V(q) + |p|_{\ell^2}^2/2\), where \(|\cdot|_{\ell^2}\) is the \(\ell^{2}\) norm of a vector. The closely related continuous-time UL is described by the stochastic differential equation \[\label{eqn-continuous-time-underdamped} \begin{align} &{\rm d} q_t = p_t {\rm d}t\,,\\ &{\rm d} p_t = -\nabla V(q_t) {\rm d}t-\gamma p_t{\rm d}t+\sqrt{2\gamma}{\rm d}B_t\,. \end{align}\tag{2}\] where \(\gamma > 0\) is the friction parameter and \(B_t\) is a standard Brownian motion. Both continuous-time dynamics admit \(\pi \otimes \mathcal{N}(0, I)\) as their invariant measure on phase space \((q,p)\), allowing samplers built upon them to target \(\pi\) via the \(q\)-marginal.

Applying these continuous-time dynamics numerically requires time discretization. For HMC, one must also refresh the momentum regularly to ensure sampling ergodicity. The most commonly used discretization of 1 is the leap-frog scheme (also called velocity Verlet) [1], under which the \((k+1)\)-th step of HMC is

  1. Sample \(p_0 \sim \mathcal{N}(0, I)\) and set \(q_0 = X_k\).

  2. Inner loop (leap-frog integration): for \(j = 0\) to \(m-1\), \[\label{eqn-leap-frog} \begin{align} q_{j+1} &= q_j + h p_j - \frac{h^2}{2}\nabla V(q_j)\,,\\ p_{j+1} &= p_j - \frac{h}{2}\nabla V(q_j) - \frac{h}{2}\nabla V(q_{j+1})\,. \end{align}\tag{3}\] Set \(X_{k+1} = q_m\).

Here, \(h\) is the step size, and we also refer to one HMC iteration as one outer loop. For 2 , a commonly used discretization is the BAOAB scheme [1], which is written as \[\label{eqn-baoab} \begin{align} q_{k+1} &= q_k + \frac{h}{2}(1+\eta)p_k - \frac{h^2}{4}(1+\eta)\nabla V(q_k) + \frac{h}{2}\sqrt{1-\eta^2}\xi_{k}\,,\\ p_{k+1} &= \eta(p_k - \frac{h}{2}\nabla V(q_k)) + \sqrt{1-\eta^2}\xi_{k}-\frac{h}{2}\nabla V(q_{k+1})\,. \end{align}\tag{4}\] The scheme 4 is constructed through an operator splitting. We denote the solution maps for the three components of 2 over a step size \(h\) as follows: \[\label{eqn-def-bao} \begin{align} &{\mathsf{B}_h}(q, p) = (q, p-h\nabla V(q))\,,\\ &{\mathsf{A}_h}(q, p) = (q + hp, p)\,,\\ &{\mathsf{O}_h}(q, p; \xi) = (q, \eta p + \sqrt{1-\eta^2}\xi)\,. \end{align}\tag{5}\] Here, \(\xi \sim \mathcal{N}(0, I)\) is an independent Gaussian vector, and \(\eta = \exp(-\gamma h)\). Splitting methods for underdamped Langevin dynamics are defined with different strings of A, B, and O. By standard convention, operators employed symmetrically in the string are applied with a half step \(h/2\), while those that appear only once are applied with a full step \(h\). Specifically, the BAOAB scheme 4 is derived from the composition \(\mathsf{B}_{h/2} \circ \mathsf{A}_{h/2} \circ \mathsf{O}_h (\cdot;\xi) \circ \mathsf{A}_{h/2} \circ \mathsf{B}_{h/2}\), which we abbreviate as \(\mathsf{B}\mathsf{A}\mathsf{O}\mathsf{A}\mathsf{B}\). We use sans-serif \(\mathsf{A}\), \(\mathsf{B}\), \(\mathsf{O}\) and their compositions for the solution maps, while the same letters in roman type identify the corresponding scheme. For the frictionless case \(\gamma = 0\), we have \(\eta = 1\), so the \(\mathsf{O}_h\) step becomes the identity, and the BAOAB scheme 4 reduces to the leap-frog scheme 3 .

1.1 Motivation↩︎

The unadjusted HMC and UL algorithms are biased. Because of the finite step size \(h\), when the marginal \(\rho_k\) of \(q_k\) converges, its limit \(\pi_h\) differs from the target \(\pi\). Both HMC and UL can be modified with a Metropolis–Hastings (MH) accept/reject step to eliminate bias. In fact, HMC is most frequently applied with MH adjustment [2][4]. However, adjusted HMC and UL are well known to degrade as \(d\) increases and the step size \(h\) must be decreased to maintain a non-zero acceptance probability.

In [5], we have identified a “delocalization of bias” phenomenon for the unadjusted overdamped Langevin algorithm: To control the bias of low-dimensional marginals, a step size scaling with the low dimension suffices, with only a logarithmic dependence on the full dimension \(d\). The analysis in [5] relies on a novel \(W_{2,\ell^\infty}\) metric, which captures the accuracy of low-dimensional marginals. For two probability measures \(\mu\) and \(\nu\) on \(\mathbb{R}^d\), their \(W_{2,\ell^\infty}\) distance is defined as \[W_{2,\ell^{\infty}}(\mu, \nu) = \left( \min_{\gamma \in \Pi(\mu,\nu)} \int |x-y|^2_{\ell^\infty} \gamma({\rm d}x,{\rm d}y)\right)^{1/2}\, ,\] where \(|\cdot|_{\ell^\infty}\) is the \(\ell^{\infty}\) norm of a vector and \(\Pi(\mu,\nu)\) represents the set of measures on the joint space \(\mathbb{R}^d\times\mathbb{R}^d\) that have marginals \(\mu\) and \(\nu\). We note that, for any choice of \(K\) coordinates, the corresponding marginal distributions \(\mu^{(K)}\) and \(\nu^{(K)}\) of \(\mu\) and \(\nu\), satisfy the upper bound \(W_2(\mu^{(K)}, \nu^{(K)}) \leq \sqrt{K} W_{2,\ell^\infty}(\mu, \nu)\), since \(K |x-y|_{\ell^\infty}^2\geq \sum_{t=1}^K|x^{(j_t)} - y^{(j_t)}|^2\) for any \(1\leq j_t \leq d\). In particular, \(W_{2,\ell^\infty}(\mu, \nu)\) upper bounds the distance between any one-dimensional marginals.

Our analysis for unadjusted overdamped Langevin in [5] proceeds via a coupling argument under the \(W_{2,\ell^\infty}\) distance. In this paper, we extend that analysis to unadjusted HMC and UL, which are both much more commonly used for complicated, high-dimensional sampling applications than overdamped Langevin. This extension introduces significant technical challenges, as the dynamics now evolve on the full phase space \((q,p)\) with an auxiliary momentum variable. The coupling framework in [5] requires analyzing the discrete dynamics over multiple steps to bound the accumulation of discretization error. However, the propagator matrices on the \((q,p)\) space exhibit intricate position-momentum coupling, making their multi-step composition difficult to control. To this end, we introduce a novel matrix polynomial representation of the propagators. Such a representation allows for precise characterization of the multi-step dynamics and enables sharp error bounds under the \(\ell^\infty\) norm.

1.2 Literature review↩︎

Hamiltonian and underdamped Langevin dynamics have long been foundational to the simulation of physical systems. HMC was originally introduced in [6] for particle physics, and was later adapted and popularized for modern statistics and machine learning by [2]. Today, it serves as one of the standard samplers in probabilistic programming packages like Stan [3] and PyMC [4]. In the realm of molecular dynamics (MD), unadjusted HMC is closely related to the Andersen thermostat [7]. Similarly, UL is commonly employed as a robust thermostat [1], [8], [9]. The BAOAB splitting scheme was introduced in [10] and variants have since been implemented widely in MD software packages [11][17].

To maintain stability in integration of Hamilton’s ODE 1 or the underdamped Langevin SDE 2 , the step size \(h\) must be chosen smaller than the shortest vibrational period among all processes in the system (e.g.about a femtosecond in MD). For adjusted HMC, by contrast, [18] establishes the scaling \(h \sim d^{-1/4}\) as the requirement for a non-vanishing acceptance probability as \(d \to \infty\), under a product measure with bounded fourth-order derivatives of the potential. The same scaling was later shown for an adjusted UL scheme in [19], and also appears in mixing time guarantees for adjusted HMC under warm starts [20]. Recent work [21] shows that unadjusted HMC generates a warm start in \(O(d^{1/4})\) steps up to logarithmic factors.

Unadjusted algorithms avoid the rejection bottleneck but incur a discretization bias. A rich body of literature has emerged focusing on the non-asymptotic analysis of unadjusted HMC and UL algorithms, establishing bias bounds as the number of iterations goes to infinity. These analyses rely on various distance metrics and target measure assumptions. The most fundamental setting, detailed in Assumption 1, requires the potential to be a \(C^2\) function that is strongly convex with Lipschitz gradient. However, because commonly employed integrators possess weak second-order accuracy [22], [23], fully demonstrating their accuracy often requires bounding the higher-order derivatives of the potential [24]. Under these frameworks, the theoretical guarantees show power laws \(h \sim d^{-c}\) for some order \(c >0\) depending on the specific assumptions. For unadjusted HMC, [25] requires \(h \sim d^{-1/2}\) to bound the Wasserstein distance, while [26] achieves an \(h \sim d^{-1/4}\) scaling for a high-probability bound under a third-order regularity condition. Furthermore, bias bounds arising from convergence guarantees have been derived in total variation distance (\(h \sim d^{-3/4}\)[27], Kullback-Leibler (KL) divergence (\(h \sim d^{-3/4}\)[28], and Rényi divergence (\(h \sim d^{-3/2}\)[28]. For unadjusted UL, [29] establishes the Wasserstein bias for the BAOAB scheme, requiring \(h \sim d^{-1/2}\) under Assumption 1, with improved dimensional dependence achieved under stricter smoothness assumptions. Wasserstein bias for different integrators of UL was studied in [24], [30], [31]. [24] also establishes a total variation bias bound through a Wasserstein-total variation regularization property. Under KL divergence, [32] similarly requires \(h \sim d^{-1/2}\). These analyses have also been generalized to non-convex settings using techniques such as reflection coupling [33][35] and entropic approaches [36], [37].

Recent literature has increasingly unified the theoretical analysis of HMC and UL algorithms. For instance, under the umbrella framework of “generalized HMC” (gHMC), [38] determines the optimal scaling of the friction parameter and the HMC integration time to attain accelerated convergence regarding the condition number for Gaussian targets, while [37] develops KL convergence guarantees for gHMC. Moving beyond traditional fixed-step integrators, [39] introduces the Randomized Midpoint Method (RMM) for UL dynamics. They establish an improved dimension dependence \(h \sim d^{-1/3}\) in the Wasserstein distance. Inspired by this mechanism, [23] achieves the same \(d^{-1/3}\) scaling for unadjusted HMC by employing a stratified Monte Carlo integrator.

Crucially, the aforementioned guarantees quantify the error across all variables of the joint system. In contrast, our work builds upon [5], [40] to focus exclusively on controlling the error of low-dimensional marginals, which is a more practical notion of error in high-dimensional applications where the majority of coordinates act as nuisance variables. We previously introduced the term “delocalization of bias” in [5] to describe the phenomenon where the \(W_2\) bias of low-dimensional marginals remains nearly independent of the full system dimension. Our analysis there focused on the unadjusted (overdamped) Langevin algorithm, employing a coupling framework to establish Wasserstein bias bounds for the marginals. [40] investigates this phenomenon under KL divergence using a hierarchical analysis of marginal relative entropies. In [41], a related question is studied for graphical models, where dimension-independent bounds are established, through Stein’s method, on the marginal error between a target distribution and its localized approximation. Prior to our work in [5], [42] and [43] observed that large step sizes remain viable in high dimensions if the observable of interest has a Lipschitz constant that decays with dimension, thereby canceling out the dimensional scaling of the full system’s Wasserstein bias (e.g., an averaged observable \(f(x) = \frac{1}{d} \sum_{i=1}^d \phi(x^{(i)})\) with an \(\ell^2\)-Lipschitz \(\phi\)). In such regimes, a constant step size is sufficient to achieve a bounded error regardless of dimension. Besides these analysis efforts, there are ample numerical evidence demonstrating the viability of dimension-free step size choices [44], [45].

1.3 Main results↩︎

In [5], we have shown for overdamped Langevin that the delocalization of bias holds for product measures, for Gaussian measures, and for distributions with sparse interactions between variables. We also provided a negative example showing that this effect does not hold universally. In this paper, we establish the delocalization effect for the unadjusted HMC and UL algorithms under analogous assumptions, namely weak or sparse interactions, or Gaussian targets. Our analysis is conducted under the following strongly log-concave and log-smooth assumption.

Assumption 1. Let \(\pi \propto \exp(-V)\) with \(V \in C^2(\mathbb{R}^d)\). Assume \(V\) is \(\alpha\)-strongly convex and \(\beta\)-smooth such that \(\alpha I \preceq \nabla^2 V(x) \preceq \beta I\) for any \(x \in \mathbb{R}^d\), where \(0 < \alpha \leq \beta < \infty\).

Throughout, unadjusted HMC uses the leap-frog integrator 3 and unadjusted UL uses the BAOAB scheme 4 . As a warm-up, we present the delocalization of bias result for Gaussian distributions. Since the BAOAB scheme is unbiased for any Gaussian distribution [22], only unadjusted HMC is discussed in this example. We employ the explicit formula for the biased Gaussian distribution and obtain a \(W_{2,\ell^\infty}\) bias bound directly. The proof appears in Appendix 7.

Example 1 (Gaussian distributions). Consider \(\pi =\mathcal{N}(\mu, \Sigma)\) where \(\mu \in \mathbb{R}^d\) and \(\alpha I\preceq \Sigma^{-1} \preceq \beta I\). Then, for \(h < 1 / \sqrt{\beta}\), unadjusted HMC, when it converges, has the following bias: \[W_{2,\ell^\infty}(\pi_h, \pi) = O(h^2 \sqrt{\beta \log (2d)}) = O(h\sqrt{\log (2d)})\,.\]

As in the case of overdamped Langevin dynamics [5], the proof of Example 1 offers no insight into which target distributions beyond the Gaussian family evince the delocalization of bias effect for unadjusted HMC or UL. Our main results describe two different sets of structural assumptions on \(V\) under which this effect appears. For general distributions satisfying Assumption 1, our first results address the “weak interactions” setting of [40], made precise below.

Assumption 2 (weak interactions). The Hessian \(\nabla^2V\) admits the decomposition \(\nabla^2 V = \nabla^2 V^{(D)}+ \nabla^2 V^{(O)}\) where \(\nabla^2 V^{(D)} = \mathrm{diag}(\nabla^2 V)\) is the diagonal part and \(\nabla^2 V^{(O)}\) is the off-diagonal part. We assume there exists a sufficiently small constant \(C^{(O)} > 0\), independent of \(\alpha\), \(\beta\), \(h\), and \(d\), such that the the off-diagonal part satisfies \[|\nabla^2 V^{(O)}|_{\ell^\infty} \leq C^{(O)} \alpha\] uniformly over \(\mathbb{R}^d\).

Assumption 1 ensures that every diagonal entry satisfies \([\nabla^2 V^{(D)}]_{ii} \geq \alpha\). The interactions defined in Assumption 2 are therefore weak, as the total intensity of interactions between any given variable and all other variables, measured by off-diagonal row sums, is small compared to the independent components on the diagonal.

We now state our main result under weak interactions. The proofs for the two algorithms are given in Appendix 12.

Theorem 1 (weak interactions). Let Assumptions 1 and 2 hold. For either unadjusted HMC with \(mh = 1/\sqrt{20\beta}\) and \(C^{(O)} = 1/50\), or unadjusted UL with \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\) and \(C^{(O)} = 1/20\), the resulting invariant distribution \(\pi_h\) satisfies \[\label{eqn-weak-informal} W_{2,\ell^\infty}(\pi_h, \pi) = O\left(\frac{\beta}{\alpha}h\sqrt{\log(2d)}\right)\,.\tag{6}\]

Essentially, the distribution with weak interactions constitutes a perturbation of the product measure. The delocalization effect holds for product measures, since the dynamics are separable for each variable, leading to a dimension-free bias in each coordinate. This effect persists as long as the interactions between variables are sufficiently weak.

The second setting of interest is the case of “sparse interactions” studied in [5], where each variable interacts directly with only a few others. Because the interactions are local, the influence of one variable spreads only gradually through the interaction structure over multiple steps, keeping the marginal bias small. This interaction structure is described by a graphical model, with each variable a node, as illustrated in Figure 1. Let \(G\) be an undirected graph with \(d\) nodes, labeled by \(1\leq i \leq d\), and write \(i \sim j\) when nodes \(i\) and \(j\) are connected by an edge. The neighborhood \(\mathsf{N}(i)\) is the set of nodes connected to \(i\). Here the neighborhood relationship is symmetric, and without loss of generality, we take \(i \sim i\) for all \(1\leq i \leq d\). We quantify the locality of interactions through a growth condition on the neighborhood sizes. Define recursively \(\mathsf{N}_k(i) = \{1\leq j \leq d: \exists\;l \in \mathsf{N}_{k-1}(i), \text{ such that } j \sim l \}\), for \(k \geq 2\), with \(\mathsf{N}_1(i) := \mathsf{N}(i)\), and write \(s_k \mathrel{\vcenter{:}}= \max_{1 \leq i \leq d} |\mathsf{N}_{2k}(i)|\) for the relevant neighborhood cardinality where \(s_k \geq 1\) by definition. We make the following assumption on the potential.

Assumption 3.

The potential has the form \[\label{eqn-sparse-potential-function} V(x) = \sum_{i=1}^d V_i (\mathcal{X}^i)\,,\tag{7}\] where \(\mathcal{X}^i = \{x^{(j)}: j \in \mathsf{N}(i)\}\) and each \(V_i\) depends only on the variables in \(\mathcal{X}^i\). Moreover, the sparsity parameter \(s_k\) satisfies the polynomial growth bound \(s_k \leq C(k+1)^n\) for constants \(C, n > 0\).

The main result under sparse interactions is as follows. The proofs are given in Appendix 12.

Figure 1: Illustration of a potential V(x) with sparse interactions. Adapted from [5].

Theorem 2 (sparse interactions). Let Assumptions 1 and 3 hold. For either unadjusted HMC with \(mh = 1/\sqrt{20\beta}\), or unadjusted UL with \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\), the resulting invariant distribution \(\pi_h\) satisfies \[\label{eqn-sparse-informal} W_{2,\ell^\infty}(\pi_h, \pi) = h\sqrt{\log(2d)}\left( O\left( \frac{\beta}{\alpha}\log(2d)\right)\right)^{\frac{n}{2} + 1}\,.\tag{8}\]

Compared to our results for the unadjusted Langevin algorithm in [5], we have an improvement from \(\sqrt{h\log(2d)}\) to \(h\sqrt{\log(2d)}\). The new scaling aligns with [29], where the Wasserstein-2 bias of the BAOAB scheme is \(h\sqrt{d}\). It does not show a second order accuracy due to lack of higher order regularity conditions on \(V\) [23], [24]. We also note that the step-size conditions for both methods align with existing results. For HMC, the chosen length of the integration time scales with \(1/\sqrt{\beta}\) for both the continuous and discrete dynamics [42], [46], while we choose the specific constant to optimize the contraction rate in our analysis. For UL, we allow for the same step-size condition as in [29]. Specifically, the condition indicates that \(h \leq \frac{1}{2\sqrt{\beta}}\). Besides, the relation \(\eta = \exp(-\gamma h)\) implies the condition \(\gamma > 2\sqrt\beta\). In comparison, [47] establishes that \(\gamma > \sqrt{\beta}-\sqrt{\alpha}\) is the sharp condition to guarantee Wasserstein contraction for general distributions, whereas for Gaussian targets, contraction holds for any \(\gamma\). Therefore, in the highly ill-conditioned regime (\(\alpha \ll \beta\)), our friction requirement matches the scaling of this tight condition up to a factor of \(2\). This scaling also aligns with continuous-time dynamics, where the optimal Wasserstein-2 convergence rate of \(O(\alpha/\gamma)\) is attained at \(\gamma =\sqrt{\beta+\alpha}\), a value that is asymptotically equivalent to \(\sqrt{\beta}\) when \(\alpha \ll \beta\). Notably, the step-size condition accommodates the entire high friction regime, and ensures that the bias bounds remain valid in the overdamped limit \(\gamma \to \infty\), where the BAOAB scheme reduces to the Leimkuhler-Matthews (LM) integrator, a method for the overdamped dynamics that achieves weak second-order accuracy [10]. Our results thus also imply the delocalization of bias effect for the LM scheme.

The key technical challenge of extending our analysis in [5] is that the propagator matrices of HMC and UL are more involved. The coupling argument, a common device for obtaining Wasserstein bounds, relies on the propagator of the dynamics to induce contraction and to control the accumulation of discretization error. The lack of one-step contraction in the \(W_{2,\ell^\infty}\) metric necessitated the use of a multi-step coupling argument in [5], where the sparsity of the potential was leveraged to control the accumulated errors over these steps. In this paper, we employ a novel matrix polynomial framework that applies to both HMC and UL, to characterize the multi-step propagator matrices on the joint \((q,p)\) space. The framework takes a global-in-time view, giving the full multi-step propagator at once as a polynomial of the Hessians along the trajectory, with coefficients we can characterize and bound. On the joint \((q,p)\) space, position and momentum differences mix as the trajectory evolves, so the position-difference propagator is not a simple product of one-step maps but a structured polynomial pairing the two. The matrix-polynomial framework makes this structure explicit. The polynomial’s coefficients control both the contraction and the error accumulation in the \(\ell^\infty\) norm. Under sparse interactions, in particular, the \(\ell^\infty\) norm of the multi-step propagator is magnified over its \(\ell^2\) norm by only a factor governed by the potential’s sparsity. In the easier weak interaction regime, the propagators are nearly diagonal, so contraction follows from a more elementary, near-single-step argument. For HMC this contraction is still read off from the multi-step polynomial, since one outer loop comprises several integration steps, whereas for UL it follows directly from the splitting structure of the scheme without invoking the polynomial.

1.4 Organization of this paper↩︎

In Section 2, we present our analysis framework based on the coupling argument and introduce the notation for the dynamics. Section 3 introduces a matrix polynomial framework to characterize the propagator matrices, and Section 4 establishes bounds for these propagators. Discretization error estimates are provided in Section 5. We conclude the paper in Section 6. All proofs are deferred to the appendices.

1.5 Notation↩︎

For a random vector \(X\), we define \(|X|_{2,\ell^\infty} = (\mathbb{E}[|X|_{\ell^\infty}^2])^{1/2}\). We write \(A = O(B)\) or \(A\lesssim B\) to denote that there exists a constant \(C\) independent of \(\alpha, \beta, h, d\) such that \(A \leq CB\). We use \(|\cdot|_{\ell^\infty}\) and \(|\cdot|_{\ell^2}\) to represent the \(\ell^{\infty}\) and \(\ell^2\) norms for vectors and matrices. When applied to matrices, they stand for the corresponding operator norms. We use \(\preceq\) for the Loewner order such that if \(M\preceq N\) where \(M, N\) are symmetric matrices, then the matrix \(N-M\) is positive semi-definite. We use \(\lfloor x \rfloor\) and \(\lceil x \rceil\) to denote the greatest integer less than or equal to \(x\), and the least integer greater than or equal to \(x\), respectively.

2 Sketch of Techniques↩︎

In this section, we outline our framework of the coupling argument and identify the propagator matrices as the key components for analysis.

2.1 Wasserstein bias↩︎

Our proof utilizes a coupling argument to establish both the Wasserstein convergence rate and the accumulated discretization error across iterations. These results then yield the final Wasserstein bias bounds. The following proposition outlines the Wasserstein convergence for HMC when the potential describes weak interactions.

Proposition 3 (HMC, weak interactions). Suppose Assumptions 1 and 2 hold with \(C^{(O)} = 1/50\). Let \(\rho_k\) be the marginal distribution of \(X_k\), the \(k\)-th step in the HMC chain. For \(mh = 1/\sqrt{20\beta}\), we have \[\label{eqn-sketch-weak-bound-hmc} W_{2,\ell^\infty}(\rho_{k+1}, \pi) \leq \left(1 - \frac{\alpha}{400\beta}\right)W_{2,\ell^\infty}(\rho_k, \pi) + O(h\sqrt{\log(2d)})\,.\qquad{(1)}\]

By taking \(k \to \infty\), the iterative inequality ?? establishes the final bias bound in Theorem 1. The inequality consists of two components. The first characterizes the Wasserstein contraction rate of the HMC chain, while the second bounds the discretization error relative to an ideal HMC process that preserves \(\pi\) exactly. The detailed proof is in Appendix 12. For the case of sparse interactions, we instead rely on a multi-step recursive inequality.

Proposition 4 (HMC, sparse interactions). Suppose Assumptions 1 and 3 hold, and set \(r_i \mathrel{\vcenter{:}}= \lceil ih\sqrt\beta e + \frac{\log\sqrt d}{\log(5/3)}\rceil\), a neighborhood threshold chosen to control the \(\ell^\infty\) norm of the propagators as in Section 4.3. When \(mh = 1/\sqrt{20\beta}\), we have \[\label{eqn-sketch-sparse-bound-hmc} W_{2,\ell^\infty}(\rho_{k+N}, \pi) \leq \left( 1 - \frac{\alpha}{200\beta}\right)^N \sqrt{d}W_{2,\ell^\infty}(\rho_k, \pi) + O\left(\left(\sum_{i=0}^{Nm-1}\sqrt{s_{r_i}}\right)\sqrt{\beta}h^2\sqrt{\log(2d)}\right)\,.\qquad{(2)}\]

See Appendix 12 for the detailed proof. When deriving a bias bound, to preserve contraction in the first term, we take \(N \sim (\beta/\alpha) \log d\), which necessitates a multi-step coupling. The discretization error remains controlled due to the sparsity of the Hessians, which manifests as the \(\sqrt{s_{r_i}}\) terms in the bound. By taking \(k \to \infty\), ?? results in the final bias bound in Theorem 2.

We now lay out the coupling framework underlying Propositions 3 and 4. The framework is common to HMC and UL. Once a contraction is established, over one step or several, the total bias is a sum of single-step discretization errors, each propagated forward under the discrete-time scheme. The object governing this propagation, which is the propagator matrix acting on the difference between two paths, is therefore central to the argument. Working with the discrete-time scheme is itself a deliberate choice, as the existing \(\ell^2\) analyses in continuous time [46], [48] exploit the inner-product structure, but the \(\ell^\infty\) norm is less compatible with continuous-time differentiation. For HMC, the propagator matrices contract in the \(\ell^\infty\) norm in one outer loop under weak interactions, while the \(\ell^\infty\) contraction emerges over multiple outer loops under sparse interactions. Moreover, the same class of matrices controls how the discretization error propagates across inner steps and subsequent outer loops.

The UL analysis follows a similar template, but its iterative inequalities are more involved due to a weighted norm and the absence of momentum refreshment. We therefore present the framework for both algorithms but give the iterative inequalities only for HMC.

2.2 HMC↩︎

We compare two chains driven by the same momentum refreshments \(\xi_k, \ldots, \xi_{k+N-1}\). The exact chain \(Y\) has an inner loop following the continuous Hamiltonian dynamics 1 , while the approximate chain \(X\) has an inner loop running the leap-frog scheme 3 . We assume \(Y_0 \sim \pi\) is at stationarity. For each chain, one outer loop maps the current position to the next by drawing a fresh momentum \(\xi\), integrating the inner dynamics for time \(mh\) (over \(m\) leap-frog steps in the approximate case), and reading off the resulting position. We write \(\mathsf{\Phi}^{mh}_\xi\) for one exact outer loop and \(\mathsf{\Phi}^m_{h,\xi}\) for its leap-frog counterpart, the subscript \(\xi\) recording the Gaussian refreshment used in that loop. After \(N\) outer loops, the approximate position is the \(N\)-fold composition along the shared refreshment sequence, \[\label{eqn-approximate-solution-X} X_{k+N} = \mathsf{\Phi}^m_{h,\xi_{k+N-1}} \mathsf{\Phi}^m_{h,\xi_{k+N-2}} \cdots \mathsf{\Phi}^m_{h,\xi_k}(X_k)\,,\tag{9}\] and the exact position \(Y_{k+N}\) is given analogously by composing the \(\mathsf{\Phi}^{mh}_{\xi}\) maps. We omit the composition symbol \(\circ\) throughout for brevity.

One-step bound. Coupling the two chains over a single outer loop, we have \[\label{eqn-sketch-one-step} \begin{align} &|X_{k+1}-Y_{k+1}|_{2,\ell^\infty}=|\mathsf{\Phi}^m_{h,\xi_k}(X_k) - \mathsf{\Phi}^{mh}_{\xi_k}(Y_k)|_{2,\ell^\infty} \\ \leq &\underbrace{|\mathsf{\Phi}^m_{h,\xi_k}(X_k) - \mathsf{\Phi}_{h, \xi_k}^{m}(Y_k)|_{2,\ell^\infty}}_{(a)} + \underbrace{|\mathsf{\Phi}_{h, \xi_k}^{m}(Y_k) - \mathsf{\Phi}_{\xi_k}^{mh}(Y_k)|_{2,\ell^\infty}}_{(b)}\, , \end{align}\tag{10}\] where \((a)\) measures how the leap-frog loop changes the distance between two paths and \((b)\) is the discretization error in one outer loop. If \(\mathsf{\Phi}^m_{h,\xi}\) is a contraction in the \(\ell^\infty\) norm, then it suffices to bound the part (b). Weakly interacting potentials guarantee this contraction.

Multi-step bound. In general, \(\mathsf{\Phi}^m_{h,\xi}\) contracts in the \(\ell^2\) norm but not in the \(\ell^\infty\) norm. However, an \(\ell^\infty\) contraction can be induced by the \(\ell^2\) contraction through coupling over multiple steps, which motivated the multi-step coupling argument for the sparse interactions in [5]. The challenge persists here, where the sparsity of the potential controls the multi-step error accumulation. Iterating over \(N\) outer loops yields the same split into a contraction term \((a)\) and a discretization term \((b)\), \[\label{eqn-sketch-multi-step} \begin{align} &|X_{k+N} - Y_{k+N}|_{2,\ell^\infty} = |\mathsf{\Phi}^m_{h,\xi_{k+N-1}}\cdots \mathsf{\Phi}_{h,\xi_k}^m(X_k) - \mathsf{\Phi}^{mh}_{\xi_{k+N-1}}\cdots \mathsf{\Phi}^{mh}_{\xi_k}(Y_k)|_{2,\ell^\infty}\\ \leq &\underbrace{|\mathsf{\Phi}^m_{h,\xi_{k+N-1}}\cdots \mathsf{\Phi}_{h,\xi_k}^m(X_k) - \mathsf{\Phi}^m_{h,\xi_{k+N-1}}\cdots \mathsf{\Phi}_{h,\xi_k}^m(Y_k)|_{2,\ell^\infty}}_{(a)} \\ & \quad + \underbrace{|\mathsf{\Phi}^m_{h,\xi_{k+N-1}}\cdots \mathsf{\Phi}_{h,\xi_k}^m(Y_k)- \mathsf{\Phi}^{mh}_{\xi_{k+N-1}}\cdots \mathsf{\Phi}^{mh}_{\xi_k}(Y_k)|_{2,\ell^\infty}}_{(b)}\,, \end{align}\tag{11}\] where now the map in \((a)\) becomes an \(\ell^\infty\) contraction once \(N \sim (\beta/\alpha) \log d\).

Discretization error. It remains to quantify the discretization term \((b)\), for both a single outer loop and for \(N\) of them. We begin with \((b)\) of 10 . To expose its structure we need the finer building blocks of an outer loop. Let \(\mathsf{U}^{mh}_{\mathrm{\small hmc}}\) and \(\mathsf{U}^m_{\mathrm{\small hmc},h}\) denote the exact and leap-frog solution maps on the full phase space \(\mathbb{R}^{2d}\) for time \(mh\), and \(\mathsf{\Pi}_1\) the projection onto position, so that \(\mathsf{\Phi}^{mh}_\xi(q) = \mathsf{\Pi}_1\mathsf{U}^{mh}_{\mathrm{\small hmc}}(q,\xi)\) and \(\mathsf{\Phi}^m_{h,\xi}(q) = \mathsf{\Pi}_1\mathsf{U}^m_{\mathrm{\small hmc},h}(q,\xi)\). Telescoping the difference \(\mathsf{\Pi}_1\mathsf{U}^{m}_{\mathrm{\small hmc},h} - \mathsf{\Pi}_1\mathsf{U}^{mh}_{\mathrm{\small hmc}}\) over the \(m\) integration steps and using that \(\mathsf{U}^{ih}_{\mathrm{\small hmc}}(Y_k,\xi_k) \sim \pi \otimes \mathcal{N}(0,I)\) is at stationarity (since \(Y_0 \sim \pi\) and the inner loop is exact), term \((b)\) of 10 is bounded by \[\label{eqn-one-step-hmc-discretization-error-decomposition-propagation} (b) \leq \sum_{i=0}^{m-1}\big|\,\mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{m-i-1}(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{1} - \mathsf{U}_{\text{\normalfont\scshape hmc}}^h)(q^*, p^*)\,\big|_{2, \ell^\infty}\,, \qquad (q^*, p^*)\sim \pi \otimes \mathcal{N}(0,I)\,.\tag{12}\]

Each term represents the error incurred in a single integration step, propagated over the subsequent \(m-i-1\) leap-frog steps.

The discretization error over \(N\) outer loops, term \((b)\) of 11 , telescopes in the same way at the level of outer loops. It is a sum over loops \(l = 0, \ldots, N-1\), of the one-loop error incurred at loop \(l\), propagated through the remaining \(N-l-1\) outer loops. Combined with a single-loop decomposition similar to 12 , the total error is a sum of single integration-step errors, each propagated forward through the remaining leap-frog steps within its own loop and through all subsequent outer loops. Term \((b)\) in 11 can be therefore bounded as \[\label{eqn-multi-step-hmc-discretization-error-decomposition-propagation} (b) \leq \sum_{l=0}^{N-1}\sum_{i=0}^{m-1}|\mathsf{\Phi}_{h,\xi_{k+N-1}}^m \cdots \mathsf{\Phi}_{h,\xi_{k+l+1}}^m\mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{m-i-1}(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{1} - \mathsf{U}_{\text{\normalfont\scshape hmc}}^h)(q^*, p^*)|_{2,\ell^\infty}\,,\tag{13}\] where \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0,I)\). Here \(i\) indexes the inner integration steps and \(l\) the outer loops. Characterizing the propagator matrices that govern how a local error evolves into the position coordinate is therefore the core of the discretization-error analysis.

2.3 UL↩︎

The framework for UL follows that for HMC, with two modifications. First, the dynamics evolve without momentum refreshment, so we do not project onto the position between steps. Second, since contraction in the \(\ell^2\) norm requires a weighted metric [24], [29], we adopt a weighted \(\ell^\infty\) norm throughout.

2.3.1 Notation and weighted norm↩︎

We use solution-map notation analogous to HMC. The one-step BAOAB map with step size \(h\) and O-step noise \(\xi\) is \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^\xi\), and we write \(\mathsf{U}_{\text{\normalfont\scshape abao},h}^\xi\), \(\mathsf{U}_{\text{\normalfont\scshape bao},h}^\xi\), and \(\mathsf{U}_{\text{\normalfont\scshape ab},h}\) for the ABAO, BAO, and AB sub-schemes, defined by the operator compositions \[\label{eqn-def-baoab-aba-bao-ab} \begin{align} &\mathsf{U}_{\text{\normalfont\scshape baoab},h}^\xi \mathrel{\vcenter{:}}= \mathsf{B}_{h/2} \mathsf{A}_{h/2} \mathsf{O}_{h}(\cdot; \xi) \mathsf{A}_{h/2}\mathsf{B}_{h/2}\,, \quad \mathsf{U}_{\text{\normalfont\scshape abao},h}^\xi\mathrel{\vcenter{:}}= \mathsf{O}_h(\cdot;\xi)\mathsf{A}_{h/2}\mathsf{B}_{h}\mathsf{A}_{h/2}\,,\\ & \mathsf{U}_{\text{\normalfont\scshape bao},h}^\xi \mathrel{\vcenter{:}}= \mathsf{O}_{h}(\cdot;\xi)\mathsf{A}_{h/2}\mathsf{B}_{h/2}\,, \quad \mathsf{U}_{\text{\normalfont\scshape ab},h} \mathrel{\vcenter{:}}= \mathsf{B}_{h/2}\mathsf{A}_{h/2}\,. \end{align}\tag{14}\] We use half steps for each \(\mathsf{A}\) and \(\mathsf{B}\) in BAO and AB rather than the conventional full steps, since we invoke them as the components \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^\xi = \mathsf{U}_{\text{\normalfont\scshape ab},h} \circ \mathsf{U}_{\text{\normalfont\scshape bao},h}^\xi\) of the BAOAB scheme. In place of the continuous-time UL dynamics 2 , we measure the discretization error against the HOH splitting \(\mathsf{U}_{\text{\normalfont\scshape hoh},h}^\xi \mathrel{\vcenter{:}}= \mathsf{H}_{h/2}\, \mathsf{O}(\cdot;\xi)\, \mathsf{H}_{h/2}\), where \(\mathsf{H}_h \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape hmc},h}\) is the Hamiltonian solution map. Following [29], this keeps the error estimate accurate in the high-friction regime, and HOH preserves the target \(\pi \otimes \mathcal{N}(0,I)\).

We consider the weighted \(\ell^\infty\) norm \[\label{eqn-def-weighted-linf-norm} |(q,p)|_{\ell^\infty_w} \mathrel{\vcenter{:}}= \left|W\begin{bmatrix} q\\ p \end{bmatrix}\right|_{\ell^\infty}\,, \qquad W = \begin{bmatrix} I & bI\\ 0 & \sqrt{a-b^2}\,I \end{bmatrix}\,,\tag{15}\] where \(a = \tfrac{1}{\beta}\) and \(b = \tfrac{h}{1-\eta}\). The weight matrix \(W\) is taken from [29], where the same weight makes BAOAB contract in \(\ell^2\). Equivalence with the Euclidean norm requires \(b^2 \le a/4\) [24], [29], under which \[\label{eqn-l2-norm-equivalence} \tfrac12\big(|q|_{\ell^2}^2 + a |p|_{\ell^2}^2\big) \leq |(q,p)|_{\ell^2_w}^2 \leq \tfrac32\big(|q|_{\ell^2}^2 + a |p|_{\ell^2}^2\big)\,.\tag{16}\] This condition is met under the step-size requirement \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\) for UL. For probabilistic bounds we use the expected norms \(|(q,p)|_{2,\ell^\infty_w} \mathrel{\vcenter{:}}= \sqrt{\mathbb{E}[\,|(q,p)|_{\ell^\infty_w}^2\,]}\) and its unweighted counterpart \(|\cdot|_{2,\ell^\infty}\).

Starting from \((X_k, P_k)\), the BAOAB chain evolves over \(N\) steps to \[\label{eqn-ul-chains} (X_{k+N}, P_{k+N}) = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k+N-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_k}(X_k, P_k)\,,\tag{17}\] and the HOH chain evolves analogously from \((Y_k, P'_k)\) by composing the \(\mathsf{U}_{\text{\normalfont\scshape hoh},h}^\xi\) maps, where \(\xi_k, \ldots, \xi_{k+N-1}\) are the O-step Gaussian noises, shared by both chains to match the coupling below.

2.3.2 Analysis framework via coupling↩︎

Given a fixed \(k\), we couple the two chains and initialize \((Y_0, P'_0)\) from the HOH stationary distribution \(\pi\otimes\mathcal{N}(0,I)\).

Multi-step bound. As in HMC, the position gap splits into a contraction term \((a)\) and a discretization term \((b)\), \[\label{eqn-sketch-underdamped} \begin{align} &|X_k - Y_k|_{2,\ell^\infty}\\ \leq & \underbrace{\left|\mathsf{\Pi}_1\left(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0} (X_0, P_0) -\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0} (Y_0, P'_0)\right)\right|_{2,\ell^\infty}}_{(a)}\\ & + \underbrace{\left|\mathsf{\Pi}_1\left(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0} (Y_0, P'_0) -\mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\xi_0} (Y_0, P'_0)\right)\right|_{2,\ell^\infty}}_{(b)}\,. \end{align}\tag{18}\] In both the weak and sparse interaction cases, the contraction is established over multiple steps, though for different reasons. For weak interactions, we exploit the one-step weighted contraction of the \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) operator, writing \((\mathsf{B}\mathsf{A}\mathsf{O}\mathsf{A}\mathsf{B})^k = \mathsf{B}\mathsf{A}\mathsf{O}\,(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O})^{k-1}\,\mathsf{A}\mathsf{B}\), so that the contraction of the inner \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) operators drives the bound while \(\mathsf{B}\mathsf{A}\mathsf{O}\) and \(\mathsf{A}\mathsf{B}\) contribute only constant prefactors. These prefactors are what preclude a strict one-step bound and require accumulating contraction over several steps. This decomposition follows the \(\ell^2\) argument for the BAOAB scheme in [29]. For sparse interactions, \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) is no longer a weighted-\(\ell^\infty\) contraction, so we instead analyze the full \(\mathsf{B}\mathsf{A}\mathsf{O}\mathsf{A}\mathsf{B}\) map and upgrade the \(\ell^2\) contraction of [29] to an \(\ell^\infty\) contraction over multiple steps. Since we only need the asymptotic bias in the position variable, one option there is to track the propagator matrices governing error propagation into the position coordinates, whose marginal is non-Markovian across intermediate steps. In both cases, we establish the multi-step contraction from the initial state through to the final step \(k\) rather than step by step.

In both regimes, 18 is taken in the unweighted \(\ell^\infty\) norm of the position coordinate to match the Wasserstein bias structure. The weighted contraction enters by inserting \(W\) and \(W^{-1}\) at the intermediate steps and invoking the equivalence in 16 . In Section 2.1, we omit an explicit iterative Wasserstein bias inequality for UL analogous to Propositions 3 and 4, because the insertion of the weight matrices and the end-to-end bias bound complicate the statement.

Discretization error. The discretization term \((b)\) is handled through the same propagator-matrix mechanism as HMC, following the asymptotic-bias analysis of BAOAB in [29] with the weighted \(\ell^2\) norm replaced by the \(\ell^\infty\) norm. To bound the error accurately across regimes of \(\gamma\), [29] analyzes the process over blocks of \(\tilde{l} = \lceil \frac{1}{2\sqrt\beta h} \rceil\) steps. Organizing \((b)\) in 18 block by block gives \[\label{eqn-multi-step-baoab-discretization-error-decomposition-propagation} \begin{align} (b) & \leq \sum_{i=0}^{\lfloor k/\tilde{l}\rfloor - 1} \left|\mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k-(i+1)\tilde{l}}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}}) (q^*, p^*)\right|_{2,\ell^\infty} \\ & \quad + \left|\mathsf{\Pi}_1\left(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k-\lfloor k/\tilde{l} \rfloor \tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{k - \lfloor k/\tilde{l} \rfloor \tilde{l}}\right)(q^*, p^*)\right|_{2,\ell^\infty}\,, \end{align}\tag{19}\] where \((q^*, p^*)\sim \pi \otimes \mathcal{N}(0,I)\), and \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^l\), \(\mathsf{U}_{\text{\normalfont\scshape hoh},h}^l\) denote the \(l\)-fold compositions of the BAOAB and HOH solution maps, with the coupled Gaussian noises from 18 omitted for brevity. Each term is the error over at most \(\tilde{l}\) steps, propagated through the subsequent BAOAB steps. Characterizing these propagator matrices for the evolution of the difference between two paths is therefore central to the accumulated discretization-error analysis.

3 A Matrix Polynomial Framework for Propagator Analysis↩︎

As shown in the previous section, the propagator matrices are fundamental to characterizing both the contraction rates and the discretization error under the \(\ell^\infty\) norm. In the absence of continuous-time differentiation, we track the evolution of path differences by introducing a framework that expresses these propagators as matrix polynomials. The underlying polynomial coefficients then facilitate the derivation of the required \(\ell^\infty\) bounds. We illustrate this structure with a Gaussian distribution.

3.1 Propagators: Gaussian examples↩︎

The propagators of the leap-frog scheme are closely related to Chebyshev polynomials, as illustrated by the following proposition.

Proposition 5. For \(\pi = \mathcal{N}(0, \Sigma)\), after \(k\) leap-frog steps, the difference between the position components \(x_k = \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^k(x_0, p_0)\) and \(y_k = \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc}, h}^k(y_0, p'_0)\) satisfies \[\label{eqn-hmc-Gaussian-propagators} x_k - y_k = T_k(I - \frac{h^2}{2}\Sigma^{-1}) (x_0 - y_0) + hU_{k-1}(I - \frac{h^2}{2}\Sigma^{-1})(p_0 - p'_0)\,,\qquad{(3)}\] where \(T_k\) is the \(k\)-th Chebyshev polynomial of the first kind, and \(U_k\) is the \(k\)-th Chebyshev polynomial of the second kind. We adopt the convention \(U_{-1} = 0\), which is consistent with the standard three-term recurrence relation \(U_{k+1}(x) = 2xU_k(x) - U_{k-1}(x)\) for \(k\geq 0\) when initializing the sequence at \(U_0(x) = 1\).

Proof sketch. Writing down the iteration 3 in two consecutive steps and eliminating the momentum difference yields, for \(\Delta q_k \mathrel{\vcenter{:}}= x_k - y_k\), the three-term recurrence \[\label{eqn-three-term-recurr-in-x-gaussian} \Delta q_{k+1} = (2I-h^2 \Sigma^{-1})\Delta q_k - \Delta q_{k-1}\,,\quad k \geq 1.\tag{20}\] Deriving the corresponding recurrence for the propagator matrices reveals the Chebyshev polynomials. ◻

This is a special case of Proposition 8 for which we provide the complete proof. It is natural for \(\Delta q_k\) to satisfy a three-term recurrence, as the leap-frog scheme is a discretization of a second-order ordinary differential equation in the position variable. In fact, the position-only iteration 20 is the Störmer form of the leap-frog scheme [1]. The relation to the Chebyshev polynomials is also well-motivated. For instance, in a one-dimensional system with the quadratic potential \(V(q) = \frac{1}{2} q^2\), the exact solution is \(q(t) = q(0)\cos(t) + p(0)\sin(t)\). The Chebyshev polynomials provide the discrete analogue to these trigonometric solutions via the identities \(T_k(\cos\theta) = \cos(k\theta)\) and \(U_{k-1}(\cos\theta) = \sin(k\theta)/\sin\theta\).

With momentum refreshment between outer loops, multiplying their matrix polynomials gives the following HMC propagator across multiple loops.

Proposition 6. For \(\pi = \mathcal{N}(0, \Sigma)\), let \(x_{Nm+k}\) and \(y_{Nm+k}\) denote the position components after initial \(k\) leap-frog steps, followed by \(N\) full HMC outer loops (each consisting of \(m\) steps). Specifically, let \(x_{Nm+k} \mathrel{\vcenter{:}}= \mathsf{\Phi}_{h,\xi_{N-1}}^m \cdots \mathsf{\Phi}_{h,\xi_{0}}^m\mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{k}(x_0, p_0)\) and \(y_{Nm+k} \mathrel{\vcenter{:}}= \mathsf{\Phi}_{h,\xi_{N-1}}^m \cdots \mathsf{\Phi}_{h,\xi_{0}}^m\mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{k}(y_0, p'_0)\). The difference \(\Delta q_{Nm+k} \mathrel{\vcenter{:}}= x_{Nm+k} - y_{Nm+k}\) satisfies \[\label{eqn-hmc-Gaussian-outer-propagators} \begin{align} \Delta q_{Nm+k} &= \left( T_m(I - \frac{h^2}{2}\Sigma^{-1}) \right)^N\\ & \qquad \cdot \left(T_k(I - \frac{h^2}{2}\Sigma^{-1}) (x_0 - y_0) + hU_{k-1}(I - \frac{h^2}{2}\Sigma^{-1})(p_0 - p'_0)\right)\,. \end{align}\qquad{(4)}\] Here, \(x_{Nm+k}\) and \(y_{Nm+k}\) are coupled by utilizing identical momentum refreshments \(\xi_0, \ldots, \xi_{N-1}\) at each outer loop.

The UL dynamics are closely related to the Hamiltonian dynamics but crucially involve a friction term. The friction induces a modification to the polynomial structure. Specifically, the resulting three-term recurrence for the BAOAB scheme incorporates damped coefficients, which recovers the leap-frog coefficients by taking \(\gamma =0\).

Proposition 7. For \(\pi = \mathcal{N}(0, \Sigma)\), let \(x_{k}\) and \(y_{k}\) denote the position components after \(k\) BAOAB steps. Specifically, let \(x_{k} \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0}(x_0, p_0)\) and \(y_{k} \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0} (y_0, p'_0)\). The difference \(\Delta q_k \mathrel{\vcenter{:}}= x_k - y_k\) then satisfies \[\label{eqn-underdamped-Gaussian-propagators} \Delta q_{k+1} = (1+\eta)(I -\frac{h^2}{2}\Sigma^{-1})\Delta q_k - \eta \Delta q_{k-1}\,, \quad k \geq 1.\qquad{(5)}\]

3.2 Propagators: general cases↩︎

Inspired by the Gaussian case, we establish that the propagator matrices can be represented as matrix polynomials, whose coefficients can be accurately characterized. However, the Hessian varies along the trajectory, and the resulting matrices do not commute. The polynomial must therefore be generalized to one in several ordered, non-commuting arguments, each monomial being a product taken in a fixed order. We view the general propagator as a “path-dependent” polynomial, where the recurrence remains identical to the Gaussian case but the arguments are updated in order at each step. We now define these polynomials.

Definition 1 (Multivariate Damped Chebyshev Polynomials). For a sequence of matrices \(M_i \in \mathbb{R}^{d\times d}\), we define the multivariate damped Chebyshev polynomial of the first kind, \(\tilde{T}_k^\eta(M_1,\dots, M_k)\), via the three-term recurrence \[\label{eqn-scalar-multivar-damped-chebyshev-first-kind} \tilde{T}_{k+1}^\eta(M_1,\dots, M_{k+1}) = (1+\eta)\,M_{k+1}\tilde{T}_k^\eta(M_1,\dots, M_k) - \eta\, \tilde{T}_{k-1}^\eta(M_1,\dots, M_{k-1})\tag{21}\] for \(k\geq 1\), with the initial conditions \(\tilde{T}_0^\eta \equiv I\) and \(\tilde{T}_1^\eta(M_1) = \tfrac{1+\eta}{2} M_1 + \tfrac{1-\eta}{2}I\). Note that the new argument \(M_{k+1}\) enters on the left. The multivariate damped Chebyshev polynomial of the second kind, \(\tilde{U}_k^\eta(M_1,\dots,M_k)\), is defined by the same recurrence \[\label{eqn-scalar-multivar-damped-chebyshev-second-kind} \tilde{U}_{k+1}^\eta(M_1,\dots, M_{k+1}) = (1+\eta)M_{k+1}\tilde{U}_k^\eta(M_1,\dots, M_k) - \eta \tilde{U}_{k-1}^\eta(M_1,\dots, M_{k-1})\tag{22}\] for \(k\geq 0\), with different initial conditions \(\tilde{U}_{-1}^\eta \equiv 0\), \(\tilde{U}_{0}^\eta \equiv \tfrac{1+\eta}{2}I\). For notation brevity, we also adopt the sequence notation \(\tilde{T}_{k}^\eta(\{M_i\}_{i=1}^{k})\) and \(\tilde{U}_{k}^\eta(\{M_i\}_{i=1}^{k})\).

We note that when \(\eta =1\), which corresponds to the frictionless Hamiltonian regime \(\gamma = 0\), setting all \(M_i \mathrel{\vcenter{:}}= xI\) with a scalar \(x\) gives \(\tilde{T}_k^\eta(xI,\dots,xI) = T_k(x)I\) and \(\tilde{U}_k^\eta(xI,\dots,xI) = U_k(x)I\), recovering the classical Chebyshev polynomials \(T_k\) and \(U_k\). We also note that, even for scalar arguments, our polynomials differ from the conventional multivariate Chebyshev polynomials on \(\mathbb{R}^d\), which are built from tensor products of one-dimensional polynomials rather than a recurrence in ordered arguments. In the following proposition, we show that the multivariate damped Chebyshev polynomials govern the general propagator matrices in the leap-frog and BAOAB schemes. In particular, it includes the Gaussian propositions stated above. We present its proof in Appendix 8.

Proposition 8. The propagators of the leap-frog and BAOAB schemes are characterized by the multivariate damped Chebyshev polynomials \(\tilde{T}_k^\eta\) and \(\tilde{U}_{k-1}^\eta\). Throughout, let \((x_0, p_0)\) and \((y_0, p'_0)\) be two initial states evolved under synchronous coupling, sharing the same momentum refreshments in HMC and the same O-step Gaussian noise in BAOAB, and let \(x_i, y_i\) denote the resulting coupled positions after \(i\) steps along the trajectory specified in each item below. We set \[\label{eqn-prop-matrix-polynomial-Mi} M_i \mathrel{\vcenter{:}}= I - \tfrac{h^2}{2} H_i\,, \qquad H_i = \int_0^1 \nabla^2 V\big(\tau x_i + (1-\tau) y_i\big)\,{\rm d}\tau\,.\qquad{(6)}\]

  1. **(One scheme, \(k\) steps.)* For the leap-frog iterations in HMC (\(\eta = 1\)) and the BAOAB iterations in UL (\(\eta = e^{-\gamma h}\)), write \(\mathsf{U}^i\) for \(i\) steps of the scheme, namely the leap-frog map \(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^i\) for HMC and the BAOAB composition \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{i-1}}\cdots\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0}\) for UL, so that \(x_i = \mathsf{\Pi}_1\mathsf{U}^i(x_0,p_0)\) and \(y_i = \mathsf{\Pi}_1\mathsf{U}^i(y_0,p'_0)\). The position difference after \(k\) steps satisfies \[\label{eqn-prop-matrix-polynomial-single-scheme} x_k - y_k = \tilde{T}_k^\eta(M_0, \dots, M_{k-1})(x_0 - y_0) + h\, \tilde{U}_{k-1}^\eta(M_1, \dots, M_{k-1})(p_0 - p'_0)\,.\tag{23}\] *

  2. **(HMC, initial leap-frog run plus \(N\) outer loops.)* After \(k\) leap-frog steps followed by \(N\) outer loops of \(m\) leap-frog steps each, the position difference between \(x_{Nm+k} \mathrel{\vcenter{:}}= \mathsf{\Phi}_{h,\xi_{N-1}}^m \cdots \mathsf{\Phi}_{h,\xi_0}^m\, \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{k}(x_0, p_0)\) and \(y_{Nm+k} \mathrel{\vcenter{:}}= \mathsf{\Phi}_{h,\xi_{N-1}}^m \cdots \mathsf{\Phi}_{h,\xi_0}^m\, \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^{k}(y_0, p'_0)\) satisfies \[\label{eqn-propagator-multiple-outer-loop} \begin{align} x_{Nm+k} - y_{Nm+k} &= \left[\prod_{j \in\{k + im\}_{i=0}^{N-1}}^{\longleftarrow} \tilde{T}_m^1(M_j, M_{j+1}, \dots, M_{j+m-1})\right] \\ & \cdot \Big[\tilde{T}_k^1(M_0, \dots, M_{k-1})(x_0 - y_0) + h\, \tilde{U}_{k-1}^1(M_1, \dots, M_{k-1})(p_0 - p'_0)\Big]\,, \end{align}\tag{24}\] where \(x_j, y_j\) are the coupled positions after \(j\) total steps (the first \(k\) within the initial leap-frog run, the remainder within subsequent outer loops), and \(\prod^{\longleftarrow}\) orders the factors so that those with smaller index \(j\) stand to the right.*

4 Bounds for Propagators↩︎

In this section, we present \(\ell^2\) and \(\ell^\infty\) bounds for propagators, instantiating the technical framework sketched in Section 2. While the \(\ell^2\) bounds are obtained by adapting existing techniques to our setting, the \(\ell^\infty\) bounds represent our primary analytical contribution. These estimates hinge on the structural properties of the multivariate damped Chebyshev polynomials, which allow us to bridge from \(\ell^2\) stability to \(\ell^\infty\) guarantees under the assumption of weak or sparse interactions.

4.1 \(\ell^2\) bounds↩︎

The relevant \(\ell^2\) bounds for HMC are as follows.

Proposition 9 (\(\ell^2\) bounds for HMC propagators). Suppose Assumption 1 hold. If \(H_i = \int \nabla^2 V {\rm d} \nu_i\) for a probability measure \(\nu_i\) on \(\mathbb{R}^d\), we have the following \(\ell^2\) bounds for the leap-frog propagators \(\tilde{T}_k\) and \(\tilde{U}_{k-1}\) provided \(kh \leq 1/\sqrt{20\beta}\): \[\label{eqn-l2bounds-hmc-Tk} |\tilde{T}_k^1(\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1})|_{\ell^2} \leq 1 - \frac{\alpha}{10}(kh)^2\,,\quad |h\tilde{U}_{k-1}^1(\{I - \frac{h^2}{2}H_i\}_{i=1}^{k-1})|_{\ell^2} \leq \sqrt{\frac{2}{5\beta}}\,.\qquad{(7)}\]

The proof is provided in Appendix 9. Combined with Proposition 8, Proposition 9 states that the leap-frog scheme induces a contraction in the position components, provided the trajectories are initialized with identical momentum and the total integration time remains within a specific threshold scaled as \(1/\sqrt{\beta}\). The momentum difference may expand, though this growth remains well-controlled by a magnitude scaled as \(1/\sqrt{\beta}\). These scalings are consistent with the Gaussian setting under the continuous-time dynamics within the time range. We adapt the proof of an existing discrete-time contraction result [42] to obtain the bound for \(\tilde{T}_k^1\). Applying a similar framework for the momentum components, we establish the \(\tilde{U}_k^1\) bound.

For UL, contraction is induced in the weighted norms of Section 2, so we build the weight matrix \(W\) into the propagator representation. For two coupled trajectories with initial states \(z_0 = (x_0,p_0)\) and \(z'_0 = (y_0, p'_0)\), viewed as column vectors in \(\mathbb{R}^{2d}\), a one-step update \(\mathsf{U}\) (any of BAOAB, ABAO, BAO, AB) gives \(z_1 = \mathsf{U}(z_0)\) and \(z'_1 = \mathsf{U}(z'_0)\). The resulting state difference is \(z_1 - z'_1 = M(H_0)(z_0 - z'_0)\), where \(M(H_0)\) is the one-step propagator of the unweighted difference, parametrized by an integrated Hessian \(H_0\). Inserting \(I = W^{-1}W\) gives \[\label{eqn-weighted-propagators-primitive} W(z_1 - z'_1) = \big(W M(H_0) W^{-1}\big)\, W(z_0 - z'_0)\,.\tag{25}\] The weighted propagator \(M^w(H_0) \mathrel{\vcenter{:}}= WM(H_0)W^{-1}\) acts on the weighted difference \(W(z_0 - z'_0)\), so a weighted \(\ell^2\) contraction follows from bounding \(|M^w(H_0)|_{\ell^2}\), and discretization errors are measured in the weighted norm \(|z_0 - z_0'|_{\ell^2_w} = |W(z_0-z_0')|_{\ell^2}\). Over \(k\) steps the propagator is the composition \(M_k \mathrel{\vcenter{:}}= M(H_{k-1})\cdots M(H_0)\), with weighted counterpart \(M^w_k \mathrel{\vcenter{:}}= W M_k W^{-1}\), and a \(k\)-step weighted contraction follows from bounding the full-space operator norm \(|M^w_k|_{\ell^2}\).

Our goal, however, is the bias of the unweighted position marginal, recovered by the projection \(\mathsf{\Pi}_1 = \begin{bmatrix} I & 0 \end{bmatrix} \in \mathbb{R}^{d\times 2d}\). After one step, we have \[\label{eqn-weighted-position-propagators} \mathsf{\Pi}_1(z_1 - z'_1) = \begin{bmatrix} I & 0 \end{bmatrix} W^{-1} M^w(H_0)\, W(z_0 - z'_0)\,.\tag{26}\] The factor \(\begin{bmatrix} I & 0 \end{bmatrix} M(H_0)\) captures the dependence of \(x_1 - y_1\) on the initial position and momentum differences. The same structure holds over \(k\) steps, with \(\tilde{T}_k^\eta\) and \(h\tilde{U}_{k-1}^\eta\) as the position-row blocks of \(M_k\). We bound both the full-space propagator and these weighted blocks for the BAOAB scheme as follows.

Proposition 10 (\(\ell^2\) bounds for UL propagators). Suppose \(H_i\) satisfies the same assumptions as in Proposition 9. For a step size \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\), and letting \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\), the full-space weighted BAOAB propagator satisfies \[\label{eqn-prop-l2bounds-baoab-full-space-weighted} |M_{\text{\normalfont\scshape baoab},k}^w|_{\ell^2} \leq 7(1-c(h))^{\frac{k-1}{2}}\,,\qquad{(8)}\]

and its weighted position-row blocks satisfy \[\label{eqn-prop-l2bounds-baoab-11block} |\tilde{T}_k^\eta(\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1})|_{\ell^2} \leq 7 \sqrt{2} \left(1 - c(h)\right)^{\frac{k-1}{2}}\,,\qquad{(9)}\] \[\label{eqn-prop-l2bounds-baoab-12block} \begin{align} &\frac{1}{\sqrt{a-b^2}}\left|-b \tilde{T}_k^\eta(\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1}) + h \tilde{U}_{k-1}^\eta(\{I - \frac{h^2}{2}H_i\}_{i=1}^{k-1})\right|_{\ell^2} \leq 7\sqrt{2}\left( 1 - c(h)\right)^{\frac{k-1}{2}}\,, \end{align}\qquad{(10)}\]

The proof is detailed in Appendix 10. Proposition 10 is an adaptation of the existing contraction result [29]. The specific combinations of matrices are of interest because we have \[\label{eqn-weight-matrix-polynomial-baoab} \begin{bmatrix} \tilde{T}_k^\eta & h \tilde{U}_{k-1}^\eta \end{bmatrix} W^{-1} = \begin{bmatrix} \tilde{T}_k^\eta & - \frac{b}{\sqrt{a-b^2}} \tilde{T}_k^\eta + \frac{1}{\sqrt{a-b^2}}h\tilde{U}_{k-1}^\eta \end{bmatrix}\,.\tag{27}\]

4.2 \(\ell^\infty\) bounds under weak interactions↩︎

The weak interactions defined in Assumption 2 indicate that \(\nabla^2 V\) is a small perturbation of a diagonal matrix. The resulting propagators therefore have \(\ell^\infty\) norms close to their \(\ell^2\) norms, since the two norms coincide for a diagonal matrix, and a contraction is preserved in \(\ell^\infty\) whenever the interactions are weak. For HMC, since one outer loop is \(m\) leap-frog steps, the relevant object is the multi-step propagator \(\tilde{T}_k^1\).

Proposition 11 (\(\ell^\infty\) bounds under weak interactions, HMC). Suppose Assumptions 1 and 2 hold with the weak interaction parameter \(C^{(O)} = 1/50\). Let the integrated Hessians \(H_i\) be defined as in Proposition 9. For \(kh \leq 1/\sqrt{20\beta}\), we have \[|\tilde{T}_k^1 (\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1})|_{\ell^\infty} \leq 1 - \frac{\alpha}{10}(kh)^2 + \frac{kh\alpha}{100\sqrt{\beta}}\,,\quad |h\tilde{U}_{k-1}^1(\{I - \frac{h^2}{2}H_i\}_{i=1}^{k-1})|_{\ell^\infty} \leq \frac{3}{2\sqrt\beta}\,.\] In particular, for \(kh = \frac{1}{\sqrt{20\beta}}\), we have the contraction \(|\tilde{T}_k^1 (\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1})|_{\ell^\infty} \leq 1 - \frac{\alpha}{400\beta}\).

The proof can be found in Appendix 9.

For UL, by contrast, the contraction is obtained at the level of a single step rather than through a multi-step polynomial. We decompose the full \(\mathsf{B}\mathsf{A}\mathsf{O}\mathsf{A}\mathsf{B}\) operator into \(\mathsf{B}\mathsf{A}\mathsf{O}\), \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\), and \(\mathsf{A}\mathsf{B}\), and establish a one-step contraction for the \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) operator. As in the general construction 25 , \(M_{\text{\normalfont\scshape abao}}^w(H_0)\) is the weighted one-step propagator of the \(\mathsf{U}_{\text{\normalfont\scshape abao},h}^\xi\) map, satisfying \(W(\mathsf{U}_{\text{\normalfont\scshape abao},h}^\xi(z_0) - \mathsf{U}_{\text{\normalfont\scshape abao},h}^\xi(z'_0)) = M_{\text{\normalfont\scshape abao}}^w(H_0)\, W(z_0 - z'_0)\) for states \(z_0 = (x_0,p_0)\), \(z'_0 = (y_0,p'_0)\) coupled through the same O-step noise. Here \(H_0 = \int_0^1 \nabla^2 V\big(\tau(x_0+\tfrac{h}{2}p_0)+(1-\tau)(y_0 + \tfrac{h}{2}p'_0)\big)\,{\rm d}\tau\), and \[\label{eqn-def-abao-weighted-matrix} M_{\text{\normalfont\scshape abao}}^w(H_0)= \begin{bmatrix} I - \frac{h^2}{2} H_0 - \frac{\eta}{1-\eta}h^2 H_0 & h^3\frac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{1/\beta-h^2/(1-\eta)^2}}H_0\\[4pt] - \eta h \sqrt{\frac{1}{\beta}-\frac{h^2}{(1-\eta)^2}}H_0 & \eta\big(I + (-\frac{1}{2} + \frac{1}{1-\eta})h^2H_0\big) \end{bmatrix}\,.\tag{28}\] We work with this full phase-space propagator rather than its position projection because the \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) operator drives contraction in the joint space over several iterations before the position marginal is extracted. The maps \(M_{\text{\normalfont\scshape bao}}^w\) and \(M_{\text{\normalfont\scshape ab}}^w\) are defined analogously by their one-step propagation of the weighted state differences, though the state combination over which \(H_0\) integrates may differ between schemes.

Proposition 12 (\(\ell^\infty\) bounds under weak interactions, UL). Suppose Assumptions 1 and 2 hold with \(C^{(O)} = 1/20\). Let the integrated Hessian \(H_0\) be defined as in Proposition 9. For \(h \leq \frac{1-\eta}{2\sqrt\beta}\) and recalling \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\) from Proposition 10, we have \[|M_{\text{\normalfont\scshape abao}}^w(H_0)|_{\ell^\infty} \leq 1 - \frac{1}{2}c(h)\,, \quad |M_{\text{\normalfont\scshape bao}}^w(H_0)|_{\ell^\infty} \leq 3\,, \quad |M_{\text{\normalfont\scshape ab}}^w(H_0)|_{\ell^\infty} \leq 2\,.\]

These bounds are the \(\ell^\infty\) analogues of the \(\ell^2\) ingredients used to prove BAOAB contraction in [29]. See Appendix 10 for its proof.

4.3 \(\ell^\infty\) bounds under sparse interactions↩︎

We now turn to the propagator bounds under sparse interactions. Recall from Assumption 3 that each term \(V_i\) depends only on the coordinates in the neighborhood \(\mathsf{N}(i)\). A single Hessian \(\nabla^2 V\) therefore has a nonzero \((i,j)\) entry only when some term \(V_l\) involves both \(i\) and \(j\), that is, \(i, j \in \mathsf{N}(l)\), so \(i\) and \(j\) are within two edges in the interaction graph. More generally, Lemma 2 in Appendix 9 shows that a product of \(r\) Hessians, the basic building block of the matrix polynomials, has its \((i,j)\) entry supported on \(j \in \mathsf{N}_{2r}(i)\), with at most \(s_r\) nonzero entries per row.

This locality is what yields the \(\ell^\infty\) bounds. To bound a row of a matrix polynomial, we fix a degree threshold \(r\) and split the entries by neighborhood. For \(j \in \mathsf{N}_{2r}(i)\), there are at most \(s_r\) such indices, and a Cauchy–Schwarz estimate over them bounds their contribution by \(\sqrt{s_r}\) times the \(\ell^2\) norm. For \(j \notin \mathsf{N}_{2r}(i)\), the entry only arises from products of degree above \(r\), which carry high powers of the step size and decay geometrically. Bounding \(s_r\) together with this decay converts the \(\ell^2\) propagator estimates into \(\ell^\infty\) ones and controls error accumulation. The following proposition is proved in Appendix 9.

Proposition 13 (\(\ell^\infty\) bounds under sparse interactions, HMC). Suppose Assumptions 1 and 3 hold. Let the integrated Hessians \(H_i\) be defined as in Proposition 9. Take \(r_i = \lceil ih\sqrt\beta e + \frac{\log\sqrt{d}}{\log(5/3)}\rceil\). For \(mh \leq 1/\sqrt{20\beta}\), integers \(N \geq 0\) and \(k < m\), we have \[\label{eqn-prop-linf-bounds-sparse-hmc-position} \Big|\Big(\prod_{j \in\{k+im\}_{i=0}^{N-1}}^{\longleftarrow}\tilde{T}_m^1(\{I - \frac{h^2}{2}H_{j+l} \}_{l=0}^{m-1})\Big)\tilde{T}_k^1(\{I-\frac{h^2}{2}H_i\}_{i=0}^{k-1})\Big|_{\ell^\infty} \leq 4 \sqrt{s_{r_{Nm+k}}}\,,\qquad{(11)}\] \[\Big|\Big(\prod_{j \in\{k+im\}_{i=0}^{N-1}}^{\longleftarrow}\tilde{T}_m^1(\{I - \frac{h^2}{2}H_{j+l} \}_{l=0}^{m-1})\Big) h\tilde{U}_{k-1}^1(\{I-\frac{h^2}{2}H_i\}_{i=1}^{k-1})\Big|_{\ell^\infty} \leq \frac{4}{\sqrt\beta} \sqrt{s_{r_{Nm+k}}}\,.\]

For the BAOAB scheme, the weighted matrices relevant to the position projection have the following \(\ell^\infty\) bounds. The proof is provided in Appendix 10.

Proposition 14 (\(\ell^\infty\) bounds under sparse interactions, UL). Suppose Assumptions 1 and 3 hold. Let the integrated Hessians \(H_i\) be defined as in Proposition 9, and let \(r_i = \lceil \frac{ie^2\beta}{1-\eta}h^2+\log(\sqrt{d}) \rceil\). Recall that \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\). For \(h \leq \frac{1-\eta}{2 \sqrt{\beta}}\), we have \[|\tilde{T}_k^\eta(\{I-\frac{h^2}{2}H_i\}_{i=0}^{k-1})|_{\ell^\infty} \leq (7\sqrt{2}+1)\sqrt{s_{r_k}}\exp(-\frac{k-1}{2}c(h))\,,\] \[\begin{align} &\frac{1}{\sqrt{a-b^2}}\left|-b \tilde{T}_k^\eta(\{I - \frac{h^2}{2}H_i\}_{i=0}^{k-1}) + h \tilde{U}_{k-1}^\eta(\{I - \frac{h^2}{2}H_i\}_{i=1}^{k-1})\right|_{\ell^\infty} \\ \leq & (7\sqrt{2}+ \frac{2}{\sqrt{3}})\sqrt{s_{r_k}}\exp(-\frac{k-1}{2}c(h))\,. \end{align}\]

A contraction factor decaying exponentially in \(N\) could also be included in ?? of Proposition 13, as in Proposition 14. We omit it, as our analysis does not require it.

5 Discretization Error and Sampling Bias↩︎

Besides the propagator bounds of Section 4, the other critical component of the coupling framework in Section 2 is the discretization error. In this section we bound it for HMC and UL, then combine it with the propagator bounds to obtain the sampling bias.

5.1 Discretization error in HMC↩︎

To analyze the position and momentum errors separately, we split each solution map into its position and momentum components, writing \(\mathsf{U}_{\text{\normalfont\scshape hmc}}^t = (\mathsf{Q}^t, \mathsf{P}^t)\) for the continuous Hamiltonian dynamics 1 , and \(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^m = (\mathsf{Q}_h^m, \mathsf{P}_h^m)\) for \(m\) leap-frog steps 3 . The single-step discretization error then splits as \[\label{eqn-fine-discretization-error-hmc-decomp} (\mathsf{U}_{\text{\normalfont\scshape hmc},h}^1 - \mathsf{U}_{\text{\normalfont\scshape hmc}}^h)(q^*, p^*) = \big((\mathsf{Q}_h^1-\mathsf{Q}^h)(q^*, p^*),\;(\mathsf{P}_h^1-\mathsf{P}^h)(q^*, p^*)\big)\,,\tag{29}\] which is the common building block of 12 and 13 . The following proposition bounds each component. We provide the proof to a generalized version in Appendix 11.

Proposition 15. Suppose for any probability measures \(\nu_1, \nu_2\) on \(\mathbb{R}^d\), it holds that \(| \int \nabla^2 V {\rm d} \nu_1|_{\ell^\infty} < C_3\) and \(|(\int \nabla^2 V {\rm d} \nu_1)(\int \nabla^2 V {\rm d} \nu_2)|_{\ell^\infty} < C_4\) for constants \(C_3, C_4 > 0\) that may depend on \(\beta\). Then for \(h \leq 1/\sqrt{20\beta}\) and \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0, I)\), we have \[\label{eqn-one-step-position-err-main-text} |\mathsf{Q}_h^1(q^*,p^*)-\mathsf{Q}^h(q^*,p^*)|_{2,\ell^\infty} \leq \frac{1}{\sqrt{2}}h^3C_3\sqrt{\log(2d)}\,,\qquad{(12)}\] \[\label{eqn-one-step-momentum-err-main-text} |\mathsf{P}_h^1(q^*,p^*)-\mathsf{P}^h(q^*,p^*)|_{2,\ell^\infty}\leq 2 h^2C_3 \sqrt{\log(2d)} + \frac{1}{2\sqrt{5}}h^4 C_4 \sqrt{\log(2d)}\,.\qquad{(13)}\]

5.2 Discretization error in UL↩︎

For the BAOAB integrator we adapt the framework of [29], comparing the BAOAB chain with an HOH chain for an accurate discretization error estimate even in the large-\(\gamma\) limit. Our analysis differs mainly in measuring the error in the \(\ell^\infty\) norm rather than \(\ell^2\). The key component of 19 is \((\mathsf{U}_{\text{\normalfont\scshape baoab},h}^l - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{l})(q^*, p^*)\). Run \(l\) steps of each scheme from the same initial state \((q^*,p^*)\) under the same O-step noise \(\xi_0, \dots, \xi_{l-1}\): \[(x_i, p_i) = \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\xi_{i-1}}(x_{i-1}, p_{i-1})\,, \qquad (y_i, p'_i) = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{i-1}}(y_{i-1}, p'_{i-1})\,,\] with \((x_0, p_0) = (y_0, p_0') = (q^*,p^*)\). Writing \(\Delta_q^i = x_i - y_i\) and \(\Delta_p^i = p_i - p_i'\) for the accumulated discrepancies, the difference above is exactly \((\Delta_q^l, \Delta_p^l)\). The following proposition bounds it in the weighted norm. See Appendix 11 for the proof.

Proposition 16. Assume the shared initial state is \((q^*,p^*)\sim \pi \otimes \mathcal{N}(0,I)\) and suppose Assumption 1 holds. If for any probability measures \(\nu_1, \nu_2\) on \(\mathbb{R}^d\), we have \(|\int \nabla^2 V {\rm d}\nu_1|_{\ell^\infty} \leq C_5\) and \(|\left(\int \nabla^2 V {\rm d}\nu_1\right)\left(\int \nabla^2 V {\rm d}\nu_2\right)|_{\ell^\infty} \leq C_6\), and the step size satisfies \(h \leq \frac{1-\eta}{2\sqrt\beta}\), then the accumulated discretization error across \(l\) steps can be bounded by \[\label{eqn-prop-l-step-error-gronwall-main-text} |(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w} \leq \exp\left[(l-1)h(\frac{3}{2}\frac{C_5}{\sqrt\beta} + \frac{1}{16}\frac{C_6}{\beta^{3/2}} + \sqrt\beta)\right] E_l\,,\qquad{(14)}\] where \[E_l = \left( \frac{27}{64}C_5\, h^3 l + {\frac{27}{8}}\frac{h^2 C_5}{\sqrt{\beta}(1-\eta)} + {\frac{3}{8}}\frac{h^4 C_6}{\sqrt{\beta}(1-\eta)} \right) \sqrt{\log(2d)}\,.\]

5.3 Assembling the bias bounds↩︎

Combining the discretization-error estimates above with the \(\ell^\infty\) propagator bounds of Section 4, under the coupling framework of Section 2, yields iterative inequalities for HMC and its underdamped counterpart. Iterating these to the stationary limit gives the bias bounds of Theorems 1 and 2. The full assembly is carried out in Appendix 12.

6 Conclusions and Discussions↩︎

We study the delocalization of bias phenomenon in unadjusted Hamiltonian Monte Carlo and underdamped Langevin algorithms. Although these algorithms are biased at finite step size \(h\), we show that the \(W_2\) bias of low-dimensional marginals scales with the marginal dimension rather than the full dimension \(d\), when the target potential has weak or sparse interactions, or is Gaussian. Consequently, \(O(\sqrt{K})\) integration steps suffice for a bounded \(W_2\) error across all \(K\)-marginals, up to logarithmic dependence on \(d\). This offers a counterpoint to common practice in Bayesian statistics, where Metropolis–Hastings adjustment is incorporated to eliminate discretization bias. The adjusted variants instead require a step size scaling with the full dimension \(d\), leading to a large number of iterations.

More broadly, we introduce a general matrix-polynomial framework for the propagators of discretized Hamiltonian and Langevin dynamics. The polynomial representation is well-suited to the \(\ell^\infty\) norm, which is not amenable to continuous-time tools such as differentiation. The framework is also not specific to the leap-frog and BAOAB schemes studied here. It applies to other splitting integrators, including OBABO and ABOBA, where, possibly after regrouping the iterates, a single repeating core block satisfies a similar three-term recurrence and the boundary factors contribute only bounded prefactors that do not affect the coefficient estimates. We thus expect the framework to facilitate the study of delocalization of bias in other dynamics as well.

Another interesting direction is randomized HMC [23], [49], where the integration time is randomized to avoid periodicity. Our proof strategy does not directly apply there, as the number of leap-frog steps per outer loop is random rather than fixed.

We follow assumptions on the potential similar to those in [5], [40], and relaxing them toward conditions met by real physical systems is a significant future direction. One such setting is non-log-concave target distributions. Another is more general interaction patterns, such as the decaying but long-range interactions of physical systems rather than the sparse interactions considered here. These extensions are left for future work.

We thank Nawaf Bou-Rabee, Aaron Dinner, Daniel Lacker, Peter A.Whalley, and Fuzhong Zhou for helpful discussions. Y. Chen acknowledges the support from the UCLA DataX Pilot Projects Grant Program. J. Niles-Weed is supported in part by National Science Foundation award DMS-2339829. J. Weare and X. Cheng are supported in part by National Science Foundation award DMS-2425899. X. Cheng is also supported in part by a Dean’s Dissertation Fellowship from the Graduate School of Arts and Science at New York University. AI tools were used only to edit language, flag typographical errors and minor inconsistencies, and generate the TikZ code for the figure.

The appendices contain all technical details. Section 7 gives the proof for Gaussian distributions. Section 8 derives the matrix polynomials. Sections 9 and 10 provide bounds for the propagators of the leap-frog and BAOAB integrators in \(\ell^2\) and \(\ell^\infty\). Discretization error analysis is laid out in Section 11. The sampling bias bounds are concluded in Section 12.

7 Proof for Gaussian Distributions↩︎

Proof of Example 1. We assume \(m\) is chosen so that \(mh\) avoids the discrete set of resonant values at which some eigenmode fails to contract. Away from these, the leap-frog iteration contracts in every mode and the chain converges to \(\pi_h\). As these values are exceptional, we omit the condition from the example. According to [50], the invariant distribution for a target distribution \(\pi=\mathcal{N}(\mu, \Sigma)\) is given by \(\pi_h = \mathcal{N}(\mu, \Sigma_{\infty})\), where \(\Sigma_\infty^{-1} = \Sigma^{-1}(I- \frac{h^2}{4} \Sigma^{-1})\). Consider the coupling between \(\pi_h\) and \(\pi\) as \(X = \Sigma^{1/2}Z + \mu\) and \(Y = \Sigma_\infty^{1/2}Z+\mu\) with \(Z \sim \mathcal{N}(0,I)\). Then, \[W_{2,\ell^\infty}^2(\pi_h, \pi) \leq \mathbb{E}[|X-Y|_{\ell^\infty}^2] = \mathbb{E}[|(\Sigma^{1/2} - \Sigma_\infty^{1/2})Z|_{\ell^\infty}^2].\] Entries of \((\Sigma^{1/2}-\Sigma_\infty^{1/2})Z\) are \(|\Sigma^{1/2}-\Sigma_\infty^{1/2}|_{\ell^2}^2\)-subgaussian. And \[|\Sigma^{1/2}-\Sigma_\infty^{1/2}|_{\ell^2} = \max_{1\leq i \leq d}\left|\frac{1}{\omega_i} - \frac{1}{\hat{\omega}_i}\right| = O(\sqrt{\beta}h^2)\,.\] By Lemma 4, we have \(W_{2,\ell^\infty}(\pi_h, \pi) = O(\sqrt{\beta}h^2 \sqrt{\log(2d)})=O(h\sqrt{\log(2d)})\) as \(h < 1/\sqrt{\beta}\). ◻

8 Derivation of Matrix Polynomials↩︎

Throughout the appendices, when a multivariate damped Chebyshev polynomial is evaluated at the canonical argument determined by its index, with \(H_i\) as specified in the relevant statement, we suppress the argument and write \[\tilde{T}_k^\eta \mathrel{\vcenter{:}}= \tilde{T}_k^\eta\big(\{I - \tfrac{h^2}{2}H_i\}_{i=0}^{k-1}\big)\,, \qquad \tilde{U}_{k-1}^\eta \mathrel{\vcenter{:}}= \tilde{U}_{k-1}^\eta\big(\{I - \tfrac{h^2}{2}H_i\}_{i=1}^{k-1}\big)\,.\] Arguments are written explicitly whenever they differ from this convention, as in the shifted windows of the outer-loop blocks and in the scalar reductions below.

Proof of Proposition 8. Part (a). We derive the correspondence with multivariate damped matrix polynomials from three-term recurrence relations, similar to Proposition 5 but with varying Hessians. With the same noise applied to both trajectories, the BAOAB iteration 4 for the differences \(\Delta q_k \mathrel{\vcenter{:}}= x_k - y_k\) and \(\Delta p_k \mathrel{\vcenter{:}}= p_k - p'_k\) is \[\label{eqn-inner-loop-difference} \begin{align} \Delta q_{k+1} &= \Delta q_k + \tfrac{h}{2}(1+\eta)\Delta p_k - \tfrac{h^2}{4}(1+\eta)H_k \Delta q_k\,,\\ \Delta p_{k+1} &= \eta\big(\Delta p_k - \tfrac{h}{2}H_k\Delta q_k\big) - \tfrac{h}{2}H_{k+1} \Delta q_{k+1}\,. \end{align}\tag{30}\] The leap-frog iteration 3 is the special case \(\eta = 1\), so it suffices to treat 30 for general \(\eta\). We write down 30 also for \((\Delta q_k, \Delta p_k)\) and eliminate the momentum \(\Delta p_k\) in two consecutive steps by matching its coefficients. We then obtain \[\label{eqn-three-term-recurrence-baoab-general} \Delta q_{k+1} = (1+\eta)(I - \tfrac{h^2}{2}H_k)\Delta q_k - \eta \Delta q_{k-1}\,, \qquad k \geq 1\,.\tag{31}\] At \(\eta = 1\), the recurrence recovers the relation for the leap-frog scheme, \(\Delta q_{k+1} = (2I - h^2 H_k)\Delta q_k - \Delta q_{k-1}\).

We prove 23 by induction. It holds for \(k=0,1\) by the initial conditions of \(\tilde{T}_k^\eta\) and \(\tilde{U}_k^\eta\) in Definition 1. For \(k \geq 1\), the induction hypothesis and 31 give \[\begin{align} \Delta q_{k+1} &= \big((1+\eta)(I -\tfrac{h^2}{2}H_k)\tilde{T}_k^\eta - \eta \tilde{T}_{k-1}^\eta\big)\Delta q_0\\ & \quad + \big((1+\eta)(I - \tfrac{h^2}{2}H_k)h\tilde{U}_{k-1}^\eta - \eta h\tilde{U}_{k-2}^\eta\big)\Delta p_0\,, \end{align}\] and the three-term recurrences for \(\tilde{T}_k^\eta\) and \(\tilde{U}_k^\eta\) in 21 and 22 identify the right-hand side as 23 , completing the induction.

Part (b). We iterate the single-scheme identity at \(\eta = 1\) across the HMC outer loops. For \(N \geq 1\), since both trajectories share the refreshment \(\xi_{N-1}\), the identity gives \[\begin{align} \Delta q_{Nm+k} &= \tilde{T}_m^1\big(\{I -\tfrac{h^2}{2}H_i\}_{i=(N-1)m+k}^{Nm+k-1}\big)\,\Delta q_{(N-1)m + k}\\ &= \prod_{j \in\{k + im\}_{i=0}^{N-1}}^{\longleftarrow} \tilde{T}_m^1\big(\{I - \tfrac{h^2}{2}H_l\}_{l=j}^{j+m-1}\big)\,\Delta q_k\,, \end{align}\] and the conclusion follows by substituting the expression for \(\Delta q_k\) from 23 . ◻

A property of these matrix polynomials, which we use when bounding the propagators, is that their coefficients have alternating signs depending only on the total order of each term.

Lemma 1. For any \(\eta \in [0,1]\), the multivariate damped Chebyshev matrix polynomials \(\tilde{T}_k^\eta\) and \(\tilde{U}_{k}^\eta\) expand as \[\label{eqn-first-kind-expansion} \tilde{T}_k^\eta = t^{(k)}_0 I + \sum_{j=1}^{k}(-1)^j h^{2j}\sum_{k-1\geq i_1 > \dots > i_j \geq 0} \tilde{t}_{i_1,\dots,i_j}^{(k)} H_{i_1}\cdots H_{i_j}\,,\tag{32}\] \[\label{eqn-second-kind-expansion} \tilde{U}_{k}^\eta = u_0^{(k)}I + \sum_{j=1}^{k} (-1)^j h^{2j}\sum_{k\geq i_1>\dots>i_j\geq1}\tilde{u}_{i_1,\dots,i_j}^{(k)}H_{i_1}\cdots H_{i_j}\,,\tag{33}\] with \(\tilde{U}_{-1}^\eta \equiv 0\). For \(k \geq 0\), \[t_0^{(k)} = 1\,, \qquad u_0^{(k)} = \tfrac12(1+\eta)\frac{\eta^{k+1} - 1}{\eta - 1}\,,\] and, for \(k \geq i_1+1\), \[\tilde{t}_{i_1,\dots,i_j}^{(k)} = \frac{\eta^{k-i_1}-1}{\eta-1}\,\tilde{t}_{i_1,\dots,i_{j}}^{(i_1+1)}\,, \qquad \tilde{u}_{i_1,\dots i_j}^{(k-1)} = \frac{\eta^{k-i_1}-1}{\eta-1}\,\tilde{u}_{i_1,\dots,i_j}^{(i_1)}\,,\] where for \(\eta = 1\) the quotients are read as the limit \(\lim_{\eta \to 1}(\eta^k - 1)/(\eta-1)= k\). All of these coefficients are nonnegative: \[t_0^{(k)},\;u_0^{(k)},\;\tilde{t}_{i_1,\dots,i_j}^{(k)},\;\tilde{u}_{i_1,\dots,i_j}^{(k)} \geq 0\,.\]

Proof of Lemma 1. The definitions of \(\tilde{T}_k^\eta\) and \(\tilde{U}_k^\eta\) in 21 and 22 give the matrix recurrences \[\begin{align} \tag{34} \tilde{T}_{k+1}^\eta &= (1+\eta)(I - \tfrac{h^2}{2}H_{k})\tilde{T}_k^\eta - \eta \tilde{T}_{k-1}^\eta\,,\\ \tag{35} \tilde{U}_{k+1}^\eta &= (1+\eta)(I - \tfrac{h^2}{2}H_{k+1})\tilde{U}_k^\eta - \eta \tilde{U}_{k-1}^\eta\,. \end{align}\] We establish the expansions 32 and 33 by induction, the cases \(k=0,1\) following from the initial conditions.

Constant terms. The constant coefficients satisfy \(t_0^{(k+1)} = (1+\eta) t_0^{(k)} - \eta t_0^{(k-1)}\) and \(u_0^{(k+1)} = (1+\eta) u_0^{(k)} - \eta u_0^{(k-1)}\), with \(t_0^{(0)} = t_0^{(1)} = 1\), \(u_{0}^{(-1)} = 0\), and \(u_0^{(0)} = (1+\eta)/2\). Solving these gives \(t_0^{(k)} = 1\) and \(u_0^{(k)} = \tfrac12 (1+\eta)\frac{\eta^{k+1}-1}{\eta-1}\), the latter read as \(k+1\) when \(\eta = 1\).

Higher-order terms. Assume 32 and 33 hold up to index \(k\). Passing to \(k+1\) via 34 and 35 , the only new matrix products arise from \(-(1+\eta)\tfrac{h^2}{2}H_k\tilde{T}_k^\eta\) and \(-(1+\eta)\tfrac{h^2}{2}H_{k+1}\tilde{U}_k^\eta\), which prepend \(H_k\) (resp. \(H_{k+1}\)) to the existing terms. Applied to the order-\(j\) terms of \(\tilde{T}_k^\eta\) and \(\tilde{U}_k^\eta\), this produces the order-\((j+1)\) contributions \[(-1)^{j+1}h^{2(j+1)}\tfrac{1+\eta}{2}\!\!\sum_{k-1\geq i_1>\dots>i_j \geq 0}\!\! \tilde{t}_{i_1,\dots,i_j}^{(k)} H_k H_{i_1}\cdots H_{i_j}\,,\] \[(-1)^{j+1}h^{2(j+1)}\tfrac{1+\eta}{2}\!\!\sum_{k\geq i_1>\dots>i_j\geq1}\!\!\tilde{u}_{i_1,\dots,i_j}^{(k)}H_{k+1}H_{i_1}\cdots H_{i_j}\,,\] together with the new order-one terms \(-(1+\eta)\tfrac{h^2}{2}t_0^{(k)}H_k\) and \(-(1+\eta)\tfrac{h^2}{2}u_0^{(k)}H_{k+1}\). In each new product the prepended factor carries a strictly larger index than all of \(i_1 > \dots > i_j\), so the matrices remain in descending index order, and 32 and 33 hold at \(k+1\).

Nonnegativity. We match matrix products across the recurrences and induct on \(j\), the number of factors. The case \(j=0\) was settled above. A product \(H_{i_1}\cdots H_{i_j}\) first appears in \(\tilde{T}_{i_1+1}^\eta\) and \(\tilde{U}_{i_1}^\eta\), with coefficients, for \(i_1\geq 1\), \[\label{eqn-coeff-first-emerge} \tilde{t}_{i_1,\dots,i_j}^{(i_1+1)} = \tfrac{1+\eta}{2}\,\tilde{t}_{i_2,\dots,i_j}^{(i_1)}\,, \qquad \tilde{u}_{i_1,\dots,i_j}^{(i_1)} = \tfrac{1+\eta}{2}\,\tilde{u}_{i_2,\dots,i_j}^{(i_1-1)}\,,\tag{36}\] where for \(j=1\) the right-hand factors are read as the constant coefficients \(t_0^{(i_1)}\) and \(u_0^{(i_1-1)}\). Besides the induction, we also note that the first-kind base case is \(\tilde{t}_0^{(1)}=\frac{1+\eta}{4} \geq 0\), the coefficient of \(-h^2H_0\) in \(\tilde{T}_1^\eta\). By the induction hypothesis on \(j-1\), these initial coefficients are nonnegative. Tracking the coefficient of this same product \(H_{i_1}\cdots H_{i_j}\) in the higher-index polynomials, it satisfies \[\tilde{t}_{i_1,\dots,i_j}^{(i_1+2)} = (1+\eta)\tilde{t}_{i_1,\dots,i_j}^{(i_1+1)}\,, \qquad \tilde{u}_{i_1,\dots,i_j}^{(i_1+1)} = (1+\eta)\tilde{u}_{i_1,\dots,i_j}^{(i_1)}\,,\] and, for \(k \geq i_1+2\), \[\tilde{t}_{i_1,\dots,i_j}^{(k+1)} = (1+\eta)\tilde{t}_{i_1,\dots,i_j}^{(k)} - \eta\tilde{t}_{i_1,\dots,i_j}^{(k-1)}\,, \qquad \tilde{u}_{i_1,\dots,i_j}^{(k)} = (1+\eta)\tilde{u}_{i_1,\dots,i_j}^{(k-1)} - \eta\tilde{u}_{i_1,\dots,i_j}^{(k-2)}\,.\] Solving these recurrences gives, for \(k \geq i_1+1\), \[\tilde{t}_{i_1,\dots,i_j}^{(k)} = \frac{\eta^{k-i_1}-1}{\eta-1}\,\tilde{t}_{i_1,\dots,i_j}^{(i_1+1)}\,, \qquad \tilde{u}_{i_1,\dots,i_j}^{(k-1)} = \frac{\eta^{k-i_1}-1}{\eta-1}\,\tilde{u}_{i_1,\dots,i_j}^{(i_1)}\,,\] which are nonnegative, with the \(\eta=1\) values read as limits as before. ◻

To bound the propagators we need the magnitude of these coefficients. Since all coefficients of a given order share one sign, it suffices to track their aggregate sums \[t_j^{(k)} = \sum_{k-1\geq i_1>\dots>i_j \geq 0} \tilde{t}_{i_1,\dots,i_j}^{(k)}\,, \qquad u_j^{(k)}=\sum_{k \geq i_1>\dots>i_j \geq 1}\tilde{u}_{i_1,\dots,i_j}^{(k)}\,.\] We characterize these aggregate coefficients in two regimes, exactly when \(\eta = 1\), and by upper bounds when \(\eta \in [0,1)\).

Proposition 17. When \(\eta = 1\), \[t_j^{(k)} = k\,\frac{(k+j-1)!}{(k-j)!(2j)!}\,, \quad k\geq 1,\;0\leq j \leq k\,,\] \[u_j^{(k)} = \frac{(k+j+1)!}{(k-j)!(2j+1)!}\,, \quad k \geq 0,\;0 \leq j \leq k\,,\] together with \(t_0^{(0)} = 1\).

Proof of Proposition 17. Taking \(H_i \mathrel{\vcenter{:}}= I\) in Lemma 1 collapses the expansions onto their aggregate coefficients, \[\begin{align} \tilde{T}_k^\eta(\{(1- \tfrac{h^2}{2})I\}_{i=0}^{k-1}) &= t_0^{(k)} I + \sum_{j=1}^k (-1)^j h^{2j}t_j^{(k)}I\,, \\ \tilde{U}_k^\eta(\{(1 - \tfrac{h^2}{2})I\}_{i=1}^{k}) &= u_0^{(k)}I + \sum_{j=1}^k (-1)^jh^{2j}u_j^{(k)}I\,. \end{align}\] At \(\eta = 1\) with equal arguments, the multivariate polynomials reduce to the classical Chebyshev polynomials \(T_k\) and \(U_k\) (as noted after Definition 1), so \[\label{eqn-reduced-matrix-polynomial-coefficients} T_k(1 - \tfrac{h^2}{2})\,I = \sum_{j=0}^k(-1)^j h^{2j}t_j^{(k)}I\,, \qquad U_k(1-\tfrac{h^2}{2})\,I = \sum_{j=0}^k(-1)^jh^{2j}u_j^{(k)}I\,.\tag{37}\] The hypergeometric forms of \(T_k\) and \(U_k\) [51] give explicit expressions for \(T_k(1-x)\) and \(U_k(1-x)\) at \(x = h^2/2\), and matching coefficients yields the stated formulas. ◻

For \(\eta \in [0,1)\), explicit formulas are no longer available, but the following upper bounds suffice to control the propagator norms.

Proposition 18. For \(\eta \in [0, 1)\) and the same ranges of \(j, k\) as in Proposition 17, \[\label{eqn-prop-matrix-polynomial-agg-coeff-eta} t_j^{(k)} \leq \left(\frac{1}{1-\eta}\right)^j \binom{k}{j}\,, \quad u_j^{(k)} \leq \left(\frac{1}{1-\eta}\right)^{j+1}\binom{k}{j}\,.\qquad{(15)}\]

Proof of Proposition 18. We derive iterative inequalities for the coefficients from their recurrences and conclude by induction. We treat \(t_j^{(k)}\), and the argument for \(u_j^{(k)}\) is analogous. For \(j \geq 1\), Lemma 1 gives \[t_j^{(k)} = \sum_{k-1 \geq i_1 > \dots > i_j \geq 0}\tilde{t}_{i_1,\dots,i_j}^{(k)} = \sum_{k-1\geq i_1 > \dots > i_j \geq 0}\frac{\eta^{k-i_1}-1}{\eta - 1}\,\tilde{t}_{i_1,\dots,i_j}^{(i_1+1)}\,.\] By 36 and the initial conditions \(\tilde{t}_0^{(1)} = \frac{1+\eta}{4}\) (which is the coefficient of \(-h^2H_0\)) and \(t_0^{(0)}= 1\), we have \(\tilde{t}_{i_1,\dots,i_j}^{(i_1+1)} \leq \tfrac12(1+\eta)\,\tilde{t}_{i_2,\dots,i_j}^{(i_1)}\), so \[\begin{align} t_j^{(k)} &\leq \tfrac12(1+\eta)\sum_{k-1\geq i_1\geq j-1}\frac{\eta^{k-i_1}-1}{\eta-1}\left(\sum_{i_1-1\geq i_2 > \dots > i_j \geq 0} \tilde{t}_{i_2,\dots,i_j}^{(i_1)}\right)\\ & = \tfrac12(1+\eta)\sum_{k-1\geq i_1 \geq j-1}\frac{\eta^{k-i_1}-1}{\eta-1}\,t_{j-1}^{(i_1)} \leq \frac{1}{1-\eta}\sum_{k-1\geq i_1 \geq j-1} t_{j-1}^{(i_1)}\,, \end{align}\] using the definition of \(t_{j-1}^{(i_1)}\) in the equality. We now induct on \(j\). The case \(j = 0\) holds since \(t_0^{(k)} = 1\) for all \(k\). Assuming ?? for some \(j\) and all \(k \geq j\), then for \(k \geq j+1\), \[t_{j+1}^{(k)}\leq \frac{1}{1-\eta}\sum_{k-1\geq i_1 \geq j} \Big(\frac{1}{1-\eta}\Big)^j\binom{i_1}{j} = \Big(\frac{1}{1-\eta}\Big)^{j+1}\binom{k}{j+1}\,,\] where the last step uses Pascal’s rule \(\sum_{k-1\geq i_1 \geq j}\binom{i_1}{j} = \binom{k}{j+1}\). This proves the bound for \(t_j^{(k)}\).

For \(u_j^{(k)}\), the same steps give the iterative inequality \(u_j^{(k)} \leq \frac{1}{1-\eta}\sum_{k \geq i_1\geq j} u_{j-1}^{(i_1-1)}\). Combined with the initial condition \(u_0^{(k)} = \tfrac12(1+\eta)\frac{\eta^{k+1}-1}{\eta-1}\) from Lemma 1 and the identity \(\sum_{k\geq i_1\geq j}\binom{i_1-1}{j-1} = \binom{k}{j}\), this yields the stated bound. ◻

Part (b) of Proposition 8 concerns the HMC propagators across multiple outer loops. The corresponding matrix polynomials again have coefficients of alternating signs, related to the inner-loop coefficients \(t_j^{(k)}\) and \(u_j^{(k)}\). We only need that the outer-loop aggregate coefficients inherit any uniform bound on the inner-loop ones.

Proposition 19. When \(\eta = 1\), the propagators in 24 expand as \[\label{eqn-propagator-outerloop-sign-a} \begin{align} &\Big(\prod_{j \in\{k + im\}_{i=0}^{N-1}}^{\longleftarrow} \tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_l\}_{l=j}^{j+m-1})\Big)\, \tilde{T}_k^1\\ &\qquad = a_0^{(Nm+k)}I + \sum_{j=1}^{Nm+k} (-1)^j h^{2j}\!\!\sum_{i_1>\dots>i_j}\!\! a_{i_1,\dots,i_j}^{(Nm+k)} H_{i_1}\cdots H_{i_j}\,, \end{align}\qquad{(16)}\] \[\label{eqn-propagator-outerloop-sign-b} \begin{align} &\Big(\prod_{j \in\{k + im\}_{i=0}^{N-1}}^{\longleftarrow} \tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_l\}_{l=j}^{j+m-1})\Big)\, \tilde{U}_{k-1}^1\\ &\qquad = b_0^{(Nm+k-1)}I + \sum_{j=1}^{Nm+k-1} (-1)^j h^{2j}\!\!\sum_{i_1>\dots>i_j}\!\! b_{i_1,\dots,i_j}^{(Nm+k-1)} H_{i_1}\cdots H_{i_j}\,, \end{align}\qquad{(17)}\] with all coefficients nonnegative. Writing \(a_j^{(Nm+k)} = \sum_{i_1>\dots>i_j} a_{i_1,\dots,i_j}^{(Nm+k)}\) and \(b_j^{(Nm+k-1)} = \sum_{i_1>\dots>i_j} b_{i_1,\dots,i_j}^{(Nm+k-1)}\) for the aggregate coefficients, we have \[\label{eqn-outerloop-coeff-bound} a_j^{(Nm+k)} \leq \max_{j \leq i \leq Nm+k} t_j^{(i)}\,, \qquad b_j^{(Nm+k-1)} \leq \max_{j \leq i \leq Nm+k-1} u_j^{(i)}\,.\qquad{(18)}\]

Proof of Proposition 19. Alternating signs. In each factor \(\tilde{T}_k^1\) and \(\tilde{U}_k^1\) with arguments \(I - \tfrac{h^2}{2}H_i\), a product of \(j\) matrices carries the sign \((-1)^j\). This sign is multiplicative across the product of factors in ?? and ?? , so every order-\(j\) product carries \((-1)^j\), and the coefficients are nonnegative.

Reduction to Chebyshev polynomials. Taking \(H_i \mathrel{\vcenter{:}}= I\) collapses the expansions onto their aggregate coefficients, and at \(\eta = 1\) the multivariate polynomials reduce to the classical \(T_k\) and \(U_k\), giving \[\begin{align} \big(T_m(1-\tfrac{h^2}{2})\big)^N T_k(1-\tfrac{h^2}{2})\,I &= a_0^{(Nm+k)}I + \sum_{j=1}^{Nm+k}(-1)^j h^{2j}a_j^{(Nm+k)}I\,,\\ \big(T_m(1-\tfrac{h^2}{2})\big)^N U_{k-1}(1-\tfrac{h^2}{2})\,I &= b_0^{(Nm+k-1)}I + \sum_{j=1}^{Nm+k-1}(-1)^j h^{2j}b_j^{(Nm+k-1)}I\,. \end{align}\] Writing \(\theta = \arccos(1-h^2/2)\), so that \(T_k(1-\tfrac{h^2}{2}) = \cos(k\theta)\) and \(U_{k-1}(1-\tfrac{h^2}{2}) = \sin(k\theta)/\sin\theta\), and expanding \[\label{eqn-cos-power-N} \big(\cos(m\theta)\big)^N = \frac{1}{2^N}\sum_{i=0}^N\binom{N}{i}\exp(\mathrm{i}(2i-N)m\theta)\,,\tag{38}\] we pair conjugate exponentials into cosines and apply \(2\cos x\cos y = \cos(x-y)+\cos(x+y)\) and \(2\cos x\sin y = \sin(x+y) - \sin(x-y)\). Rewriting the resulting trigonometric sums back in terms of Chebyshev polynomials expresses \(\big(T_m\big)^N T_k\) as a binomially weighted sum of \(T_{\,\cdot}\) at shifted indices \(2im \pm k\) (for \(N\) even) or \((2i-1)m \pm k\) (for \(N\) odd), all with positive weights. For \(\big(T_m\big)^N U_{k-1}\) the \(\sin(x+y) - \sin(x-y)\) identity instead produces a signed sum of \(U_{\,\cdot}\) at indices \(2im \pm k - 1\) (for \(N\) even) or \((2i-1)m \pm k - 1\) (for \(N\) odd), the \(x-y\) terms entering with a minus sign. Matching coefficients with \(t_j^{(\cdot)}\) and \(u_j^{(\cdot)}\) then writes each \(a_j^{(Nm+k)}\) and \(b_j^{(Nm+k-1)}\) as a \(2^{-N}\)-weighted sum of inner-loop aggregate coefficients \(t_j^{(i)}\) and \(u_j^{(i)}\), with binomial weights and indicator factors \(\mathbf{1}_{j \leq i}\). The sum for \(a_j^{(Nm+k)}\) has all positive weights, while that for \(b_j^{(Nm+k-1)}\) inherits the minus signs above. Explicit formulas can be read off in this way, but the main results need only the bound below.

Bound. Each \(a_j^{(Nm+k)}\) is a sum of the form \(\tfrac{1}{2^N}\sum_i w_i\, t_j^{(i)}\mathbf{1}_{j \leq i}\) with nonnegative binomial weights \(w_i\) satisfying \(\sum_i w_i = 2^N\). Since the \(t_j^{(i)}\) are nonnegative by Lemma 1, bounding each term by \(t_j^{(i)}\mathbf{1}_{j \leq i} \leq \max_{j \leq i \leq Nm+k} t_j^{(i)}\) gives \[a_j^{(Nm+k)} \leq \frac{1}{2^N}\Big(\sum_i w_i\Big)\max_{j \leq i \leq Nm+k} t_j^{(i)} = \max_{j \leq i \leq Nm+k} t_j^{(i)}\,.\] The same argument bounds \(b_j^{(Nm+k-1)}\). Here some \(u_j^{(i)}\) enter with negative signs, but since the \(u_j^{(i)}\) are nonnegative, discarding the subtracted terms only increases the bound, and the remaining terms are controlled as above by \(\max_{j \leq i \leq Nm+k-1} u_j^{(i)}\). ◻

9 Bounds for Leap-frog Propagators↩︎

9.1 \(\ell^2\) bounds↩︎

Our \(\ell^2\) bound for \(\tilde{T}_k^1\) adapts the discrete-time HMC contraction result for the position component, Lemma 19 in [42], replacing the state-dependent Hessians there by general matrices. The underlying argument carries through unchanged. Extending this to the momentum component gives the bound for \(\tilde{U}_{k-1}^1\).

The adaptation rests on decoupling the matrix sequence from the trajectory. Because the leap-frog scheme is nonlinear in the state-dependent Hessians, a trajectory contraction bound \(|x_k - y_k|_{\ell^2} \leq c|x_0-y_0|_{\ell^2}\) does not by itself give a matrix-norm bound. We therefore analyze a linear system driven by an arbitrary, state-independent matrix sequence \(\{H_i\}\). The contraction proof of [42] does not use that the Hessians are evaluated along the trajectory, so the adaptation is direct. The resulting bounds hold for any initial condition and hence translate to matrix-norm bounds. Instantiating with the integrated Hessians yields Proposition 9.

Proposition 20 (\(\ell^2\) bounds for leap-frog, general matrices). Let \(\{H_i\}\) be symmetric positive definite matrices with \(\alpha I \preceq H_i \preceq \beta I\) for \(\alpha, \beta\) as in Assumption 1. For \(kh \leq 1/\sqrt{20\beta}\), the matrix polynomials \(\tilde{T}_k^1\) and \(\tilde{U}_{k-1}^1\), evaluated at the canonical arguments \(\{I - \tfrac{h^2}{2}H_i\}\) with these general \(H_i\) (recall the shorthand introduced in Section 8), satisfy \[\label{eqn-l2bounds-hmc-Tk-general} |\tilde{T}_k^1|_{\ell^2} \leq 1 - \frac{\alpha}{10}(kh)^2\,,\qquad |h\tilde{U}_{k-1}^1|_{\ell^2} \leq \sqrt{\frac{2}{5\beta}}\,.\qquad{(19)}\]

Proof of Proposition 20. We interpret the polynomials with general \(\{H_i\}\) as the propagator of a leap-frog iteration with varying quadratic potentials, which lets us bound their \(\ell^2\) norms through the contraction and boundedness of the discrete-time dynamics, analyzed via their continuous-time interpolation.

Connection with dynamics. Consider the time-inhomogeneous linear dynamics driven by \(\{H_i\}\), \[\label{eqn-linear-inner-loop} \begin{align} q_{k+1} &= q_k + hp_k - \tfrac{h^2}{2}H_k q_k\,,\\ p_{k+1} &= p_k - \tfrac{h}{2}H_kq_k - \tfrac{h}{2}H_{k+1}q_{k+1}\,, \end{align}\tag{39}\] which is the leap-frog scheme 3 with the quadratic potential \(V_k(q) = \tfrac12 q^\top H_k q\) at step \(k\). For two initial states \((x_0, p_0)\), \((y_0, p_0')\), the differences \(\Delta q_k \mathrel{\vcenter{:}}= x_k - y_k\), \(\Delta p_k \mathrel{\vcenter{:}}= p_k - p'_k\) satisfy \[\label{eqn-linear-inner-loop-difference} \begin{align} \Delta q_{k+1} &= (I- \tfrac{h^2}{2} H_k)\Delta q_k + h \Delta p_k\,,\\ \Delta p_{k+1} &= \Delta p_k - \tfrac{h}{2}H_k \Delta q_k - \tfrac{h}{2}H_{k+1}\Delta q_{k+1}\,. \end{align}\tag{40}\] This matches 30 in the proof of Proposition 8, now with general \(\{H_i\}\) in place of the integrated Hessians. As that proof does not use the specific Hessian structure, the same argument gives the three-term recurrence \(\Delta q_{k+1} = (2I - h^2 H_k)\Delta q_k - \Delta q_{k-1}\) for \(k \geq 1\) and, by induction, \[\label{eqn-prop-proof-q-dependence-q0-p0} \Delta q_{k} = \tilde{T}_{k}^1\,\Delta q_0 + h\tilde{U}_{k-1}^1\,\Delta p_0\,.\tag{41}\] Thus \(\tilde{T}_k^1\) and \(h\tilde{U}_{k-1}^1\) are the propagators of 39 . We bound their \(\ell^2\) norms by choosing initial conditions that isolate each, setting \(\Delta p_0 = 0\) for \(\tilde{T}_k^1\), and \(\Delta q_0 = 0\) for \(h\tilde{U}_{k-1}^1\).

\(\ell^2\) norm of \(\tilde{T}_k^1\). Adapting the proof of [42] to a fixed matrix sequence \(\{H_i\}\) rather than the leap-frog scheme of the target potential, we show that the position difference still contracts when the potential is decoupled from the trajectory. We include it both for completeness and to set up the \(\tilde{U}_k^1\) bound. Introduce the continuous-time interpolation of 39 , \[\label{eqn-linear-inner-loop-interpolation} \begin{align} \frac{{\rm d} q_t}{{\rm d }t} &= p_{\lfloor t \rfloor_h} - (t - \lfloor t \rfloor_h)H_{\lfloor t \rfloor_h}q_{\lfloor t \rfloor_h}\,,\\ \frac{{\rm d}p_t}{{\rm d}t} &= -\tfrac12(H_{\lfloor t \rfloor_h} q_{\lfloor t \rfloor_h} + H_{\lceil t \rceil_h} q_{\lceil t \rceil_h})\,, \end{align}\tag{42}\] with \(\lfloor t \rfloor_h \mathrel{\vcenter{:}}= \lfloor t/h\rfloor h\) and \(\lceil t \rceil_h \mathrel{\vcenter{:}}= \lceil t/h \rceil h\). Take two trajectories from \((x_0, p_0)\) and \((y_0, p_0')\) with \(p_0 = p_0'\), set \(z_t \mathrel{\vcenter{:}}= x_t - y_t\), \(w_t \mathrel{\vcenter{:}}= p_t - p_t'\), and at each grid point \(t_k = kh\) define \(\Phi_{kh} \mathrel{\vcenter{:}}= H_{k} z_{kh}\) and \(\varphi_{kh} \mathrel{\vcenter{:}}= \Phi_{kh}\cdot z_{kh}\), with \(\cdot\) the inner product. Then \(w_0 = 0\) and \(|\Phi_t|_{\ell^2}^2 \leq \beta \varphi_t\), and 42 gives \[\label{eqn-linear-inner-loop-interpolation-difference} \begin{align} \frac{{\rm d}z_t}{{\rm d}t} &= w_{\lfloor t \rfloor_h} - (t - \lfloor t \rfloor_h) \Phi_{\lfloor t \rfloor_h}\,,\\ \frac{{\rm d}w_t}{{\rm d}t} &= -\tfrac12(\Phi_{\lfloor t \rfloor_h}+\Phi_{\lceil t \rceil_h})\,. \end{align}\tag{43}\] Let \(a_t = |z_t|_{\ell^2}^2\) and \(b_t = 2 z_t \cdot w_t\), so \(b_0 = 0\) and \(\alpha a_{kh} \leq \varphi_{kh} \leq \beta a_{kh}\) since \(\alpha I \preceq H_k \preceq \beta I\). We track \(a_t, b_t\) to bound \(a_t\). From 43 , \[\label{eqn-linear-inner-loop-interpolation-ab} \begin{align} \frac{{\rm d} a_t}{{\rm d}t} &= b_t + \delta_t\,,\\ \frac{{\rm d}b_t}{{\rm d}t} &= - C_1\alpha a_t + \eta_t\,, \end{align}\tag{44}\] where \(C_1>0\) is chosen later and the perturbations are \[\begin{align} \delta_t &= 2z_t \cdot(w_{\lfloor t \rfloor_h}-w_t - (t - \lfloor t \rfloor_h)\Phi_{\lfloor t \rfloor_h}) = (t - \lfloor t \rfloor_h)z_t \cdot (\Phi_{\lceil t\rceil_h} - \Phi_{\lfloor t \rfloor_h})\,,\\ \eta_t &= C_1\alpha a_t + 2|w_{\lfloor t \rfloor_h} - (t - \lfloor t \rfloor_h)\Phi_{\lfloor t \rfloor_h}|_{\ell^2}^2 - z_t \cdot(\Phi_{\lfloor t \rfloor_h} + \Phi_{\lceil t \rceil_h})\\ &\quad -(t - \lfloor t \rfloor_h)(w_{\lfloor t \rfloor_h} - (t - \lfloor t \rfloor_h)\Phi_{\lfloor t \rfloor_h})\cdot(\Phi_{\lceil t \rceil_h}-\Phi_{\lfloor t \rfloor_h})\,. \end{align}\] The term \(\delta_t\) is piecewise smooth, with \[\frac{{\rm d} \delta_t}{{\rm d}t} = z_t \cdot(\Phi_{\lceil t \rceil_h}-\Phi_{\lfloor t\rfloor_h})+(t - \lfloor t \rfloor_h)(w_{\lfloor t \rfloor_h} - (t - \lfloor t\rfloor_h)\Phi_{\lfloor t\rfloor_h})\cdot(\Phi_{\lceil t\rceil_h}-\Phi_{\lfloor t\rfloor_h})\] in the interior of each step, and at grid points \(\delta_{kh^+} = 0\) and \[\delta_{kh^-} = h(\varphi_{kh} - \varphi_{(k-1)h}) - h(hw_{(k-1)h}-\tfrac12h^2\Phi_{(k-1)h})\cdot \Phi_{(k-1)h}\,.\] Solving the perturbed system 44 by variation of parameters, with \(s_{t} = \frac{\sin(\sqrt{C_1\alpha}t)}{\sqrt{C_1\alpha}}\) and \(c_t = \cos(\sqrt{C_1\alpha}t)\) (so \(s_t\) is increasing and nonnegative on \(0\leq t \leq \frac{\pi}{2\sqrt{C_1\alpha}}\)), gives \[\label{eqn-solution-a} \begin{align} a_t & = c_t a_0 + \int_0^t c_{t-r}\delta_r {\rm d}r + \int_0^t s_{t-r}\eta_r {\rm d}r\\ & = c_t a_0 + \sum_{k=1}^{\lceil t/h\rceil-1}[s_{t-r}\delta_r]|^{r=kh^+}_{r=kh^-} - [s_{t-r}\delta_r]|^{r=t^-}_{r=0^+} + \int_0^t s_{t-r}(\eta_r + \tfrac{{\rm d}\delta_r}{{\rm d}r}) {\rm d} r\\ & = c_t a_0 -\sum_{k=1}^{\lceil t/h\rceil -1}s_{t-kh}\delta_{kh^-}+\int_0^t s_{t-r}(-2\varphi_{\lfloor r\rfloor_h}+C_1\alpha a_{\lfloor r \rfloor_h} + \varepsilon_r) {\rm d} r\,, \end{align}\tag{45}\] where we integrated by parts and set \(\varepsilon_t \mathrel{\vcenter{:}}= \varepsilon_t^1 + \varepsilon_t^2 + \varepsilon_t^3\), \[\begin{align} \varepsilon_t^1 &= 2|w_{\lfloor t \rfloor_h} - (t - \lfloor t \rfloor_h)\Phi_{\lfloor t \rfloor_h}|_{\ell^2}^2\,,\\ \varepsilon_t^2 &= -2(z_t - z_{\lfloor t \rfloor_h})\cdot \Phi_{\lfloor t \rfloor_h}\,,\\ \varepsilon_t^3 &= C_1\alpha(z_t - z_{\lfloor t \rfloor_h}) \cdot (z_t + z_{\lfloor t \rfloor_h})\,. \end{align}\] We aim to show \(a_t \leq c_t a_0\) for a suitable \(C_1\), which requires bounding the remaining terms in 45 . Using \(|\Phi_{\lfloor t \rfloor_h}|_{\ell^2}^2 \leq \beta \varphi_{\lfloor t \rfloor_h}\), \[\varepsilon_t^1 \leq 6|w_{\lfloor t \rfloor_h}|_{\ell^2}^2 + 3(t-\lfloor t \rfloor_h)^2|\Phi_{\lfloor t \rfloor_h}|_{\ell^2}^2 \leq 6|w_{\lfloor t \rfloor_h}|_{\ell^2}^2 + 3\beta h^2\varphi_{\lfloor t \rfloor_h}\,.\] Substituting \(z_t - z_{\lfloor t \rfloor_h}\) from 43 into \(\varepsilon_t^2\), \[\begin{align} \varepsilon_t^2 &= -2 (t - \lfloor t \rfloor_h) w_{\lfloor t \rfloor_h}\cdot \Phi_{\lfloor t \rfloor_h} + (t - \lfloor t \rfloor _h)^2|\Phi_{\lfloor t\rfloor_h}|_{\ell^2}^2\\ & \leq 2|w_{\lfloor t \rfloor_h}|_{\ell^2}^2+ \tfrac32 h^2 |\Phi_{\lfloor t \rfloor_h}|_{\ell^2}^2\leq 2|w_{\lfloor t \rfloor_h}|_{\ell^2}^2 + \tfrac32\beta h^2\varphi_{\lfloor t \rfloor_h}\,, \end{align}\] and similarly for \(\varepsilon_t^3\), \[\begin{align} \varepsilon_t^3 &= C_1 \alpha|(t-\lfloor t \rfloor_h)w_{\lfloor t \rfloor_h} - \tfrac12(t - \lfloor t \rfloor_h)^2 \Phi_{\lfloor t\rfloor_h}|_{\ell^2}^2\\ & \quad +2 C_1\alpha z_{\lfloor t \rfloor_h} \cdot ((t - \lfloor t \rfloor_h) w_{\lfloor t \rfloor_h} - \tfrac12(t - \lfloor t \rfloor_h)^2\Phi_{\lfloor t\rfloor_h})\,. \end{align}\] The first term is bounded by \(2 C_1\alpha h^2|w_{\lfloor t \rfloor_h}|_{\ell^2}^2 + \tfrac{1}{2}C_1\alpha h^4\beta \varphi_{\lfloor t\rfloor_h}\). For the second, \(|z_{\lfloor t \rfloor_h}|_{\ell^2}^2 = a_{\lfloor t \rfloor_h} \leq \varphi_{\lfloor t \rfloor_h}/\alpha\) gives \[2 C_1\alpha z_{\lfloor t \rfloor_h} \cdot (t - \lfloor t \rfloor_h)w_{\lfloor t\rfloor_h} \leq h^2 C_1^2\alpha^2|z_{\lfloor t \rfloor_h}|_{\ell^2}^2 + |w_{\lfloor t \rfloor_h}|_{\ell^2}^2 \leq h^2C_1^2\alpha \varphi_{\lfloor t\rfloor_h}+|w_{\lfloor t \rfloor_h}|_{\ell^2}^2\,.\] Since \(z_{\lfloor t \rfloor_h} \cdot \Phi_{\lfloor t \rfloor_h} \geq 0\), \[\varepsilon_t^3 \leq (1 + 2C_1\alpha h^2)|w_{\lfloor t\rfloor_h}|_{\ell^2}^2 + C_1\alpha(C_1 h^2 + \tfrac12 \beta h^4)\varphi_{\lfloor t \rfloor_h}\,,\] and combining the three estimates, \[\label{eqn-bound-varepsilont} \varepsilon_t \leq (9 + 2C_1\alpha h^2)|w_{\lfloor t\rfloor_h}|_{\ell^2}^2 + \left[ \tfrac92\beta h^2+C_1\alpha(C_1 h^2 + \tfrac12 \beta h^4) \right]\varphi_{\lfloor t \rfloor_h}\,.\tag{46}\] For the boundary sum in 45 , when \(t/h\in \mathbb{Z}^+\), summation by parts gives \[\label{eqn-bound-boundary-terms-original} \begin{align} -\sum_{k=1}^{t/h-1}s_{t-kh}\delta_{kh^-} = & \sum_{k=2}^{t/h-1}h(s_{t-kh} - s_{t-(k-1)h})\varphi_{(k-1)h}-h s_h\varphi_{t-h} + h s_{t-h}\varphi_0 \\ & + \sum_{k=1}^{t/h-1}hs_{t-kh}(hw_{(k-1)h} -\tfrac12h^2\Phi_{(k-1)h})\cdot \Phi_{(k-1)h}\,. \end{align}\tag{47}\] Since \(s_{t-kh} \leq s_{t-r}\) for \(r \in [(k-1)h, kh)\), \(\varphi_{kh} \geq 0\), and \[h^2 w_{(k-1)h} \cdot \Phi_{(k-1)h} \leq \tfrac12h|w_{(k-1)h}|_{\ell^2}^2 + \tfrac12h^3|\Phi_{(k-1)h}|_{\ell^2}^2\leq \tfrac12h|w_{(k-1)h}|_{\ell^2}^2 + \tfrac12\beta h^3\varphi_{(k-1)h}\,,\] we obtain, for \(t/h \in \mathbb{Z}^+\), \[\label{eqn-bound-boundary-terms-same-momenta} -\sum_{k=1}^{t/h-1} s_{t-kh} \delta_{kh^-} \leq \int_0^h s_{t-r}\varphi_{\lfloor r \rfloor_h}{\rm d}r+ \tfrac12\int_0^t s_{t-r}(|w_{\lfloor r \rfloor_h}|_{\ell^2}^2 + \beta h^2 \varphi_{\lfloor r \rfloor_h}){\rm d} r\,.\tag{48}\] From 43 with \(w_0=0\), Cauchy–Schwarz and \(|\Phi_{\lfloor \tau\rfloor_h}|_{\ell^2}^2 \leq \beta\varphi_{\lfloor \tau\rfloor_h}\) give \[\label{eqn-w-integration-no-initial-bound} |w_{\lfloor t \rfloor_h}|_{\ell^2}^2 = \left|\tfrac12\int_0^{\lfloor t \rfloor_h}(\Phi_{\lfloor \tau \rfloor_h} + \Phi_{\lceil \tau \rceil_h}){\rm d}\tau\right|_{\ell^2}^2 \leq \tfrac12\beta \lfloor t \rfloor_h \left(\int_0^{\lfloor t\rfloor_h} \varphi_{\lfloor \tau\rfloor_h} {\rm d} \tau + \int_0^{\lfloor t \rfloor_h} \varphi_{\lceil \tau \rceil_h}{\rm d}\tau\right)\,.\tag{49}\] To bound \(\int_0^t s_{t-r}|w_{\lfloor r \rfloor_h}|_{\ell^2}^2{\rm d}r\), we note that for \(t/h\in \mathbb{Z}^+\), \[\label{eqn-sw-bound-prep} \int_0^t s_{t-r} \lfloor r \rfloor_h \left(\int_0^{\lfloor r \rfloor_h}\varphi_{\lceil \tau \rceil_h}{\rm d}\tau \right) {\rm d}r = \int_h^{t} \left(\int_{\lfloor \tau \rfloor_h}^{t}s_{t-r}\lfloor r \rfloor_h {\rm d}r\right) \varphi_{\lfloor \tau \rfloor_h}{\rm d}\tau\,.\tag{50}\] As \(s_t\) is increasing, we decompose the integral in \(r\) into sub-intervals of length \(h\), and direct calculation of the sum of \(\lfloor r \rfloor_h\) terms gives \[\int_{\lfloor\tau\rfloor_h}^{t} s_{t-r}\lfloor r\rfloor_h {\rm d}r \leq \left(\int_{\lfloor \tau \rfloor_h}^{\lfloor \tau \rfloor_h + h}s_{t-r}{\rm d}r\right) \frac{t^2}{2h}\,.\] Plugging into 50 and switching the order of integration yield an upper bound \[\int_h^t \left(\int_{\lfloor \tau \rfloor_h}^{\lfloor \tau \rfloor_h + h}s_{t-r}{\rm d}r\right) \frac{t^2}{2h} \varphi_{\lfloor \tau\rfloor_h}{\rm d}\tau = \frac{t^2}{2}\int_h^{t} s_{t-r}\varphi_{\lfloor r\rfloor_h} {\rm d}r\,.\] We can similarly derive for the other term in 49 that \[\int_0^ts_{t-r}\lfloor r \rfloor_h \left( \int_0^{\lfloor r \rfloor_h}\varphi_{\lfloor \tau \rfloor_h}{\rm d}\tau\right){\rm d}r \leq \frac{t^2}{2}\int_0^{t-h}s_{t-r}\varphi_{\lfloor r\rfloor_h}{\rm d}r\,,\] and combining these two bounds yields \[\label{eqn-sw-bound} \int_0^t s_{t-r}|w_{\lfloor r \rfloor_h}|_{\ell^2}^2 {\rm d}r \leq \tfrac12\beta t^2\int_0^t s_{t-r}\varphi_{\lfloor r \rfloor_h}{\rm d}r\,.\tag{51}\] Hence the last two terms of 45 are bounded by \[\begin{align} & -\sum_{k=1}^{\lceil t/h\rceil -1}s_{t-kh}\delta_{kh^-}+\int_0^t s_{t-r}(-2\varphi_{\lfloor r\rfloor_h}+C_1\alpha a_{\lfloor r \rfloor_h} + \varepsilon_r) {\rm d} r\\ &\leq \int_0^h s_{t-r}\varphi_{\lfloor r\rfloor_h}{\rm d}r + \int_0^t s_{t-r}(-2\varphi_{\lfloor r\rfloor_h} + C_1\alpha a_{\lfloor r\rfloor_h}) {\rm d} r\\ & \quad +\int_0^t s_{t-r}((5\beta h^2 + C_1^2\alpha h^2 + \tfrac12 C_1 \alpha \beta h^4)\varphi_{\lfloor r\rfloor_h} + (\tfrac{19}{2} + 2C_1\alpha h^2)|w_{\lfloor r\rfloor_h}|_{\ell^2}^2){\rm d}r\,. \end{align}\] Applying 51 and \(\alpha a_{kh} \leq \varphi_{kh}\), \[\begin{align} & -\sum_{k=1}^{\lceil t/h\rceil -1}s_{t-kh}\delta_{kh^-}+\int_0^t s_{t-r}(-2\varphi_{\lfloor r\rfloor_h}+C_1\alpha a_{\lfloor r \rfloor_h} + \varepsilon_r) {\rm d} r\\ \leq & \int_0^t s_{t-r}\left[-1 + C_1 + 5\beta h^2 + C_1^2\alpha h^2 + \tfrac12 C_1 \alpha \beta h^4 + (\tfrac{19}{4}+ C_1\alpha h^2)\beta t^2\right]\varphi_{\lfloor r \rfloor_h}{\rm d}r\\ \leq & \int_0^t s_{t-r}\left[-1 + C_1 + (\tfrac{39}{4}+C_1^2 + \tfrac32C_1\beta t^2)\beta t^2 \right]{\varphi_{\lfloor r \rfloor_h}}{\rm d}r\,, \end{align}\] using \(t/h\in \mathbb{Z}^+\) and \(\alpha \leq \beta\) in the last line. Taking \(C_1 = 4/9\) and \(\beta t^2 \leq 1/20\) makes the bracketed coefficient negative, so 45 gives \(a_t \leq c_t a_0\). The same choice gives \(t \leq \pi/(2\sqrt{C_1\alpha})\), ensuring \(s_t\) is monotone on the interval, and \[\begin{align} c_t &\leq 1 - \tfrac12C_1\alpha t^2 + \tfrac16C_1^2\alpha^2 t^4 \leq 1 - \tfrac12 C_1\alpha t^2 + \tfrac{1}{120}C_1^2\alpha t^2(\alpha/\beta)\\ & \leq 1 - (\tfrac12 C_1 - \tfrac{1}{120}C_1^2)\alpha t^2 \leq 1 - \tfrac15\alpha t^2\,. \end{align}\] Thus for \(t = kh\) with \(p_0 = p_0'\), \(|x_t - y_t|_{\ell^2}^2 \leq (1 - \tfrac{\alpha}{5}(kh)^2)|x_0 - y_0|_{\ell^2}^2\), and by 41 , \[|\tilde{T}_{k}^1|_{\ell^2} \leq 1 - \frac{\alpha}{10}(kh)^2\,.\]

\(\ell^2\) norm of \(h\tilde{U}_{k-1}^1\). By 41 , bounding \(|h\tilde{U}_{k-1}^1|_{\ell^2}\) again reduces to bounding \(a_t\), now with initial conditions \(z_0 = 0\), \(w_0 = p_0 - p_0'\), so \(a_0 = b_0 = 0\) and \[\label{eqn-solution-a-same-positions} \begin{align} a_t &= \int_0^t c_{t-r}\delta_r {\rm d}r + \int_0^t s_{t-r}\eta_r {\rm d}r\\ &= -\sum_{k=1}^{\lceil t/h\rceil -1}s_{t-kh}\delta_{kh^-}+\int_0^t s_{t-r}(-2\varphi_{\lfloor r\rfloor_h}+C_1\alpha a_{\lfloor r \rfloor_h} + \varepsilon_r) {\rm d} r\,. \end{align}\tag{52}\] The boundary decomposition 47 still holds, and since now \(\varphi_0=0\), it refines 48 to \[-\sum_{k=1}^{t/h-1}s_{t-kh}\delta_{kh^-} \leq \tfrac12 \int_0^t s_{t-r}(|w_{\lfloor r\rfloor_h}|_{\ell^2}^2 + \beta h^2 \varphi_{\lfloor r \rfloor_h}){\rm d}r\,.\] The bound 46 on \(\varepsilon_r\) still applies, so combining with \(\alpha a_{\lfloor r \rfloor_h} \leq \varphi_{\lfloor r \rfloor_h}\), \[\label{eqn-same-initial-pos-at-intermediate-bound} \begin{align} a_t & \leq \int_0^t s_{t-r}(-2+C_1 +5\beta h^2 + C_1^2\alpha h^2 + \tfrac12 C_1\alpha \beta h^4)\varphi_{\lfloor r \rfloor_h}{\rm d}r\\ & \quad + \int_0^t s_{t-r} (\tfrac{19}{2}+2C_1\alpha h^2)|w_{\lfloor r\rfloor_h}|_{\ell^2}^2 {\rm d}r\,. \end{align}\tag{53}\] For \(w_{\lfloor r \rfloor_h}\), repeating the derivation of 49 but with general \(w_0\), for any \(C_2 > 0\), \[\begin{align} |w_{\lfloor t \rfloor_h}|_{\ell^2}^2 &= \left| w_0 - \tfrac12 \int_0^{\lfloor t\rfloor_h}(\Phi_{\lfloor s\rfloor_h} + \Phi_{\lceil s\rceil_h}) {\rm d} s\right|_{\ell^2}^2\\ &\leq (1+C_2)|w_0|_{\ell^2}^2 + (1+\tfrac{1}{C_2}) \tfrac12\beta \lfloor t \rfloor_h \left(\int_0^{\lfloor t\rfloor_h} \varphi_{\lfloor \tau\rfloor_h} + \varphi_{\lceil \tau \rceil_h}{\rm d} \tau \right)\,. \end{align}\] With the derivation of 51 , this bounds 53 by \[\begin{align} a_t & \leq \int_0^t s_{t-r}\left[-2 + C_1 + 5\beta h^2 + C_1^2\beta h^2+ \tfrac12 C_1 \beta^2 h^4 \right.\\ &\qquad\left.+ (1 + \tfrac{1}{C_2})(\tfrac{19}{4}+C_1\beta h^2)\beta t^2 \right]\varphi_{\lfloor r \rfloor_h}{\rm d}r + (\tfrac{19}{2}+2C_1\alpha h^2)(1+C_2)\int_0^t s_{t-r}|w_0|_{\ell^2}^2 {\rm d}r\,. \end{align}\] With \(C_1 = 4/9\), \(\beta t^2 \leq 1/20\), and \(C_2 = 1/4\), the coefficient of \(\varphi_{\lfloor r \rfloor_h}\) is negative. Since \(\alpha h^2 \leq \beta t^2\) gives \(\tfrac{19}{2} + 2C_1\alpha h^2 \leq 10\), for \(t/h \in \mathbb{Z}^+\), \[a_t \leq 16 |w_0|_{\ell^2}^2 \int_0^t s_{t-r} {\rm d}r = \frac{16(1 - \cos(\sqrt{C_1\alpha}t))}{C_1\alpha} |w_0|_{\ell^2}^2 \leq 8t^2|w_0|_{\ell^2}^2\leq \frac{2}{5\beta}|w_0|_{\ell^2}^2\,,\] using \(\cos t\geq 1-\tfrac12t^2\). By 41 , \[|h\tilde{U}_{k-1}^1|_{\ell^2} \leq \sqrt{\frac{2}{5\beta}}\,.\] ◻

Proof of Proposition 9. This follows from Proposition 20, since the integrated Hessian satisfies \(\alpha I \preceq H_i \preceq \beta I\) by Assumption 1. ◻

9.2 \(\ell^\infty\) bounds under weak interactions↩︎

Proof of Proposition 11. Following the decomposition of \(\nabla^2 V\) in Assumption 2, set \[H_i^{(D)} \mathrel{\vcenter{:}}= \int \nabla^2 V^{(D)} {\rm d} \nu_i\,,\qquad H_i^{(O)} \mathrel{\vcenter{:}}= \int \nabla^2 V^{(O)} {\rm d} \nu_i\,,\] so that \(H_i = H_i^{(D)}+H_i^{(O)}\). We begin with \(|\tilde{T}_k^1|_{\ell^\infty}\), which we split into a diagonal contribution and a perturbation. By the sign structure of the coefficients in Lemma 1, \[\label{eqn-propagator-infty-norm-decomp-hmc-weak} \begin{align} |\tilde{T}_k^1|_{\ell^\infty} &\leq \underbrace{|\tilde{T}_k^1(\{I - \tfrac{h^2}{2}H_i^{(D)}\}_{i=0}^{k-1})|_{\ell^\infty}}_{(a)}\\ &\quad +\underbrace{\sum_{j=1}^kh^{2j}\sum_{k-1 \geq i_1 > \dots > i_j \geq 0} \tilde{t}_{i_1,\dots,i_j}^{(k)} |H_{i_1}\cdots H_{i_j} - H_{i_1}^{(D)}\cdots H_{i_j}^{(D)}|_{\ell^\infty}}_{(b)}\,. \end{align}\tag{54}\] The matrix in \((a)\) is diagonal, so its \(\ell^\infty\) norm equals its \(\ell^2\) norm. The \(\ell^2\) bound of Proposition 9 gives \[(a) = |\tilde{T}_k^1(\{I - \tfrac{h^2}{2}H_i^{(D)}\}_{i=0}^{k-1})|_{\ell^2} \leq 1 - {\frac{\alpha}{10}(kh)^2}\,.\] For \((b)\), expanding \(H_{i_1}\cdots H_{i_j} = (H_{i_1}^{(D)}+H_{i_1}^{(O)}) \cdots (H_{i_j}^{(D)}+H_{i_j}^{(O)})\) and bounding each term yield \[\begin{align} |H_{i_1} \cdots H_{i_j} - H_{i_1}^{(D)}\cdots H_{i_j}^{(D)}|_{\ell^\infty} & \leq \sum_{l = 1}^j \binom{j}{l}(\sup_k |H_k^{(D)}|_{\ell^\infty})^{j-l}(\sup_k |H_k^{(O)}|_{\ell^\infty})^l\\ & \leq (\beta + \tfrac{\alpha}{50})^j - \beta^j\,, \end{align}\] so that \[\label{eqn-bound-b-combine-binomials} \begin{align} (b) &\leq \sum_{j=0}^k h^{2j} \sum_{k-1 \geq i_1 > \ldots > i_j \geq 0} \tilde{t}_{i_1, \ldots, i_j}^{(k)}\Big((\beta + \tfrac{\alpha}{50})^j - \beta^j\Big)\\ &= \sum_{j=0}^k h^{2j} t_j^{(k)} \Big((\beta + \tfrac{\alpha}{50})^j - \beta^j\Big) = T_k(1 + \tfrac{h^2}{2}(\beta + \tfrac{\alpha}{50})) - T_k(1 + \tfrac{h^2}{2} \beta)\,, \end{align}\tag{55}\] using that the \(t_j^{(k)}\) are the coefficients of \(T_k(1+\tfrac{1}{2}x) = \sum_{j=0}^k t_j^{(k)}x^j\), by 37 . Combining the estimates, \[\label{eqn-propagator-infty-norm-decomp-intermediate} |\tilde{T}_k^1|_{\ell^\infty} \leq 1 - {\frac{\alpha}{10}(kh)^2} + T_k(1 + \tfrac{h^2}{2} (\beta + \tfrac{\alpha}{50})) - T_k(1 + \tfrac{h^2}{2}\beta)\,.\tag{56}\] It remains to show the perturbation in \(T_k\) is controlled, so the contraction factor stays of the same order. For \(x\geq 1\), \(T_k(x)= \cosh(k\log(x + \sqrt{x^2 - 1}))\), with \[\frac{{\rm d}}{{\rm d}x} T_k(x) = \sinh(k\log(x + \sqrt{x^2 - 1})) \frac{k}{\sqrt{x^2 - 1}}\,.\] Substituting \(x = 1 + \tfrac{h^2}{2}z\) with \(z > 0\), \[\left|\frac{{\rm d}}{{\rm d} x} T_k(x)\right|\Big|_{x = 1+ \frac{h^2}{2}z} \leq \tfrac12\left(1 + \tfrac{h^2}{2}z + h \sqrt{z}\sqrt{1 + \tfrac{h^2z}{4}}\right)^k \frac{k}{h\sqrt{z}}\,,\] so by the mean value theorem, for \(z \in [\beta, \beta + \tfrac{\alpha}{50}]\), \[\label{eqn-difference-Tk-bound} \begin{align} &\left|T_k\left(1 + \tfrac{h^2}{2}\left(\beta + \tfrac{\alpha}{50}\right)\right) - T_k\left(1 + \tfrac{h^2}{2}\beta\right)\right|\leq \frac{h^2\alpha}{100} \sup_{\substack{x = 1 + \frac{h^2}{2}z,\\ z \in [\beta,\beta + \frac{\alpha}{50}]}} \left|\frac{\mathrm{d}}{\mathrm{d}x} T_k(x)\right|\\ \leq & \frac{kh\alpha}{200\sqrt{\beta}} \exp\left( kh\Big(\tfrac{51}{100}h\beta + \sqrt{\tfrac{51}{50}\beta}\sqrt{1 + \tfrac{51}{200}h^2\beta}\Big)\right)\leq {\frac{kh\alpha}{100\sqrt{\beta}}}\,, \end{align}\tag{57}\] where the last step uses \(h \leq kh \leq 1/\sqrt{20\beta}\). Substituting into 56 , \[|\tilde{T}_k^1|_{\ell^\infty} \leq 1 - {\frac{\alpha}{10}(kh)^2 + \frac{kh\alpha}{100\sqrt{\beta}}}\,.\] This remains a contraction as in the \(\ell^2\) norm for large enough \(kh\). Plugging in \(kh = \frac{1}{\sqrt{20\beta}}\) gives the upper bound \(1 - \frac{\alpha}{400\beta}\).

An analogous argument bounds \(h \tilde{U}_{k-1}^1\). Lemma 1 gives \[\label{eqn-weak-interaction-Bk-infty-norm-decomp} \begin{align} |h \tilde{U}_{k-1}^1|_{\ell^\infty} &\leq \underbrace{|h \tilde{U}_{k-1}^1(\{I - \tfrac{h^2}{2}H_i^{(D)}\}_{i=1}^{k-1})|_{\ell^\infty}}_{(a)}\\ &\quad + \underbrace{\sum_{j=1}^{k-1}h^{2j+1}\sum_{k-1\geq i_1 >\ldots >i_j \geq 1} \tilde{u}_{i_1,\ldots,i_j}^{(k)}|H_{i_1}\cdots H_{i_j} - H_{i_1}^{(D)}\cdots H_{i_j}^{(D)}|_{\ell^\infty}}_{(b)}\,, \end{align}\tag{58}\] where, as before, \((a) = |h \tilde{U}_{k-1}^1(\{I-\tfrac{h^2}{2}H_i^{(D)}\}_{i=1}^{k-1})|_{\ell^2} \leq \sqrt{\tfrac{2}{5\beta}}\) by Proposition 9, and \[\begin{align} (b) &\leq \sum_{j=0}^{k-1} h^{2j+1}\sum_{k-1\geq i_1 > \ldots > i_j \geq 1}\tilde{u}_{i_1,\ldots, i_j}^{(k)}\Big((\beta + \tfrac{\alpha}{50})^j - \beta^j \Big)\\ & = h U_{k-1}(1 + \tfrac{h^2}{2}(\beta + \tfrac{\alpha}{50})) - h U_{k-1}(1 + \tfrac{h^2}{2}\beta)\leq h U_{k-1}(1 + \tfrac{h^2}{2}(\beta + \tfrac\alpha{50}))\,, \end{align}\] since \(U_{k-1}(x) \geq 0\) for \(x \geq 1\). Using \(U_{k-1}(x) = \sinh(k\log(x+\sqrt{x^2-1}))/\sqrt{x^2-1}\) for \(x \geq 1\), \[\label{eqn-Chebyshev-U-b-bound} (b) \leq \frac{1}{2\sqrt\beta}\exp\left( kh\Big(\tfrac{51}{100}h\beta + \sqrt{\tfrac{51}{50}\beta}\sqrt{1 + \tfrac{51}{200}h^2\beta}\Big)\right)\leq \frac{13}{20\sqrt\beta}\,.\tag{59}\] Combining these in 58 , \[|h\tilde{U}_{k-1}^1|_{\ell^\infty} \leq \frac{3}{2\sqrt{\beta}}\,.\] ◻

9.3 \(\ell^\infty\) bounds under sparse interactions↩︎

Here we use the sparsity of the Hessians to bound the propagators in \(\ell^\infty\). The next lemma, adapted from Proposition C.1 of [5], shows that the integrated Hessian products inherit a sparsity property from Assumption 3. We include the proof for completeness.

Lemma 2. Suppose \(V\) satisfies Assumption 3, and let \(\nu_1, \dots, \nu_r\) be probability measures on \(\mathbb{R}^d\). Then the product \[\left(\int \nabla^2 V {\rm d} \nu_1\right)\left(\int \nabla^2 V {\rm d} \nu_2\right) \cdots \left(\int \nabla^2 V {\rm d} \nu_r\right)\] is \(s_r\)-sparse. More precisely, its \((i,j)\) entry is nonzero only if \(j \in \mathsf{N}_{2r}(i)\).

Proof of Lemma 2. The \((i,j)\) entry of the product is nonzero only if \(j \in \mathsf{N}_r(i)\), or if \(i \in \mathsf{N}_r(k)\) and \(j \in \mathsf{N}_r(k)\) for some \(k\). Since \(\max_{1\leq i \leq d} |\mathsf{N}_{2r}(i)| = s_r\), each row has at most \(s_r\) nonzero entries, so the matrix is \(s_r\)-sparse. ◻

We now prove an extended version of Proposition 13.

Proposition 21 (Extended version of Proposition 13). Suppose Assumptions 1 and 3 hold, and let the integrated Hessians \(H_i\) be as in Proposition 9. Take \(r_i = \lceil ih\sqrt{\beta} e + \frac{\log\sqrt{d}}{\log(5/3)}\rceil\), and let \(mh \leq 1/\sqrt{20\beta}\) with integers \(N \geq 0\) and \(k < m\). Define \[A_{Nm + k} \mathrel{\vcenter{:}}= \Big(\prod_{j \in\{k+im\}_{i=0}^{N-1}}^{\longleftarrow}\tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_{j+l} \}_{l=0}^{m-1})\Big)\tilde{T}_k^1\,,\] \[B_{Nm+k-1} \mathrel{\vcenter{:}}= \Big(\prod_{j \in\{k+im\}_{i=0}^{N-1}}^{\longleftarrow}\tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_{j+l} \}_{l=0}^{m-1})\Big)h\tilde{U}_{k-1}^1\,,\] with the product read as the identity when \(N=0\). Then \[\label{eqn-prop-linf-bounds-ANmkBNmk} |A_{Nm+k}|_{\ell^\infty} \leq 4 \sqrt{s_{r_{Nm+k}}}\,, \qquad |B_{Nm+k-1}|_{\ell^\infty} \leq \frac{4}{\sqrt\beta} \sqrt{s_{r_{Nm+k}}}\,.\qquad{(20)}\] Moreover, for arbitrary probability measures \(\nu_0, \nu_0'\) and \(H \mathrel{\vcenter{:}}= \int \nabla^2 V {\rm d} \nu_0\), \(H' \mathrel{\vcenter{:}}= \int \nabla^2 V {\rm d} \nu_0'\), \[\begin{align} &|A_{Nm+k}H|_{\ell^\infty} \leq 4\beta \sqrt{s_{r_{Nm+k}}}\,,\\ &|B_{Nm+k-1}H|_{\ell^\infty} \leq 4\sqrt\beta \sqrt{s_{r_{Nm+k}}}\,, \qquad |B_{Nm+k-1}HH'|_{\ell^\infty} \leq 5\beta^{\frac{3}{2}} \sqrt{s_{r_{Nm+k}}}\,. \end{align}\]

Proof of Proposition 21. The bounds follow a common framework, so we give the details for \(A_{Nm+k}\). The strategy is to split the matrix expansion by order in \(h\) at a threshold \(r\) that balances sparsity against magnitude, as for a tridiagonal matrix, low-order powers stay sparse (so their \(\ell^\infty\) and \(\ell^2\) norms are comparable), while the growing density of higher-order powers is offset by the decay in \(h^{2j}\). The sparsity here is controlled by \(s_r\).

For any threshold \(r\), Lemma 2 gives that the entries of each order-\(r\) product are supported on \(\mathsf{N}_{2r}(i)\), and the absolute row sum decomposes as \[\label{eqn-inf-bound-two-parts-a} \begin{align} \sum_{j=1}^d|(A_{Nm+k})_{ij}| = & \sum_{j\in \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}| + \sum_{j\notin \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}|\\ \leq &\sqrt{|\mathsf{N}_{2r}(i)|}\sqrt{\sum_{j\in\mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}|^2} + \sum_{j \notin \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}|\\ \leq & \sqrt{s_{r}}|A_{Nm+k}|_{\ell^2} + \sum_{j \notin \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}|\,. \end{align}\tag{60}\] By Proposition 19, \[\label{eqn-decomp-neighbor-matrix-A} \begin{align} A_{Nm+k} &= a_0^{(Nm+k)} I + \sum_{j=1}^{r} (-1)^jh^{2j}\sum_{i_1>\dots >i_j}a_{i_1,\dots,i_j}^{(Nm+k)} H_{i_1}\cdots H_{i_j}\\ & \quad + \sum_{j=r+1}^{Nm+k}(-1)^jh^{2j}\sum_{i_1>\dots>i_j}a_{i_1,\dots,i_j}^{(Nm+k)}H_{i_1}\cdots H_{i_j}\,. \end{align}\tag{61}\] For \(j \notin \mathsf{N}_{2r}(i)\), the entry \((A_{Nm+k})_{ij}\) can only come from the second line, so \[\label{eqn-far-neighbor-elements-bound} \sum_{j \notin \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}| \leq \Big|\sum_{j=r+1}^{Nm+k}(-1)^j h^{2j}\sum_{i_1,\dots,i_j} a_{i_1,\dots,i_j}^{(Nm+k)}H_{i_1}\dots H_{i_j}\Big|_{\ell^\infty}\,.\tag{62}\] We control this \(\ell^\infty\) norm through the \(\ell^2\) norm, \[\label{eqn-tail-matrices} \Big|\sum_{j=r+1}^{Nm+k}(-1)^j h^{2j}\sum_{i_1,\dots,i_j} a_{i_1,\dots,i_j}^{(Nm+k)}H_{i_1}\dots H_{i_j}\Big|_{\ell^2} \leq \sum_{j=r+1}^{Nm+k}h^{2j}\beta^j a_j^{(Nm+k)}\,.\tag{63}\] By Proposition 19, \(a_j^{(Nm+k)}\) is bounded by \(\max_{j\leq i\leq Nm+k} t_j^{(i)}\), the Chebyshev coefficients whose explicit formulas are given in Proposition 17. It therefore suffices to bound \(h^{2j}\beta^j t_j^{(i)}\). For \(i > 0\), \[\begin{align} t_j^{(i)} &= i\frac{(i+j-1)!}{(i-j)!(2j)!} = \frac{i(i+j-1) \cdots (i+1)}{(2j)\cdots(j+1)} \frac{i(i-1)\cdots(i-j+1)}{j!}\\ & \leq \frac{(i+j)^j}{j^j} \frac{i^j}{j!} \leq \frac{(i+j)^j (ie)^j}{j^{2j}} = \left(e\left(\tfrac{i^2}{j^2}+\tfrac{i}{j} \right) \right)^j\,, \end{align}\] using \(j! \geq j^j/\exp(j)\) (from \(\exp(j) \geq j^j/j!\)). Hence for \(j \geq (Nm+k)\sqrt{\beta}eh\) and \(i \leq Nm+k\), \[h^{2j}\beta^j t_j^{(i)}\leq \left( h^2\beta e\left(\tfrac{i^2}{j^2}+\tfrac{i}{j} \right) \right)^j \leq \left(e^{-1} + \sqrt\beta h\right)^j \leq \left(\tfrac{3}{5}\right)^j\,,\] where we use \(h \leq mh \leq 1/\sqrt{20\beta}\). Since this holds uniformly over \(i \leq Nm+k\), Proposition 19 gives \(h^{2j} \beta^j a_j^{(Nm+k)} \leq \left(\tfrac35\right)^j\), so 63 yields \[\Big|\sum_{j=r+1}^{Nm+k}(-1)^j h^{2j}\sum_{i_1,\dots,i_j} a_{i_1,\dots,i_j}^{(Nm+k)}H_{i_1}\dots H_{i_j}\Big|_{\ell^2} \leq \sum_{j=r+1}^{Nm+k}\left(\tfrac35\right)^j \leq {3} \left(\tfrac35\right)^{r+1}\,.\] Applying the norm inequality \(|M|_{\ell^\infty} \leq \sqrt{d}\,|M|_{\ell^2}\), valid for any matrix \(M \in \mathbb{R}^{d\times d}\), to 62 , \[\sum_{j \notin \mathsf{N}_{2r}(i)}|(A_{Nm+k})_{ij}| \leq {3}\sqrt{d}\left( \tfrac35\right)^{r+1}\,.\] Substituting into 60 with \(|A_{Nm+k}|_{\ell^2} \leq 1\) (Proposition 9) and taking \(r_{Nm+k} = \lceil (Nm+k)h\sqrt\beta e + \tfrac{\log \sqrt d}{\log (5/3)} \rceil\), \[|A_{Nm+k}|_{\ell^\infty} \leq \sqrt{s_{r_{Nm+k}}} + {3} \left( \tfrac35\right)^{(Nm+k)h\sqrt\beta e}\,,\] which gives the first bound in ?? since \(s_{r_{Nm+k}} \geq 1\).

For \(A_{Nm+k}H\) the decomposition is the same as 60 with \(H\) appended, giving \(|A_{Nm+k}H|_{\ell^2} \leq \beta |A_{Nm+k}|_{\ell^2}\) and \[\Big|\sum_{j=r}^{Nm+k}(-1)^jh^{2j}\sum_{i_1>\dots>i_j}a_{i_1,\dots,i_j}^{(Nm+k)}H_{i_1}\cdots H_{i_j} H\Big|_{\ell^2} \leq \beta \sum_{j=r}^{Nm+k}\left(\tfrac35\right)^j \leq {3}\beta\left( \tfrac{3}{5}\right)^r\,,\] so taking \(r_{Nm+k}\) as before, \[|A_{Nm+k} H|_{\ell^\infty} \leq \beta \sqrt{s_{r_{Nm+k}}} + {3}\beta\left(\tfrac35\right)^{(Nm+k)h\sqrt\beta e} \leq 4\beta \sqrt{s_{r_{Nm+k}}}\,.\]

For \(B_{Nm+k-1}\), the same decomposition gives, for any \(r\), \[\label{eqn-inf-bound-two-parts-b} \sum_{j=1}^d|(B_{Nm+k-1})_{ij}| \leq \sqrt{s_r}|B_{Nm+k-1}|_{\ell^2} + \sqrt{d}\sum_{j=r+1}^{Nm+k-1}h^{2j+1}\beta^jb_j^{(Nm+k-1)}\,.\tag{64}\] The difference from \(A_{Nm+k}\) is that \(b_j^{(Nm+k-1)}\) depends on \(u_j^{(i)}\). By Proposition 17, \[u_j^{(i)} = \frac{(i+j+1)!}{(i-j)!(2j+1)!} \leq \frac{(i+j+1)^j}{j^j}\frac{(i+1)^{j+1}e^{j+1}}{j^{j+1}}\,,\] so by Proposition 19, for \(j \geq (Nm+k)\sqrt\beta eh\) and \(i \leq Nm+k-1\), \[h^{2j+1}\beta^jb_j^{(Nm+k-1)} \leq \frac{1}{\sqrt\beta}\left(h\sqrt\beta\left(\tfrac{i+1}{j}+1\right) \right)^j\left(\tfrac{h\sqrt\beta(i+1)e}{j}\right)^{j+1} \leq \frac{1}{\sqrt\beta}\left(\tfrac35\right)^j\,,\] and hence \[\sqrt{d}\sum_{j=r+1}^{Nm+k-1}h^{2j+1}\beta^jb_j^{(Nm+k-1)} \leq \frac{{3}\sqrt{d}}{\sqrt{\beta}}\left(\tfrac35\right)^{r+1}\,.\] Taking \(r = r_{Nm+k}\) and using \(|B_{Nm+k-1}|_{\ell^2} \leq \sqrt{\tfrac{2}{5\beta}}\) (Proposition 9), 64 gives \[|B_{Nm+k-1}|_{\ell^\infty} \leq \sqrt{\tfrac{2}{5\beta}}\sqrt{s_{r_{Nm+k}}}+ \frac{{3}}{\sqrt\beta}\left(\tfrac35\right)^{(Nm+k)h\sqrt\beta e} \leq \frac{4}{\sqrt\beta} \sqrt{s_{r_{Nm+k}}}\,.\] The bounds for \(B_{Nm+k-1}H\) and \(B_{Nm+k-1}HH'\) follow from similar decompositions: \[|B_{Nm+k-1}H|_{\ell^\infty} \leq \sqrt{\tfrac{2\beta}{5}}\sqrt{s_{r_{Nm+k}}} + {3}\sqrt\beta \left(\tfrac35\right)^{(Nm+k)h\sqrt\beta e} \leq 4 \sqrt\beta\sqrt{s_{r_{Nm+k}}}\,,\] \[|B_{Nm+k-1}H H'|_{\ell^\infty} \leq \sqrt{\tfrac{2\beta^3}{5}}\sqrt{s_{r_{Nm+k}}} + \frac{25}{6} \beta^{\frac{3}{2}}\left(\tfrac{3}{5} \right)^{(Nm+k)\sqrt\beta eh} \leq 5\beta^{\frac{3}{2}}\sqrt{s_{r_{Nm+k}}}\,.\] ◻

10 Bounds for BAOAB Propagators↩︎

In this section we bound the BAOAB propagators. The key difference from the leap-frog case is that we work with weighted \(\ell^2\) and \(\ell^\infty\) norms, defined through the weight matrix in 15 , which is what makes the propagators contractive.

10.1 \(\ell^2\) bounds↩︎

The \(\ell^2\) bounds rest on the BAOAB contraction result, Theorem 5.1 of [29].

Lemma 3 (Theorem 5.1 in [29]). Let Assumption 1 hold. If \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\), then for any initial states \((x_0, p_0), (y_0, p'_0) \in \mathbb{R}^{2d}\) and any standard normal sequence \(\{\xi_i\}_{i=0}^{k-1}\), the BAOAB chains driven by the same noise, \[(x_k, p_k) = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0}(x_0, p_0)\,, \quad (y_k, p_k') = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0}(y_0, p_0')\,,\] satisfy almost surely \[|(x_k - y_k, p_k - p'_k)|_{\ell^2_w} \leq 7 (1-c(h))^{\frac{k-1}{2}}|(x_0 - y_0, p_0 - p'_0)|_{\ell^2_w}\,,\] with \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\).

As for HMC, we prove a general-matrix version, Proposition 22 below, by reading the polynomials with general \(\{H_i\}\) as BAOAB propagators with varying quadratic potentials and turning the contraction of Lemma 3 into operator-norm bounds.

Proposition 22 (\(\ell^2\) bounds for BAOAB, general matrices). Let \(\{H_i\}\) be symmetric positive definite with \(\alpha I \preceq H_i \preceq \beta I\) for \(\alpha, \beta\) as in Assumption 1. For \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\) and \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\), the polynomials \(\tilde{T}_k^\eta\) and \(\tilde{U}_{k-1}^\eta\) defined with \(\{H_i\}\), and the full-space weighted propagator \(M_{\text{\normalfont\scshape baoab}, k}^w\), satisfy \[\label{eqn-prop-l2bounds-baoab-fullspace-general} |M_{\text{\normalfont\scshape baoab},k}^w|_{\ell^2} \leq 7 (1-c(h))^{\frac{k-1}{2}}\,,\qquad{(21)}\] \[\label{eqn-prop-l2bounds-baoab-11block-general} |\tilde{T}_k^\eta|_{\ell^2} \leq 7 \sqrt{2} (1 - c(h))^{\frac{k-1}{2}}\,, \quad \frac{1}{\sqrt{a-b^2}}\left|-b \tilde{T}_k^\eta + h \tilde{U}_{k-1}^\eta\right|_{\ell^2} \leq 7\sqrt{2}\left( 1 - c(h)\right)^{\frac{k-1}{2}}\,.\qquad{(22)}\]

Proof of Proposition 22. Consider the time-inhomogeneous linear dynamics driven by \(\{H_i\}\), \[\label{eqn-baoab-linear} \begin{align} q_{k+1} &= q_k + \tfrac{h}{2}(1+\eta)p_k - \tfrac{h^2}{4}(1+\eta)H_k q_k+ \tfrac{h}{2}\sqrt{1-\eta^2}\xi_{k}\,,\\ p_{k+1} &= \eta(p_k - \tfrac{h}{2}H_kq_k) + \sqrt{1-\eta^2}\xi_{k}-\tfrac{h}{2}H_{k+1}q_{k+1}\,, \end{align}\tag{65}\] which is the BAOAB scheme 4 with the varying potential \(V_k(q) = \tfrac12q^\top H_k q\) at step \(k\). For two trajectories coupled through the same noise \(\{\xi_i\}\), the differences \(\Delta q_k, \Delta p_k\) obey \[\label{eqn-leap-frog-varying-potential} \begin{align} \Delta q_{k+1} &= (I - \tfrac{h^2}{4}(1+\eta)H_k) \Delta q_k + \tfrac{h}{2}(1+\eta)\Delta p_k\,,\\ \Delta p_{k+1} &= \eta(\Delta p_k - \tfrac{h}{2}H_k\Delta q_k) -\tfrac{h}{2}H_{k+1}\Delta q_{k+1}\,. \end{align}\tag{66}\] These yield the same three-term recurrence \(\Delta q_{k+1} = (1+\eta)(I - \tfrac{h^2}{2}H_k)\Delta q_k - \eta \Delta q_{k-1}\) as in the proof of Proposition 8, so the same induction gives \[\label{eqn-q-on-initial-q0-p0-baoab-linear} \Delta q_{k} = \tilde{T}_{k}^\eta \Delta q_0 + h\tilde{U}_{k-1}^\eta \Delta p_0\,,\tag{67}\] identifying \(\tilde{T}_k^\eta\) and \(h\tilde{U}_{k-1}^\eta\) as the position-difference propagators of 65 .

Although Lemma 3 is stated for a fixed potential, its proof uses only the spectral bounds \(\alpha I \preceq H_i \preceq \beta I\). [29] employs the decomposition \[\label{eqn-baoab-decomposition-abao} (\mathsf{B}\mathsf{A}\mathsf{O}\mathsf{A}\mathsf{B})^k = \mathsf{B}\mathsf{A}\mathsf{O}(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O})^{k-1}\mathsf{A}\mathsf{B}\tag{68}\] and shows that the core operator \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) is a weighted \(\ell^2\) contraction (giving the \((1-c(h))\) factors) while the boundary terms \(\mathsf{B}\mathsf{A}\mathsf{O}\) and \(\mathsf{A}\mathsf{B}\) stay bounded, all under those eigenvalue bounds. Since each \(H_i\) satisfies them, the result carries over to the varying-potential case, giving under 65 \[\label{eqn-baoab-weighted-2-norm-varying-potential} |(\Delta q_k, \Delta p_k)|_{\ell^2_w} \leq 7(1-c(h))^{\frac{k-1}{2}}|(\Delta q_0, \Delta p_0)|_{\ell^2_w}\,.\tag{69}\]

We now derive the operator-norm bounds. Since \(M_{\text{\normalfont\scshape baoab},k}^w = W M_{\text{\normalfont\scshape baoab},k} W^{-1}\) maps \(W(\Delta q_0, \Delta p_0)\) to \(W(\Delta q_k, \Delta p_k)\), 69 is precisely ?? . For the position blocks, the norm equivalence 16 gives \[|\Delta q_k|_{\ell^2} \leq \sqrt{|\Delta q_k|_{\ell^2}^2 + a |\Delta p_k|_{\ell^2}^2} \leq \sqrt{2}|(\Delta q_k, \Delta p_k)|_{\ell^2_w}\,,\] so \[\label{eqn-useful-cor-baoab-pre-bound} |\Delta q_k|_{\ell^2} \leq 7\sqrt{2}(1- c(h))^{\frac{k-1}{2}}|W(\Delta q_0, \Delta p_0)|_{\ell^2}\,.\tag{70}\] Writing 67 as \(\Delta q_k = \begin{bmatrix} \tilde{T}_{k}^\eta & h\tilde{U}_{k-1}^\eta \end{bmatrix} W^{-1}\, W(\Delta q_0, \Delta p_0)\), the bound 70 gives \[\left|\begin{bmatrix} \tilde{T}_{k}^\eta & h\tilde{U}_{k-1}^\eta \end{bmatrix} W^{-1} \right|_{\ell^2} \leq 7\sqrt{2}(1-c(h))^{\frac{k-1}{2}}\,,\] and since \[\begin{bmatrix} \tilde{T}_k^\eta & h \tilde{U}_{k-1}^\eta \end{bmatrix} W^{-1} = \begin{bmatrix} \tilde{T}_k^\eta & - \frac{b}{\sqrt{a-b^2}} \tilde{T}_k^\eta + \frac{1}{\sqrt{a-b^2}}h\tilde{U}_{k-1}^\eta \end{bmatrix}\,,\] the block-wise bounds ?? follow. ◻

We extract a corollary in \(\ell^\infty\) norms from this proof.

Corollary 1. Under the assumptions and notation of Proposition 22, any state difference \((\Delta q_k, \Delta p_k)\) under the varying-potential scheme 66 satisfies \[\label{eqn-useful-cor-baoab-weighted-infty-bound} |(\Delta q_k, \Delta p_k)|_{\ell^\infty_w} \leq 7\sqrt{2d}(1-c(h))^{\frac{k-1}{2}}|(\Delta q_0, \Delta p_0)|_{\ell^\infty_w}\,,\tag{71}\] \[\label{eqn-useful-cor-baoab-infty-bound} |\Delta q_k|_{\ell^\infty} \leq 14\sqrt{d}(1-c(h))^{\frac{k-1}{2}}|(\Delta q_0, \Delta p_0)|_{\ell^\infty_w}\,.\tag{72}\]

Proof of Corollary 1. Inequality 71 follows from 69 and the matrix norm equivalence \(|M|_{\ell^\infty} \leq \sqrt{2d}|M|_{\ell^2}\) for \(M \in \mathbb{R}^{2d \times 2d}\). For 7270 gives \[|\Delta q_k|_{\ell^\infty} \leq |\Delta q_k|_{\ell^2} \leq 7\sqrt{2}(1-c(h))^{\frac{k-1}{2}}|(\Delta q_0, \Delta p_0)|_{\ell^2_w} \leq 14\sqrt{d}(1-c(h))^{\frac{k-1}{2}}|(\Delta q_0, \Delta p_0)|_{\ell^\infty_w}\,.\] ◻

Proof of Proposition 10. This follows from Proposition 22, since the integrated Hessians satisfy the assumption. ◻

10.2 \(\ell^\infty\) bounds under weak interactions↩︎

We bound the BAOAB propagators in \(\ell^\infty\) following [29], decomposing the scheme into the operators \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\), \(\mathsf{B}\mathsf{A}\mathsf{O}\), and \(\mathsf{A}\mathsf{B}\) as in 68 , where \(\mathsf{A}\mathsf{B}\mathsf{A}\mathsf{O}\) drives the contraction and the boundary terms \(\mathsf{B}\mathsf{A}\mathsf{O}\), \(\mathsf{A}\mathsf{B}\) stay bounded. The contraction remains under the weak interactions.

Unlike HMC, a diagonal Hessian does not give a diagonal propagator here. On the joint \((q,p)\) space the propagator is a \(2\times2\) block matrix with diagonal blocks. The crude inequality \(|M|_{\ell^\infty} \leq \sqrt{2}|M|_{\ell^2}\) (from the two nonzero entries per row) would not preserve the \(\ell^2\) contraction, so we bound each block in \(\ell^\infty\) directly, using the \(\ell^2\) bounds as a guide to the contraction rate.

Proof of Proposition 12. Estimate for \(M_{\text{\normalfont\scshape abao}}^w\). The matrix is \[M_{\text{\normalfont\scshape abao}}^w(H_0) = \begin{bmatrix} I - \tfrac12 h^2 H_0 - \tfrac{\eta}{1-\eta}h^2 H_0 & h^3\tfrac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{a-b^2}}H_0\\ - \eta h \sqrt{a-b^2}H_0 & \eta (I + (-\tfrac12 + \tfrac{1}{1-\eta})h^2H_0) \end{bmatrix}\,.\] For the second block of rows, the \(\ell^1\) norm of each row is at most \[\label{eqn-abao-row-2-bound} \eta h \sqrt{a-b^2} \cdot \tfrac{21}{20}\beta + \eta (1 + (-\tfrac12 + \tfrac{1}{1-\eta}) h^2 \cdot \tfrac{21}{20}\beta)\,.\tag{73}\] This increases in \(\eta \in [0,1]\), while the target bound \(1 - \frac{h^2\alpha}{8(1-\eta)}\) decreases in \(\eta\). Comparing them at the largest admissible value \(\eta = 1-2\sqrt\beta h\) confirms the target bound for the second block.

For the first block of rows, split off the diagonal and off-diagonal parts \(H_0^{(D)}, H_0^{(O)}\) (defined as in the proof of Proposition 11): \[\begin{align} &\begin{bmatrix} I - \tfrac12 h^2 H_0^{(D)} - \tfrac{\eta}{1-\eta}h^2 H_0^{(D)} & h^3\tfrac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{a-b^2}} H_0^{(D)} \end{bmatrix}\\ & \quad + \begin{bmatrix} - \tfrac12 h^2 H_0^{(O)} - \tfrac{\eta}{1-\eta}h^2 H_0^{(O)} & h^3\tfrac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{a-b^2}} H_0^{(O)} \end{bmatrix}\,. \end{align}\] In the first matrix, \(H_0^{(D)}\) is diagonal, so each row reduces to a scalar \(\lambda \in [\alpha, \beta]\). Since \(\tfrac12 h^2\beta + \tfrac{\eta}{1-\eta}h^2\beta\) increases in \(\eta\) and is below \(1\) at \(\eta = 1 - 2\sqrt{\beta} h\), it is below \(1\) throughout, and the \(\ell^1\) norm of the row is \[\label{eqn-abao-row-1-bound} 1 - \tfrac12 h^2\lambda - \tfrac{\eta}{1-\eta}h^2\lambda + h^3 \tfrac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{a-b^2}}\lambda\,.\tag{74}\] The condition \(h \leq \frac{1-\eta}{2\sqrt\beta}\) gives \(\sqrt{a-b^2} \geq \frac{\sqrt{3}}{2 \sqrt{\beta}}\), so the last term is at most \(\frac{1}{4\sqrt{3}}h^2 \lambda + \frac{1}{\sqrt{3}}\frac{\eta}{1-\eta}h^2 \lambda\), and 74 is bounded by \(1 - c(h)\). Adding the off-diagonal contribution, the \(\ell^\infty\) norm of the first block of rows is \[1 - c(h) + \left((\tfrac12 + \tfrac{\eta}{1-\eta})h^2 + h^3\tfrac{\frac{1}{4} + \frac{\eta}{(1-\eta)^2}}{\sqrt{a-b^2}}\right)| H_0^{(O)}|_{\ell^\infty} \leq 1 - \tfrac12c(h)\,.\]

Estimate for \(M_{\text{\normalfont\scshape bao}}^w\). By the scheme definition in 14 , \[M_{\text{\normalfont\scshape bao}}^w(H_0) = \begin{bmatrix} I - \tfrac{h^2}{4}H_0 - \tfrac{h^2\eta}{2(1-\eta)}H_0 & \tfrac{1}{\sqrt{a-b^2}}(-\tfrac{h}{2}I + \tfrac{h^3(1+\eta)}{4(1-\eta)^2}H_0)\\ - \tfrac{h}{2}\eta \sqrt{a-b^2}H_0 & \eta I + \tfrac{h^2\eta}{2(1-\eta)}H_0 \end{bmatrix}\,.\] We bound each \(2\times2\) block in \(\ell^\infty\). The \((1,1)\) block is bounded by \(1 + (\tfrac{h^2}{4} + \tfrac{h}{2} \cdot \tfrac{1}{2\sqrt\beta})\tfrac{21}{20}\beta \leq \tfrac{383}{320}\), the \((1,2)\) block by \(\frac{2\sqrt{\beta}}{\sqrt{3}}(\tfrac{h}{2} + \tfrac{h}{4}\cdot 2 \cdot \tfrac{1}{4\beta} \cdot \tfrac{21}{20}\beta) \leq \frac{101}{160\sqrt{3}}\), the \((2,1)\) block by \(\tfrac12 \tfrac{1}{\sqrt{\beta}} h \cdot \tfrac{21}{20}\beta \leq \tfrac{21}{80}\), and the \((2,2)\) block by \(\tfrac12 \cdot \tfrac{1}{2\sqrt\beta}h \cdot\tfrac{21}{20}\beta + 1 \leq \tfrac{181}{160}\). Summing the block bounds over each row gives the result.

Estimate for \(M_{\text{\normalfont\scshape ab}}^w\). By 14 , \[M_{\text{\normalfont\scshape ab}}^w(H_0) = \begin{bmatrix} I - \tfrac{h^2}{2(1-\eta)}H_0 & \tfrac{1}{\sqrt{a-b^2}}(\tfrac{h}{2}I + \tfrac{h^3(1+\eta)}{4(1-\eta)^2}H_0)\\ - \tfrac{h}{2}\sqrt{a-b^2}H_0 & I + (\tfrac{h^2}{2(1-\eta)}-\tfrac{h^2}{4})H_0 \end{bmatrix}\,.\] By the same block-wise bounding, the \((1,1)\) block is at most \(1 + \tfrac{h}{4\sqrt\beta}\tfrac{21}{20}\beta \leq \tfrac{181}{160}\), the \((1,2)\) block at most \(\frac{2\sqrt{\beta}}{\sqrt{3}}(\tfrac{h}{2}+\tfrac{h}{2}\tfrac{1}{4\beta}\tfrac{21}{20}\beta) \leq \frac{101}{160\sqrt{3}}\), the \((2,1)\) block at most \(\tfrac{h}{2\sqrt{\beta}}\tfrac{21}{20}\beta \leq \tfrac{21}{80}\), and the \((2,2)\) block at most \(1 + \tfrac{h}{2}\tfrac{1}{2\sqrt{\beta}}\tfrac{21}{20}\beta \leq \tfrac{181}{160}\). A row sum concludes the proof. ◻

10.3 \(\ell^\infty\) bounds under sparse interactions↩︎

This proof follows that of Proposition 21, with two changes. The \(\ell^2\) input is now the BAOAB contraction of Proposition 10, and the coefficient bounds come from the \(\eta < 1\) estimates of Proposition 18 rather than the exact \(\eta=1\) formulas. We therefore give only the parts that differ.

Proof of Proposition 14. Write \(A_k \mathrel{\vcenter{:}}= \tilde{T}_{k}^\eta\) and \(B_{k-1}\mathrel{\vcenter{:}}= h\tilde{U}_{k-1}^\eta\). As in 60 , for each threshold \(r\), \[\label{eqn-linf-sparse-baoab-decomp} \sum_{j=1}^d|(A_k)_{ij}| \leq \sqrt{s_r}|A_k|_{\ell^2} + \sum_{j \notin \mathsf{N}_{2r}(i)}|(A_k)_{ij}|\,,\tag{75}\] where \(|A_k|_{\ell^2} \leq 7\sqrt{2}(1-c(h))^{\frac{k-1}{2}}\) by Proposition 10, and the far-neighbor sum comes from the terms of order greater than \(r\), \[\sum_{j \notin \mathsf{N}_{2r}(i)}|(A_k)_{ij}| \leq \Big|\sum_{j=r+1}^k(-1)^jh^{2j}\sum_{k-1 \geq i_1 > \dots > i_j \geq 0} \tilde{t}_{i_1, \dots, i_j}^{(k)}H_{i_1}\dots H_{i_j}\Big|_{\ell^\infty}\,,\] whose \(\ell^2\) norm is at most \(\sum_{j=r+1}^k h^{2j} \beta^j t_j^{(k)}\). By Proposition 18, \[t_j^{(k)} \leq \left(\tfrac{1}{1-\eta}\right)^j \binom{k}{j} \leq \left( \tfrac{k e}{(1-\eta)j} \right)^j\,,\] using \(j! \geq j^j/\exp(j)\). Hence for \(r > \frac{ke^2\beta}{1-\eta}h^2\), \[\begin{align} \Big|\sum_{j=r+1}^k(-1)^jh^{2j}\sum_{k-1 \geq i_1 > \dots > i_j \geq 0} \tilde{t}_{i_1, \dots, i_j}^{(k)}H_{i_1}\dots H_{i_j}\Big|_{\ell^2} &\leq \sum_{j=r+1}^k \left( h^2 \tfrac{ke}{(1-\eta)j}\beta\right)^j\\ &\leq \sum_{j=r+1}^k \exp(-j) \leq \exp(-r)\,. \end{align}\] Substituting into 75 with \(|M|_{\ell^\infty} \leq \sqrt d |M|_{\ell^2}\) and taking \(r_k \mathrel{\vcenter{:}}= \lceil \frac{ke^2\beta}{1-\eta}h^2+\log\sqrt{d} \rceil\), \[\begin{align} |A_k|_{\ell^\infty} &\leq 7\sqrt2\,\sqrt{s_{r_k}}(1- c(h))^{\frac{k-1}{2}}+ \exp\left(-\tfrac{ke^2\beta}{1-\eta}h^2\right) \\&\leq (7\sqrt 2 + 1) \sqrt{s_{r_k}} \exp\left(-\tfrac{\alpha h^2}{8(1-\eta)}(k-1)\right)\,. \end{align}\] For \(B_{k-1}\), Proposition 18 gives \[u_j^{(k-1)} \leq \left(\tfrac{1}{1-\eta}\right)^{j+1}\binom{k-1}{j} \leq \left( \tfrac{1}{1-\eta}\right)^{j+1} \left(\tfrac{(k-1)e}{j}\right)^j\,,\] so the terms of order greater than \(r\) have \(\ell^2\) norm at most \(\sum_{j=r+1}^{k-1}h^{2j+1}\beta^ju_j^{(k-1)} \leq \frac{h}{1-\eta} \exp(-r) = b \exp(-r)\). Combining the tail estimates for \(A_k\) and \(B_{k-1}\), \[\sum_{j\notin \mathsf{N}_{2r}(i)}\left| \left(-\tfrac{b}{\sqrt{a-b^2}} A_k + \tfrac{1}{\sqrt{a-b^2}}B_{k-1} \right)_{ij}\right| \leq 2\sqrt{d}\, \tfrac{b}{\sqrt{a-b^2}}\exp(-r)\,,\] while Proposition 10 gives \(|-\tfrac{b}{\sqrt{a-b^2}} A_k + \tfrac{1}{\sqrt{a-b^2}}B_{k-1}|_{\ell^2} \leq 7\sqrt{2}(1-c(h))^{\frac{k-1}{2}}\). Hence, simplifying \(\frac{b}{\sqrt{a-b^2}}\) via \(h\leq \frac{1-\eta}{2\sqrt{\beta}}\), \[\begin{align} &\left|-\tfrac{b}{\sqrt{a-b^2}} A_k + \tfrac{1}{\sqrt{a-b^2}}B_{k-1}\right|_{\ell^\infty} \leq \sqrt{s_{r_k}}7\sqrt{2}(1-c(h))^{\frac{k-1}{2}} + \tfrac{2b}{\sqrt{a-b^2}}\exp\left(-\tfrac{ke^2\beta}{1-\eta}h^2\right)\\ &\qquad \leq \left(7\sqrt{2}+\tfrac{2}{\sqrt{3}}\right)\sqrt{s_{r_k}}\exp\left(-\tfrac{\alpha h^2}{8(1-\eta)}(k-1)\right)\,. \end{align}\] ◻

11 Discretization Error Analysis↩︎

We now bound the discretization error by comparing the discrete and continuous dynamics. The following two bounds from [5], used throughout, produce the \(\log(2d)\) dependence of the bias.

Lemma 4 (Lemma B.1 in [5]). Suppose \(Y = (Y^{(1)}, \dots, Y^{(d)}) \in \mathbb{R}^d\) with each \(Y^{(i)}\) centered and sub-Gaussian with variance proxy \(\sigma^2\), i.e. \(\mathbb{E}[\exp(\lambda Y^{(i)})] \leq \exp(\tfrac{1}{2}\lambda^2\sigma^2)\). Then \[\mathbb{E}[|Y|_{\ell^\infty}^2] \leq 4\sigma^2 \log(2d)\,.\]

Lemma 5 (Proposition 2.3 in [5]). Let Assumption 1 hold. Then \[\label{eqn-expected-inf-V-bound} \sqrt{\mathbb{E}_\pi[|\nabla V|_{\ell^\infty}^2]} \leq 2\sqrt{\beta\log (2d)}\,.\tag{76}\]

11.1 Discretization error in HMC↩︎

The discretization error decompositions 12 and 13 in Section 2.2 share the common structure \[\label{eqn-hmc-discretization-error-common-structure} |M \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{m-i-1}(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{1} - \mathsf{U}_{\text{\normalfont\scshape hmc}}^h)(q^*, p^*)|_{2,\ell^\infty}\,,\tag{77}\] with a matrix \(M \in \mathbb{R}^{d\times d}\) and \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0,I)\), where, as recalled in Section 5, \[(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^1 - \mathsf{U}_{\text{\normalfont\scshape hmc}}^h)(q^*, p^*) = ((\mathsf{Q}_h^1-\mathsf{Q}^h), (\mathsf{P}_h^1-\mathsf{P}^h))(q^*, p^*)\,.\]

The following proposition bounds the error of each component.

Proposition 23 (Generalization of Proposition 15). For any matrix \(M \in \mathbb{R}^{d \times d}\), suppose there exist constants \(C_3, C_4 > 0\) (possibly depending on \(\beta\)) such that \(|M \int \nabla^2 V {\rm d} \nu_1|_{\ell^\infty} < C_3\) and \(|M (\int \nabla^2 V {\rm d} \nu_1)(\int \nabla^2 V {\rm d} \nu_2)|_{\ell^\infty} < C_4\) for all probability measures \(\nu_1, \nu_2\) on \(\mathbb{R}^d\). Then for \(h \leq 1/\sqrt{20\beta}\) and \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0, I)\), \[\label{eqn-one-step-position-err} |M(\mathsf{Q}_h^1(q^*,p^*)-\mathsf{Q}^h(q^*,p^*))|_{2,\ell^\infty} \leq \frac{1}{\sqrt{2}}h^3C_3\sqrt{\log(2d)}\,,\qquad{(23)}\] \[\label{eqn-one-step-momentum-err} |M(\mathsf{P}_h^1(q^*,p^*)-\mathsf{P}^h(q^*,p^*))|_{2,\ell^\infty}\leq 2 h^2C_3 \sqrt{\log(2d)} + \frac{1}{2\sqrt{5}}h^4 C_4 \sqrt{\log(2d)}\,.\qquad{(24)}\]

Proof of Proposition 23. Let \((q_t, p_t) = \mathsf{U}_{\text{\normalfont\scshape hmc}}^t(q^*, p^*)\). The continuous and discrete position updates have the integral representations \[\label{eqn-integral-hmc-position} \mathsf{Q}^h(q^*,p^*) = q^* + p^*h - \int_0^h\int_0^t \nabla V(q_s){\rm d} s {\rm d} t\,,\quad \mathsf{Q}_h^1(q^*,p^*) = q^* + p^*h - \tfrac12 h^2 \nabla V(q^*)\,,\tag{78}\] whose difference is \(\mathsf{Q}_h^1(q^*,p^*)-\mathsf{Q}^h(q^*,p^*) = \int_0^h \int_0^t (\nabla V(q_s)-\nabla V(q^*)) {\rm d}s {\rm d}t\). Writing \(\nabla V(q_s) - \nabla V(q^*) = (\int_0^1 \nabla^2 V(\tau q_s + (1-\tau)q^*){\rm d}\tau)(q_s - q^*)\) and using the hypothesis on \(M\), \[|M(\mathsf{Q}_h^1(q^*,p^*)-\mathsf{Q}^h(q^*,p^*))|_{\ell^{\infty}}^2 \leq \tfrac12 h^2 C_3^2 \int_0^h\int_0^t|q_s-q^*|_{\ell^\infty}^2{\rm d}s {\rm d}t\,.\] Expanding \(q_s\) bounds the remaining integral, \[\label{eqn-qs-q-double-integral} \begin{align} \int_0^h\int_0^t|q_s-q^*|_{\ell^\infty}^2 {\rm d}s{\rm d}t &\leq 2\int_0^h\int_0^t|p^*s|_{\ell^\infty}^2 {\rm d}s{\rm d}t + 2 \int_0^h\int_0^t\Big|\int_0^s\int_0^\tau \nabla V(q_r){\rm d}r {\rm d}\tau\Big|_{\ell^\infty}^2{\rm d}s{\rm d}t\\ &\leq \tfrac16h^4|p^*|_{\ell^\infty}^2 + \int_0^h\int_0^ts^2\int_0^s\int_0^\tau|\nabla V(q_r)|_{\ell^\infty}^2{\rm d}r{\rm d}\tau {\rm d}s{\rm d}t\,. \end{align}\tag{79}\] Since \((q^*,p^*) \sim \pi \otimes \mathcal{N}(0,I)\), stationarity gives \(q_t \sim \pi\) for all \(t\), so by Lemma 4, \[\label{eqn-qs-q-double-integral-expectation} \mathbb{E}\int_0^h\int_0^t|q_s-q^*|_{\ell^\infty}^2{\rm d}s{\rm d}t\leq \tfrac23h^4\log(2d) + \tfrac{1}{60}h^6 \mathbb{E}_\pi[|\nabla V|_{\ell^\infty}^2]\,.\tag{80}\] Combining these with Lemma 5 and \(h^2\beta \leq 1/20\), \[\begin{align} |M(\mathsf{Q}_h^1(q^*,p^*)-\mathsf{Q}^h(q^*,p^*))|_{2,\ell^\infty} &\leq \tfrac1{\sqrt{3}} h^3C_3\sqrt{\log(2d)} + \tfrac{1}{\sqrt{120}}h^4C_3\sqrt{\mathbb{E}_{\pi}[|\nabla V|_{\ell^\infty}^2]}\\ &\leq \tfrac1{\sqrt{2}}h^3C_3\sqrt{\log(2d)}\,, \end{align}\] which is ?? . For the momentum component, \[\mathsf{P}_h^1(q^*,p^*) = p^*-\tfrac12h\nabla V(q^*)-\tfrac12h\nabla V(\mathsf{Q}_h^1(q^*,p^*))\,,\quad \mathsf{P}^h(q^*,p^*) = p^*-\int_0^h\nabla V(q_t) {\rm d}t\,,\] so \[\label{eqn-decomp-MPhP-a-b} \begin{align} &|M(\mathsf{P}_h^1(q^*,p^*)-\mathsf{P}^h(q^*,p^*))|_{2,\ell^\infty}^2 \\ &\leq \tfrac12 h C_3^2 \underbrace{\mathbb{E}\int_0^h|q_t-q^*|_{\ell^\infty}^2 {\rm d}t}_{(a)} + \tfrac12\underbrace{\mathbb{E}\Big|\int_0^h \tilde{M}(q_t - \mathsf{Q}_h^1(q^*,p^*)){\rm d}t\Big|_{\ell^\infty}^2}_{(b)}\,, \end{align}\tag{81}\] where \(\tilde{M} \mathrel{\vcenter{:}}= \int_0^1 M \nabla^2 V(\tau q_t + (1-\tau)\mathsf{Q}_h^1(q^*,p^*)){\rm d}\tau\). The bounds used in 79 and 80 give \[\label{eqn-bound-a} (a) \leq \tfrac83h^3\log(2d)+ \tfrac{1}{10} h^5 \mathbb{E}_\pi[|\nabla V|_{\ell^\infty}^2]\,.\tag{82}\] Using the position differences in 78 , \[\begin{align} &q_t - \mathsf{Q}_h^1(q^*,p^*) = p^*(t-h) - \int_0^t \int_0^s (\nabla V(q_\tau)-\nabla V(q^*)){\rm d}\tau {\rm d}s+\tfrac12(h^2-t^2)\nabla V(q^*)\\ = & p^*(t-h) - \int_0^t \int_0^s \Big(\int_0^1\nabla^2V(rq_\tau + (1-r)q^*) {\rm d}r \Big) (q_\tau - q^*){\rm d}\tau {\rm d}s+\tfrac12(h^2-t^2)\nabla V(q^*)\,, \end{align}\] so \((b)\) splits as \[\label{eqn-b-decomp-b1-b2-b3} \begin{align} (b) &\leq 3h C_3^2\underbrace{\mathbb{E}\int_0^h |p^*(t-h)|_{\ell^\infty}^2 {\rm d}t}_{(b_1)} + 3h C_3^2 \underbrace{\mathbb{E}\int_0^h \Big| \tfrac12 (h^2-t^2)\nabla V(q^*)\Big|_{\ell^\infty}^2 {\rm d}t}_{(b_2)}\\ & \quad + \tfrac12 h^3 C_4^2 \underbrace{\mathbb{E}\int_0^h\int_0^t\int_0^s |q_\tau - q^*|_{\ell^\infty}^2{\rm d}\tau {\rm d}s {\rm d}t}_{(b_3)}\,. \end{align}\tag{83}\] Direct computation of \((b_1), (b_2)\) and the approach of 80 for \((b_3)\) give \[\label{eqn-bounds-b1-b2} (b_1) \leq \tfrac{4}{3}h^3\log(2d)\,,\quad (b_2) \leq \tfrac{2}{15}h^5 \mathbb{E}_\pi[|\nabla V|_{\ell^\infty}^2]\,,\quad (b_3) \leq \tfrac{2}{15}h^5\log(2d) + \tfrac{1}{420}h^7 \mathbb{E}_\pi[|\nabla V|_{\ell^\infty}^2]\,.\tag{84}\] Combining these via 81 and applying Lemma 5 gives ?? . ◻

11.2 Discretization error in UL↩︎

We adapt the framework of [29], in particular the analysis leading to their Proposition 8.3, to the \(W_{2,\ell^\infty}\) norm. We use an HOH chain preserving the invariant distribution exactly, and measure the discrepancy between the BAOAB and HOH chains.

Proposition 24. Consider initial states \((x, p)\) and \((y, p')\) with \((x, p) \sim \pi \otimes \mathcal{N}(0,I)\). Apply one HOH step to \((x,p)\) and one BAOAB step to \((y,p')\), coupled through the same Gaussian noise \(\xi\), and set \((\Delta_q, \Delta_p) \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape hoh}, h}^\xi(x,p) - \mathsf{U}_{\text{\normalfont\scshape baoab},h}^\xi(y,p')\). Suppose \(\pi\) satisfies Assumption 1 and \(h \leq \frac{1-\eta}{2\sqrt{\beta}}\). If \(|\int \nabla^2 V {\rm d}\nu_1|_{\ell^\infty} \leq C_5\) and \(|(\int \nabla^2 V {\rm d}\nu_1)(\int \nabla^2 V {\rm d}\nu_2)|_{\ell^\infty} \leq C_6\) for all probability measures \(\nu_1, \nu_2\) on \(\mathbb{R}^d\), then \[\label{eqn-position-diff-discretization-error-decomp-baoab} |\Delta_q|_{2,\ell^\infty}\leq (1 + \tfrac14h^2(\eta+1)C_5)|x - y|_{2,\ell^\infty} + \tfrac{h}{2}(\eta + 1)|p - p'|_{2,\ell^\infty} + \tfrac{27}{64}C_5h^3\sqrt{\log(2d)}\,,\qquad{(25)}\] \[\label{eqn-momentum-diff-discretization-error-decomp-baoab} \Delta_p = (\eta I - \tfrac{h^2(\eta+1)}{4}Q_2)(p-p')+(-\tfrac h 2 \eta Q_1 - \tfrac h 2 Q_2 + \tfrac{h^3(\eta+1)}{8}Q_2 Q_1)(x - y) + \varepsilon_p\,,\qquad{(26)}\] where \(|\varepsilon_p|_{2,\ell^\infty} \leq {\tfrac{27}{8}}h^2 C_5\sqrt{\log(2d)}+{\tfrac38}h^4 C_6\sqrt{\log(2d)}\), and \(Q_1, Q_2 \in \mathbb{R}^{d\times d}\) satisfy \(\alpha I \preceq Q_1, Q_2 \preceq \beta I\), \(|Q_1|_{\ell^\infty} \leq C_5\), \(|Q_2|_{\ell^\infty} \leq C_5\), and \(|Q_2Q_1|_{\ell^\infty}\leq C_6\).

Proof of Proposition 24. We use integral representations of the updates. Let \(\mathsf{U}_{\text{\normalfont\scshape ho},h}^\xi\) be the composition of a half-step of Hamiltonian dynamics \(\mathsf{H}= \mathsf{U}_{\text{\normalfont\scshape hmc}}^{h/2}\), followed by a full Ornstein–Uhlenbeck map \(\mathsf{O}\) with noise \(\xi\). We write \((\bar x, \bar p) \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape ho},h}^\xi(x,p)\). With \((x(t), p(t)) = \mathsf{U}_{\text{\normalfont\scshape hmc}}^t(x,p)\) the continuous Hamiltonian trajectory 1 , we have \((x(t), p(t))\sim \pi \otimes \mathcal{N}(0,I)\) and \[\bar x = x + \tfrac h 2 p - \int_0^{h/2} \nabla V(x(t))(\tfrac h 2 - t){\rm d}t\,, \quad \bar p = \eta\Big(p - \int_0^{h/2}\nabla V(x(t)){\rm d}t\Big) + \sqrt{1-\eta^2}\xi\,.\]

Position component. Let \((\bar x(t), \bar p(t)) = \mathsf{U}_{\text{\normalfont\scshape hmc}}^t(\bar x, \bar p)\), so \((\bar x(t), \bar p(t)) \sim \pi \otimes \mathcal{N}(0, I)\). The position updates are \[\begin{align} q_{\mathsf{HOH}} \mathrel{\vcenter{:}}= & x + \tfrac{h}{2} p(1+\eta) - \int_0^{h/2}\nabla V(x(t))(\tfrac{h}{2}-t){\rm d}t - \int_0^{h/2}\nabla V(\bar x(t))(\tfrac{h}{2} - t) {\rm d}t\\ &+\tfrac{h}{2}\Big(\eta\Big(-\tfrac{h}{2}\nabla V(x) - \int_0^{h/2}\nabla^2 V(x(t))p(t)(\tfrac{h}{2}-t){\rm d}t \Big) + \sqrt{1-\eta^2}\xi \Big)\,, \end{align}\] \[q_{\mathsf{BAOAB}} \mathrel{\vcenter{:}}= y + \tfrac{h}{2} p' (1+\eta) - \tfrac{h^2}{4}(1+\eta) \nabla V(y) + \tfrac{h}{2}\sqrt{1-\eta^2}\xi\,,\] and their difference satisfies \[\begin{align} &|\Delta_q|_{2,\ell^\infty}\\ \leq &(1 + \tfrac{h^2}{4}\eta C_5) |x - y|_{2,\ell^\infty} + \tfrac{h}{2}(1+\eta)|p - p'|_{2,\ell^\infty}+ \Big| \int_0^{h/2}(\nabla V(x(t)) - \nabla V(y))(\tfrac{h}{2}-t){\rm d}t\\ & + \eta \tfrac{h}{2}\int_0^{h/2}\nabla^2 V(x(t)) p(t) (\tfrac{h}{2}-t){\rm d}t + \int_0^{h/2}(\nabla V(\bar x(t)) - \nabla V(y))(\tfrac{h}{2}-t){\rm d}t\Big|_{2,\ell^\infty}\,. \end{align}\] The last term is at most \[C_5\int_0^{h/2}(|x(t) - y|_{2,\ell^\infty}+|\bar x(t) - y|_{2,\ell^\infty})(\tfrac{h}{2}-t){\rm d}t + \tfrac{h\eta C_5}{2} \int_0^{h/2}|p(t)|_{2,\ell^\infty}(\tfrac{h}{2}-t){\rm d}t\,.\] Expanding the integral representation of \(x(t)\) gives \(|x(t) - y|_{2, \ell^\infty} \leq |x-y|_{2, \ell^\infty} + |tp - \int_0^t \nabla V(x(s))(t-s){\rm d}s|_{2, \ell^\infty}\), and by Lemmas 4 and 5, \[|tp - \int_0^t \nabla V(x(s))(t-s){\rm d}s|_{2, \ell^\infty} \leq h\sqrt{\log (2d)} + \tfrac{h^2}{4}\sqrt{\beta\log(2d)}\,.\] Similarly, with \(\bar x = x(h/2)\), \(|\bar x(t) - y|_{2, \ell^\infty} \leq |\bar x(t) - \bar x|_{2, \ell^\infty} + |\bar x - y|_{2, \ell^\infty}\), where \[\begin{align} &|\bar x(t) - \bar x|_{2, \ell^\infty} \leq h \sqrt{\log(2d)} + \tfrac{h^2}{4}\sqrt{\beta \log(2d)}\,,\\ & |\bar x - y|_{2, \ell^\infty} \leq |x - y|_{2, \ell^\infty} + h\sqrt{\log(2d)}+\tfrac{h^2}{4}\sqrt{\beta \log(2d)}\,. \end{align}\] Combining these and applying \(h \leq 1/(2\sqrt{\beta})\) gives ?? .

Momentum component. The momentum updates are \[\begin{align} p_{\mathsf{HOH}} &\mathrel{\vcenter{:}}= \eta\Big(p -\tfrac{h}{2}\nabla V(x) - \int_0^{h/2}\nabla^2 V(x(t))p(t)( \tfrac h 2 - t){\rm d}t \Big) + \sqrt{1-\eta^2}\xi\\ &\quad - \tfrac{h}{2}\nabla V(\bar x) - \int_0^{h/2}\nabla^2V(\bar x(t)) \bar p(t) ( \tfrac h 2 - t){\rm d}t\,, \end{align}\] \[p_{\mathsf{BAOAB}} \mathrel{\vcenter{:}}= \eta\Big(p' - \tfrac h 2 \nabla V(y) \Big) + \sqrt{1-\eta^2}\xi - \tfrac h 2 \nabla V(\hat{y})\,,\] where \(\hat{y} = y + \tfrac h2 (\eta+1)p' - \tfrac{h^2}4(\eta+1)\nabla V(y) + \tfrac h2 \sqrt{1-\eta^2}\xi\), so \[\begin{align} \Delta_p &= \eta(p - p') - \tfrac{h}{2}\eta(\nabla V(x) - \nabla V(y)) - \eta \int_0^{h/2}\nabla^2V(x(t))p(t)( \tfrac h 2 - t){\rm d}t\\ &\quad - \tfrac h 2 (\nabla V(\bar x) - \nabla V(\hat{y})) - \int_0^{h/2}\nabla^2V(\bar x(t)) \bar p(t) ( \tfrac h 2 - t) {\rm d}t\,. \end{align}\] Grouping the principal terms into \[\alpha_p \mathrel{\vcenter{:}}= \eta (p - p') - \tfrac h 2 \eta (\nabla V(x) - \nabla V(y)) - \tfrac h 2 (\nabla V(\hat{x}_c) - \nabla V(\hat{y}))\,,\] with \(\hat{x}_c = x + \tfrac h2(\eta+1)p - \tfrac{h^2}4(\eta+1)\nabla V(x) + \tfrac h2\sqrt{1-\eta^2}\xi\), \[\alpha_p = (\eta I - \tfrac{h^2(\eta+1)}{4}Q_2)(p-p')+(-\tfrac h 2 \eta Q_1 - \tfrac h 2 Q_2 + \tfrac{h^3(\eta+1)}{8}Q_2 Q_1)(x - y)\,,\] where \(Q_1 = \nabla^2 V([y, x])\), \(Q_2 = \nabla^2 V([\hat{x}_c, \hat{y}])\), and \(\nabla^2 V([v_1, v_2]) \mathrel{\vcenter{:}}= \int_0^1 \nabla^2 V(v_1 + s(v_2 - v_1)) {\rm d}s\). The remainder \(\varepsilon_p \mathrel{\vcenter{:}}= \Delta_p - \alpha_p\) is \(I_1 + I_2 + I_3 + I_4\), with \[\begin{align} I_1 &\mathrel{\vcenter{:}}= -\eta \int_0^{h/2}\nabla^2 V(x(t))p ( \tfrac h 2 -t){\rm d}t + \eta \tfrac{h^2}{4}\nabla^2 V([\hat{x}_c, \bar x])p- \eta \int_0^{h/2}\nabla^2 V(\bar x(t)) \tilde{p}( \tfrac h 2 - t){\rm d}t\\ & \quad + \tfrac{h^2}{4}\nabla^2 V([\hat{x}_c, x])\sqrt{1-\eta^2}\xi - \sqrt{1-\eta^2}\int_0^{h/2}\nabla^2 V(\bar x(t)) \xi ( \tfrac h 2 - t){\rm d}t\,, \end{align}\] where \(\tilde{p} \mathrel{\vcenter{:}}= p - \tfrac h2\nabla V(x) - \int_0^{h/2}\nabla^2 V(x(t)) p(t) (\tfrac h2 - t){\rm d}t\); \[I_2 \mathrel{\vcenter{:}}= \eta \int_0^{h/2} \nabla^2 V(x(t)) (p(t) - p) (\tfrac h 2 - t){\rm d} t\,,\] \[I_3 \mathrel{\vcenter{:}}= \tfrac h 2 \nabla^2 V([\hat{x}_c, \bar x])(-\tfrac{h^2}{4}(\eta+1)\nabla V(x) + \int_0^{h/2}\nabla V(x(t))( \tfrac h 2 - t){\rm d}t)\,,\] \[I_4 \mathrel{\vcenter{:}}= - \int_0^{h/2}\nabla^2 V(\bar x(t))(-t \nabla V(\bar x) - \int_0^t\nabla^2 V(\bar x(s))\bar p(s)(t-s){\rm d}s)( \tfrac h 2 - t){\rm d}t\,.\] These terms are bounded by \[\begin{align} &|I_1|_{2,\ell^\infty} \leq (\tfrac{21}{8}h^2 C_5 + \tfrac18h^4C_6) \sqrt{\log(2d)}\,,\quad |I_2|_{2,\ell^\infty} \leq ({\tfrac14}h^2 C_5 + \tfrac18h^4 C_6)\sqrt{\log(2d)}\,,\\ &|I_3|_{2, \ell^\infty} \leq {\tfrac{3}{8}}h^2 C_5\sqrt{\log(2d)}\,,\quad |I_4|_{2,\ell^\infty} \leq (\tfrac18h^2 C_5 + \tfrac18h^4C_6)\sqrt{\log(2d)}\,, \end{align}\] using \(h \leq 1/(2\sqrt{\beta})\), and combining them gives ?? . ◻

The decomposition 19 requires bounding the discretization error over \(l\) steps. Through the decomposition 25 of Section 4.1, the relevant quantity is the expected weighted error \(|(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w}\). We bound it through the surrogate \[\label{hmc-eqn-weighted-linf-norm-surrogate} |\Delta_q^l|_{2,\ell^\infty} + \sqrt{a}|\Delta_p^l|_{2,\ell^\infty}\,,\tag{85}\] an upper bound for \(|(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w}\) since \[|(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w} = \left| (\Delta_q^l + b \Delta_p^l, \sqrt{a-b^2}\Delta_p^l) \right|_{2, \ell^\infty} \leq |\Delta_q^l|_{2,\ell^\infty} + \sqrt{a}|\Delta_p^l|_{2,\ell^\infty}\,.\]

To bound this surrogate, one could combine the single-step error of Proposition 24 with the joint-space contraction of Corollary 1. This is too crude, as it treats the position and momentum errors together. Instead, we use a Grönwall argument that tracks the two separately, mirroring the \(\ell^2\) analysis of [29].

Proposition 25 (Refined statement of Proposition 16). For the \((\Delta_q^l, \Delta_p^l)\) process with shared initial state \((q^*,p^*)\sim \pi \otimes \mathcal{N}(0,I)\), if \(\pi\) satisfies Assumption 1 and \(h \leq \frac{1-\eta}{2\sqrt\beta}\), then the accumulated discretization error over \(l\) steps satisfies \[\label{eqn-prop-l-step-error-gronwall} |(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w} \leq |\Delta_q^l|_{2,\ell^\infty} + \sqrt{a}|\Delta_p^l|_{2,\ell^\infty} \leq \exp\left[(l-1)h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta} + \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}} +\sqrt\beta\Big)\right] E_l\,,\qquad{(27)}\] where \(C_5, C_6\) are the constants in Proposition 24 and \[E_l = \left( \tfrac{27}{64}C_5 h^3l + {\tfrac{27}{8}}\tfrac{h^2C_5}{\sqrt{\beta}(1-\eta)} + {\tfrac38}\tfrac{h^4C_6}{\sqrt{\beta}(1-\eta)}\right) \sqrt{\log(2d)}\,.\]

Proof of Proposition 25. By Proposition 24, unrolling the position error recurrence to \(\Delta_q^0 = 0\) gives \[\begin{align} |\Delta_q^l|_{2,\ell^\infty} &\leq |\Delta_q^{l-1}|_{2,\ell^\infty} + h (hC_5|\Delta_q^{l-1}|_{2,\ell^\infty} + |\Delta_p^{l-1}|_{2,\ell^\infty}) + \tfrac{27}{64}C_5h^3\sqrt{\log(2d)}\\ &\leq \sum_{i=1}^{l-1} h(hC_5|\Delta_q^i|_{2, \ell^\infty} + |\Delta_p^i|_{2,\ell^\infty}) + \tfrac{27}{64}C_5lh^3\sqrt{\log(2d)}\,. \end{align}\] Likewise, unrolling the momentum error recurrence and bounding the geometric sum of the constant term by \((1-\eta)^{-1}\) yields \[\begin{align} |\Delta_p^l|_{2,\ell^\infty} &\leq (\eta + \tfrac{h^2}{2}C_5)|\Delta_p^{l-1}|_{2,\ell^\infty} + (h C_5 + \tfrac{h^3}{4}C_6)|\Delta_q^{l-1}|_{2,\ell^\infty} + |\varepsilon_p|_{2,\ell^\infty}\\ &\leq \sum_{i=1}^{l-1}\eta^{i-1}\tfrac{h^2}{2}C_5|\Delta_p^{l-i}|_{2,\ell^\infty} + \sum_{i=1}^{l-1}\eta^{i-1}(hC_5 + \tfrac{h^3C_6}{4})|\Delta_q^{l-i}|_{2,\ell^\infty} + \tfrac{1}{1-\eta}|\varepsilon_p|_{2,\ell^\infty}\,. \end{align}\] Combining the two, with \(h \leq 1/(2\sqrt{\beta})\) and \(\eta \leq 1\), we obtain \[|\Delta_q^l|_{2,\ell^\infty} + \sqrt a |\Delta_p^l|_{2,\ell^\infty} \leq \sum_{i=1}^{l-1}h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta}+ \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}} + \sqrt\beta\Big)(|\Delta_q^{l-i}|_{2,\ell^\infty}+\sqrt a |\Delta_p^{l-i}|_{2,\ell^\infty}) + E_l\,.\] Applying Grönwall’s inequality leads to ?? . ◻

12 Sampling Bias Bounds↩︎

Under the framework of Section 2, we now combine the propagator norm estimates with the discretization error to track the sampling error across steps, and obtain the bias bounds in the limit of infinitely many steps.

12.1 HMC↩︎

We prove the iterative \(W_{2,\ell^\infty}\) bounds of Propositions 3 and 4, from which the HMC cases of Theorems 1 and 2 follow by iterating to the stationary limit. We begin with the weak interaction case.

Proof of Proposition 3. Following the coupling and one-step split 10 into the contraction term \((a)\) and discretization term \((b)\), we bound each.

Contraction term. By Proposition 8, \[(a) = |\tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_i\}_{i=0}^{m-1})(X_k - Y_k)|_{2,\ell^\infty}\,,\] with \(H_i = \int_0^1 \nabla^2 V(\tau x_i + (1-\tau) y_i){\rm d}\tau\) and \(x_i, y_i\) the internal positions after \(i\) leap-frog steps, \(x_i \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^i(X_k, \xi_k)\), \(y_i \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc}, h}^i(Y_k, \xi_k)\). The contractive \(\ell^\infty\) bound of Proposition 11 gives \[(a) \leq \left(1 - \frac{\alpha}{400\beta}\right) |X_k - Y_k|_{2,\ell^\infty}\,.\]

Discretization error. The telescoping decomposition 12 and the component split 29 express \((b)\) through single integration-step errors. Representing each propagated factor as a matrix polynomial via Proposition 8, with \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0,I)\), \[\begin{align} (b) & \leq\sum_{i=0}^{m-1} \underbrace{|\tilde{T}_{m-i-1}^1(\{I - \tfrac{h^2}{2}H_j\}_{j=0}^{m-i-2})(\mathsf{Q}_h^1 - \mathsf{Q}^h)(q^*, p^*)|_{2,\ell^\infty}}_{(b_1)}\\ & \quad +\sum_{i=0}^{m-1}\underbrace{|h \tilde{U}_{m-i-2}^1(\{I -\tfrac{h^2}{2}H_j\}_{j=1}^{m-i-2})(\mathsf{P}_h^1-\mathsf{P}^h)(q^*, p^*)|_{2,\ell^\infty}}_{(b_2)}\,, \end{align}\] where \(H_j = \int_0^1\nabla^2 V(\tau x_j + (1-\tau) y_j) {\rm d} \tau\) and \(x_j, y_j\) are the \(j\)-th internal leap-frog positions started at \(\mathsf{U}_{\text{\normalfont\scshape hmc},h}^1(q^*, p^*)\) and \(\mathsf{U}_{\text{\normalfont\scshape hmc}}^h(q^*,p^*)\), i.e.we redefine \(x_j \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^j \mathsf{U}_{\text{\normalfont\scshape hmc},h}^1(q^*, p^*)\), \(y_j \mathrel{\vcenter{:}}= \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^j\mathsf{U}_{\text{\normalfont\scshape hmc}}^h(q^*,p^*)\). By Proposition 11, almost surely \(|\tilde{T}_{m-i-1}^1|_{\ell^\infty} \leq 1 + \frac{\alpha}{400\beta} \leq \frac{401}{400}\) and \(|h\tilde{U}_{m-i-2}^1|_{\ell^\infty} \leq \tfrac{3}{2\sqrt\beta}\).

To bound \((b_1), (b_2)\) we apply Proposition 23, instantiating its general matrix \(M\) to the specific polynomials appearing here and determining the corresponding constants \(C_3, C_4\). For \((b_1)\), we take \(M = \tilde{T}_{m-i-1}^1\), which satisfies \(|M|_{\ell^\infty} \leq {\frac{401}{400}}\). Under the weak interaction assumption the integrated Hessian obeys \(|\int\nabla^2 V{\rm d}\nu|_{\ell^\infty} \leq \beta + \tfrac{\alpha}{50} \leq \tfrac{51}{50}\beta\), so \(|M\int\nabla^2 V{\rm d}\nu|_{\ell^\infty} \leq {\sqrt{2}\beta}\) and we may take \(C_3 = \sqrt{2}\beta\). For \((b_2)\), we take \(M = h\tilde{U}_{m-i-2}^1\) with \(|M|_{\ell^\infty} \leq \tfrac{3}{2\sqrt\beta}\), giving \(C_3 = \tfrac{3}{2\sqrt\beta}\cdot\tfrac{51}{50}\beta = \tfrac{153}{100}\sqrt\beta\) and, for a product of two Hessians, \(C_4 = \tfrac{3}{2\sqrt\beta}\cdot(\tfrac{51}{50}\beta)^2 = \tfrac{3}{2}(\tfrac{51}{50})^2\beta^{\frac{3}{2}}\). With \(h \leq 1/\sqrt{20\beta}\), Proposition 23 yields \[(b_1) \leq h^3\beta\sqrt{\log(2d)} \leq h^2\sqrt{\beta\log(2d)}\,, \quad (b_2) \leq 4h^2\sqrt{\beta\log(2d)}\,,\] and summing over the \(m\) steps, \[(b) \leq 5mh^2\sqrt{\beta \log(2d)} \leq 2h\sqrt{\log(2d)}\,,\] using \(mh = 1/\sqrt{20\beta}\) in the last step. Thus, \[|X_{k+1}-Y_{k+1}|_{2,\ell^\infty} \leq \left( 1 - \frac{\alpha}{400\beta} \right) |X_k - Y_k|_{2,\ell^\infty} + 2h\sqrt{\log(2d)}\,.\] Taking \(X_k, Y_k\) optimally coupled so that \(W_{2,\ell^\infty}(\rho_k, \pi) = |X_k - Y_k|_{2,\ell^\infty}\), we obtain \[W_{2,\ell^\infty}(\rho_{k+1},\pi) \leq \left( 1 - \frac{\alpha}{400\beta} \right) W_{2,\ell^\infty}(\rho_k, \pi) + 2h\sqrt{\log(2d)}\,.\] ◻

Proof of the HMC case of Theorem 1. Under \(C^{(O)} = 1/50\) and \(mh = 1/\sqrt{20\beta}\), taking \(k \to \infty\) in the inequality of Proposition 3 gives \[W_{2,\ell^\infty}(\pi_h, \pi) = O\left(\frac{\beta}{\alpha}h\sqrt{\log(2d)}\right)\,.\] ◻

We turn to the sparse interaction case.

Proof of Proposition 4. With \(X_k, Y_k\) as before, the multi-step split 11 bounds \(|X_{k+N} - Y_{k+N}|_{2,\ell^\infty}\) by its contraction term \((a)\) and discretization term \((b)\).

Contraction term. Proposition 8 represents the propagators as matrix polynomials, bounded in \(\ell^2\) by Proposition 9 and in \(\ell^\infty\) by Proposition 21, which extends Proposition 13. The \(\ell^2\) bound, converted to \(\ell^\infty\) at a cost of \(\sqrt d\), gives \[\label{eqn-part-a-proof-prop-sketch-sparse-bound-hmc} (a) \leq (1 - \tfrac{\alpha}{200\beta} )^N\sqrt{d}\, |X_k - Y_k|_{2,\ell^\infty}\,.\tag{86}\]

Discretization error. The telescoping decomposition 13 and the component split 29 , with the matrix-polynomial representation of Proposition 8, give \[\begin{align} (b) & \leq \sum_{l=0}^{N-1}\sum_{i=0}^{m-1} \underbrace{\Big|A_{(N-l-1)m+(m-i-1)}(\mathsf{Q}_h^1-\mathsf{Q}^h)(q^*, p^*)\Big|_{\ell^\infty}}_{(b_1)}\\ & \quad + \sum_{l=0}^{N-1}\sum_{i=0}^{m-1} \underbrace{\Big|B_{(N-l-1)m+(m-i-2)}(\mathsf{P}_h^1-\mathsf{P}^h)(q^*, p^*)\Big|_{\ell^\infty}}_{(b_2)}\,, \end{align}\] where, writing \(P_{l,i} \mathrel{\vcenter{:}}= \prod_{k \in\{m-i-1+jm\}_{j=0}^{N-l-2}}^{\longleftarrow}\tilde{T}_m^1(\{I - \tfrac{h^2}{2}H_{k+s} \}_{s=0}^{m-1})\) for the product of full-loop propagators over the \(N-l-1\) subsequent outer loops, \[A_{(N-l-1)m+(m-i-1)} = P_{l,i}\,\tilde{T}_{m-i-1}^1\,,\qquad B_{(N-l-1)m+(m-i-2)} = P_{l,i}\, h\tilde{U}_{m-i-2}^1\,.\] The Hessians \(H_j = \int_0^1 \nabla^2 V(\tau x_j + (1-\tau) y_j){\rm d} \tau\) are indexed by the total internal leap-frog step count: \[\begin{align} &0 \leq j \leq m-i-1: \quad x_{j} = \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^j \mathsf{U}_{\text{\normalfont\scshape hmc},h}^1(q^*, p^*)\,,\; y_j = \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape hmc},h}^j \mathsf{U}_{\text{\normalfont\scshape hmc}}^h(q^*, p^*)\,;\\ & 0 \leq \hat{l} \leq N-l-1,\;0 \leq j < m-1:\\ &\quad x_{\hat{l} m+j+(m-i-1)} = \mathsf{\Phi}_{h,\xi_{k+l+\hat{l} + 1}}^j \mathsf{\Phi}_{h,\xi_{k+l+\hat{l}}}^m\cdots \mathsf{\Phi}_{h,\xi_{k+l+1}}^m\mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{m-i-1}\mathsf{U}_{\text{\normalfont\scshape hmc},h}^1(q^*, p^*)\,, \\ &\quad y_{\hat{l} m+j+(m-i-1)} = \mathsf{\Phi}_{h,\xi_{k+l+\hat{l} + 1}}^j \mathsf{\Phi}_{h,\xi_{k+l+\hat{l}}}^m\cdots \mathsf{\Phi}_{h,\xi_{k+l+1}}^m\mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape hmc},h}^{m-i-1}\mathsf{U}_{\text{\normalfont\scshape hmc}}^h(q^*, p^*)\,, \end{align}\] with the convention that for \(\hat{l} = 0\) only \(\mathsf{\Phi}_{h,\xi_{k+l+\hat{l} + 1}}^j\) is applied. By Propositions 21 and 23, for \(r = r_{(N-l-1)m+(m-i-1)}\), \[(b_1) \leq 3h^2 \sqrt{s_{r}\beta\log(2d)}\,,\quad (b_2) \leq 9h^2\sqrt{s_{r}\beta\log(2d)}\,,\] so summing over the \(Nm\) steps, \[\label{eqn-part-b-proof-prop-sketch-sparse-bound-hmc} (b) \leq 12h^2\sqrt{\beta\log(2d)}\sum_{i=0}^{Nm-1}\sqrt{s_{r_{i}}}\,.\tag{87}\] Combining 86 and 87 with \(X_k, Y_k\) optimally coupled completes the proof. ◻

The following corollary follows by specifying \(N\) and estimating \(\sum \sqrt{s_{r_i}}\) under the polynomial growth condition.

Proof of the HMC case of Theorem 2. Take \(N = \lceil \frac{200\beta}{\alpha}\log(2\sqrt{d})\rceil\), so that the contraction factor \((1-\tfrac{\alpha}{200\beta})^N\sqrt{d} \leq \tfrac12\). Under \(s_k \leq C(k+1)^n\), an integral comparison gives \[\label{eqn-integral-sum-sparsity-hmc} \begin{align} &\sum_{i=0}^{Nm-1}\sqrt{s_{r_{i}}} \leq \sum_{i=0}^{Nm-1} \sqrt{C}\left(ih\sqrt\beta e + \tfrac{\log\sqrt d}{\log (5/3)} + 2\right)^{\frac{n}{2}}\\ &\quad \leq \int_0^{Nm}\sqrt{C}\left(yh\sqrt{\beta}e + \tfrac{\log\sqrt{d}}{\log(5/3)} + 2 \right)^{\frac{n}{2}}{\rm d}y \leq \sqrt{C}\frac{\left(Nmh\sqrt{\beta}e + \tfrac{\log\sqrt{d}}{\log(5/3)} + 2 \right)^{\frac{n}{2}+1}}{(n/2+1)h\sqrt{\beta}e}\,. \end{align}\tag{88}\] With this \(N\) and \(mh \leq 1/\sqrt{20\beta}\), Proposition 4 gives the recursion \[W_{2,\ell^\infty}(\rho_{k+N},\pi) \leq \tfrac12 W_{2,\ell^\infty}(\rho_k,\pi) + h \sqrt{\log(2d)}\left(O(\tfrac{\beta}{\alpha}\log(2d))\right)^{\frac{n}{2} + 1}\,,\] and taking \(k\to \infty\) gives \[W_{2,\ell^\infty}(\pi_h, \pi) = h\sqrt{\log(2d)}\left( O\left( \frac{\beta}{\alpha}\log(2d)\right)\right)^{\frac{n}{2} + 1}\,.\] ◻

12.2 UL↩︎

Proof of the UL case of Theorem 1. We follow the coupling framework 18 with the weighted matrix representation of Section 4.1. Denote the initial distribution of \(X_0\) by \(\rho_0\). The BAOAB chain \((X_k, P_k)\) from \((X_0, P_0) \sim \rho_0 \otimes \mathcal{N}(0,I)\) and the HOH chain \((Y_k, P_k')\) from \((Y_0, P_0') \sim \pi \otimes \mathcal{N}(0,I)\) are coupled through the same noise \(\{\xi_i\}\). Introducing the auxiliary process \((\bar Y_k, \bar P'_k) = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0}(Y_0, P'_0)\), which starts at \((Y_0, P_0')\) but runs BAOAB with the same noise, the split 18 becomes \[\label{eqn-prop-baoab-weak-bias-iteration-decomposition} |X_k - Y_k|_{2,\ell^\infty} \leq \underbrace{|X_k - \bar Y_k|_{2,\ell^\infty}}_{(a)} + \underbrace{|\bar Y_k - Y_k|_{2,\ell^\infty}}_{(b)}\,,\tag{89}\] the contraction between two BAOAB chains \((a)\) and the BAOAB-vs-HOH discretization error \((b)\).

Contraction term. Using the decomposition \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_{k-1}}\cdots \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\xi_0} = \mathsf{U}_{\text{\normalfont\scshape ab},h} \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_{k-1}} \cdots \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_{1}} \mathsf{U}_{\text{\normalfont\scshape bao},h}^{\xi_0}\) of Section 2.3 and the weighted position propagators 26 , \[\label{eqn-weighted-matrix-representation-weak-interaction} X_k - \bar Y_k = \begin{bmatrix} I & 0 \end{bmatrix} W^{-1} M_{\text{\normalfont\scshape ab}}^w (H_{k}) M_{\text{\normalfont\scshape abao}}^w(H_{k-1}) \cdots M_{\text{\normalfont\scshape abao}}^w(H_1)M_{\text{\normalfont\scshape bao}}^w(H_0) W\Delta Z_0\,,\tag{90}\] with \(\Delta Z_0 = (X_0-Y_0, P_0 - P'_0)\) and the matrices defined through the intermediate iterates \[\begin{align} &z_1\mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape bao},h}^{\xi_0}(X_0, P_0)\,, \quad z_1'\mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape bao},h}^{\xi_0}(Y_0, P_0')\,, \quad z_{k+1} \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape ab},h}z_{k}\,, \quad z_{k+1}' \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape ab},h} z_{k}'\,,\\ &z_i \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_{i-1}} \cdots \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_1}z_1\,, \quad z_i' \mathrel{\vcenter{:}}= \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_{i-1}} \cdots \mathsf{U}_{\text{\normalfont\scshape abao},h}^{\xi_1}z_1'\,, \quad 2\leq i \leq k\,, \end{align}\] satisfying \[\begin{align} & W(z_1 - z_1') = M_{\text{\normalfont\scshape bao}}^w(H_0)W\Delta Z_0\,, \quad W(z_{k+1} - z_{k+1}') = M_{\text{\normalfont\scshape ab}}^w(H_k)W(z_{k}-z_{k}')\,,\\ & W(z_i -z_i') = M_{\text{\normalfont\scshape abao}}^{w}(H_{i-1}) W(z_{i-1}- z_{i-1}')\,, \quad 2\leq i \leq k\,. \end{align}\] By Proposition 12 and \(|\begin{bmatrix} I & 0 \end{bmatrix}W^{-1}|_{\ell^\infty} = 1 + \frac{b}{\sqrt{a-b^2}}\), \[(a) \leq 6\Big(1 + \tfrac{b}{\sqrt{a-b^2}}\Big) ( 1 - \tfrac12c(h))^{k-1}|\Delta Z_0|_{2,\ell^\infty_w}\,.\]

Discretization error. Write \((\Delta_q^{l}, \Delta_p^{l}) = (\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{l} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{l})(q^*, p^*)\). The matrix representation of \(\mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k-(i+1)\tilde{l}}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}})(q^*, p^*)\) parallels 90 , with \(\Delta Z_0 = (\Delta_q^{\tilde{l}}, \Delta_p^{\tilde{l}})\) and Hessians along the intermediate iterates. Each term of the telescoping decomposition 19 is thus bounded by \[\label{eqn-baoab-discretization-error-individual-term-with-propagation} \begin{align} &|\mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k-(i+1)\tilde{l}}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}}) (q^*, p^*)|_{2,\ell^\infty}\\ &\qquad \leq 6\Big(1 + \tfrac{b}{\sqrt{a-b^2}}\Big) ( 1 - \tfrac12c(h))^{k-(i+1)\tilde{l} - 1}|(\Delta_{q}^{\tilde{l}}, \Delta_p^{\tilde{l}})|_{2,\ell^\infty_w}\,, \end{align}\tag{91}\] \[\label{eqn-baoab-last-step-discretization-error} \left|\mathsf{\Pi}_1\left(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k-\lfloor k/\tilde{l} \rfloor \tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{k - \lfloor k/\tilde{l} \rfloor \tilde{l}}\right)(q^*, p^*)\right|_{2,\ell^\infty} \leq \Big(1 + \tfrac{b}{\sqrt{a-b^2}}\Big)|(\Delta_q^{k - \lfloor k/\tilde{l}\rfloor \tilde{l}}, \Delta_p^{k - \lfloor k/\tilde{l}\rfloor \tilde{l}})|_{2,\ell^\infty_w}\,.\tag{92}\] In 91 , when \(i = \lfloor k/\tilde{l} \rfloor -1\) there may be no internal ABAO steps and the exponent can be negative, so we instead bound the operator by \(6(1+\tfrac{b}{\sqrt{a-b^2}})\), accounting for the \(\mathsf{B}\mathsf{A}\mathsf{O}\) and \(\mathsf{A}\mathsf{B}\) prefactors. Proposition 25 gives for any \(l \leq \tilde{l}\) \[|(\Delta_q^l, \Delta_p^l)|_{2,\ell^\infty_w} \leq \exp\left[(\tilde{l}-1)h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta} + \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}} + \sqrt\beta\Big)\right] E_{\tilde{l}}\,.\] Substituting these into 89 , with \(X_0, Y_0\) optimally coupled so \(W_{2,\ell^\infty}(\rho_0, \pi) = |X_0-Y_0|_{2,\ell^\infty}\) and \(P_0' = P_0\), \[\label{eqn-term-by-term-k-step-error-UL-weak} \begin{align} &|X_k - Y_k|_{2,\ell^\infty} \leq 6 \Big(1 + \tfrac{b}{\sqrt{a-b^2}}\Big) \left( 1 - \tfrac12c(h)\right)^{k-1}W_{2,\ell^\infty}(\rho_0,\pi) + \Big(1 + \tfrac{b}{\sqrt{a-b^2}}\Big)\\ &\quad \cdot\left( 7 + \sum_{i=0}^{\lfloor k / \tilde{l}\rfloor-2} 6(1-\tfrac12c(h))^{k-(i+1)\tilde{l}-1}\right) \exp\left[(\tilde{l}-1)h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta} + \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}}+\sqrt\beta\Big)\right] E_{\tilde{l}}\,. \end{align}\tag{93}\] Under the weak interaction assumption \(|H_i^{(O)}|_{\ell^\infty} \leq \alpha/20\), the constants of Proposition 24 satisfy \(C_5 \leq \tfrac{21}{20}\beta\) and \(C_6 \leq (\tfrac{21}{20})^2\beta^2\), so that \(C_5/\beta\) and \(C_6/\beta^2\) are \(O(1)\). Since \((\tilde{l}-1)h\sqrt\beta = O(1)\) by the choice \(\tilde{l} = \lceil 1/(2\sqrt\beta h)\rceil\), the exponential is \(O(1)\), and substituting \(E_{\tilde{l}}\) gives \[\exp\left[(\tilde{l}-1)h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta} + \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}} + \sqrt\beta\Big)\right] E_{\tilde{l}} = O\Big(\frac{h^2\sqrt\beta}{1-\eta}\sqrt{\log(2d)}\Big)\,.\]

As \(k \to \infty\), the first term vanishes. For the geometric sum, with \(c(h) = \frac{\alpha h^2}{4(1-\eta)}\) and \(\tilde{l} \geq 1/(2\sqrt\beta h)\), the inequality \(1-(1-x)^{\tilde{l}} \geq \tilde{l} x - \tfrac12(\tilde{l} x)^2\) for \(x>0\) gives \[1 - (1- \tfrac12c(h))^{\tilde{l}} \geq \frac{63}{1024}\frac{\alpha h}{\sqrt\beta (1-\eta)}\,,\] so that \(\sum_{i=0}^{\lfloor k/\tilde{l}\rfloor - 2} 6(1-\tfrac12 c(h))^{k-(i+1)\tilde{l} - 1} \leq 6/(1-(1-\tfrac12 c(h))^{\tilde{l}}) = O(\tfrac{\sqrt\beta(1-\eta)}{\alpha h})\). Since \(1 + \tfrac{b}{\sqrt{a-b^2}} = O(1)\), 93 becomes \[W_{2,\ell^\infty}(\pi_h, \pi) \leq O(1)\cdot O\Big(\frac{\sqrt\beta(1-\eta)}{\alpha h}\Big)\cdot O\Big(\frac{h^2\sqrt\beta}{1-\eta}\sqrt{\log(2d)}\Big) = O\Big(\frac{\beta}{\alpha}h\sqrt{\log(2d)}\Big)\,.\] ◻

Proof of the UL case of Theorem 2. As in the HMC sparse case, we induce an \(\ell^\infty\) contraction from the \(\ell^2\) contraction over multiple steps. We partition the \(k\) steps into blocks of \(B\) steps, with \(B\) specified below. We use the three processes \((X_k, P_k), (Y_k, P'_k), (\bar Y_k, \bar P'_k)\) of the proof of the UL case of Theorem 1 with \(P_0 = P_0' = \bar P'_0\), and the decomposition \[\label{eqn-prop-baoab-sparse-bias-iteration-decomposition} |X_k - Y_k|_{2,\ell^\infty} \leq \underbrace{|X_k - \bar Y_k|_{2,\ell^\infty}}_{(a)} + \underbrace{|\bar Y_k - Y_k|_{2,\ell^\infty}}_{(b)}\,.\tag{94}\]

Contraction term. Corollary 1 gives \[\label{eqn-part-a-baoab-sparse} (a) \leq 14\sqrt{d}(1-c(h))^{\frac{k-1}{2}}|X_0 - Y_0|_{2,\ell^\infty}\,,\tag{95}\] which vanishes as \(k \to \infty\).

Discretization error. The telescoping decomposition 19 accumulates a local error every \(\tilde{l} = \lceil \frac{1}{2\sqrt\beta h} \rceil\) steps, each propagated through the later steps. Write \((\Delta_q^l, \Delta_p^l) = (\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{l} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{l})(q^*, p^*)\) for an \(l\)-step error, with \((q^*, p^*) \sim \pi \otimes \mathcal{N}(0,I)\), and recall that \(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^l, \mathsf{U}_{\text{\normalfont\scshape hoh},h}^l\) are the \(l\)-fold compositions omitting the coupled noise. For the sparse case the constants of Proposition 24 are \(C_5 = \beta\sqrt{s_1}\) and \(C_6 = \beta^2\sqrt{s_2}\), so Proposition 25 bounds the \(\tilde{l}\)-step error, \[|(\Delta_q^{\tilde{l}}, \Delta_p^{\tilde{l}})|_{2,\ell^\infty_w} \leq \exp\left[(\tilde{l}-1)h\Big(\tfrac32\tfrac{C_5}{\sqrt\beta} + \tfrac{1}{16}\tfrac{C_6}{\beta^{3/2}} + \sqrt\beta\Big)\right] E_{\tilde{l}} = O\Big(\frac{h^2\sqrt\beta}{1-\eta}\sqrt{\log(2d)}\Big)\,.\] Setting the block length \(B \mathrel{\vcenter{:}}= K_1 \tilde{l}\) with \(K_1\) specified later and grouping the trailing steps in 19 into full blocks of \(B\) steps followed by residual steps, \[\label{eqn-multi-step-baoab-discretization-error-block-decomposition-propagation} \begin{align} (b) & \leq \sum_{i=0}^{\lceil\frac{\lfloor k/ \tilde{l} \rfloor}{K_1}\rceil}\sum_{k_1=0}^{K_1-1}\left| \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{j_{k_1}}\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{iB}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}})(q^*, p^*)\right|_{2,\ell^\infty}\\ & \quad + \left| \mathsf{\Pi}_1\left(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{k - \lfloor k/\tilde{l} \rfloor \tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{k - \lfloor k / \tilde{l} \rfloor \tilde{l}} \right)(q^*, p^*)\right|_{2,\ell^\infty}\,, \end{align}\tag{96}\] where \(i\) counts the full \(B\)-step blocks, \(k_1 \in \{0, \dots, K_1-1\}\) indexes the residual \(\tilde{l}\)-step groups, and \(j_{k_1} \mathrel{\vcenter{:}}= k - \lfloor k /\tilde{l}\rfloor \tilde{l} + k_1\tilde{l}\) is the corresponding number of trailing steps.

Each summand in the first sum is one \(\tilde{l}\)-step error propagated through \(iB\) full-block steps and \(j_{k_1}\) trailing steps. For two initial states \((x,p), (y, p')\), Proposition 8 and 27 give the weighted matrix-polynomial form of the propagated position difference over the residual steps, \[\label{eqn-baoab-individual-discretization-error-matrix-polynomial} \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{j_{k_1}} (x,p) - \mathsf{\Pi}_1\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{j_{k_1}} (y,p') = \begin{bmatrix} \tilde{T}_{j_{k_1}}^\eta & - \tfrac{b}{\sqrt{a-b^2}} \tilde{T}_{j_{k_1}}^\eta + \tfrac{1}{\sqrt{a-b^2}}h\tilde{U}_{j_{k_1}-1}^\eta \end{bmatrix} W \begin{bmatrix} x- y \\ p - p' \end{bmatrix}\,,\tag{97}\] the polynomials evaluated at matrices of the form \(I - \tfrac{h^2}{2}H\) with \(H\) the integrated Hessians along the intermediate iterates of the two trajectories. Applying this with \((x,p) = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{iB}\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} (q^*, p^*)\) and \((y, p') = \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{iB}\mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}}(q^*, p^*)\), the \(iB\) full-block steps contract the \(\tilde{l}\)-step error by Corollary 1, \[\label{eqn-baoab-contraction-in-discretization-error} |(x-y, p-p')|_{2,\ell^\infty_w} \leq 7\sqrt{2d}(1-c(h))^{\frac{iB-1}{2}} |(\Delta_q^{\tilde{l}}, \Delta_p^{\tilde{l}})|_{2,\ell^\infty_w}\,,\tag{98}\] while Proposition 14 bounds the \(\ell^\infty\) norm of the matrix-polynomial row in 97 . Together they give \[\begin{align} &\left| \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{j_{k_1}}\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{iB}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}})(q^*, p^*)\right|_{2,\ell^\infty}\\ &\qquad \leq 7\sqrt{2d}\Big(14\sqrt{2}+1+\tfrac{2}{\sqrt{3}}\Big)\sqrt{s_{r_{j_{k_1}}}}\, (1-c(h))^{\frac{iB-1}{2}}|(\Delta_q^{\tilde{l}}, \Delta_p^{\tilde{l}})|_{2,\ell^\infty_w}\,. \end{align}\] For \(i=0\) where there are no intermediate full blocks we instead employ \[\left| \mathsf{\Pi}_1 \mathsf{U}_{\text{\normalfont\scshape baoab},h}^{j_{k_1}}(\mathsf{U}_{\text{\normalfont\scshape baoab},h}^{\tilde{l}} - \mathsf{U}_{\text{\normalfont\scshape hoh},h}^{\tilde{l}})(q^*, p^*)\right|_{2,\ell^\infty} \leq \left(14\sqrt{2}+1+\tfrac{2}{\sqrt{3}}\right)\sqrt{s_{r_{j_{k_1}}}}|(\Delta_q^{\tilde{l}}, \Delta_p^{\tilde{l}})|_{2,\ell^\infty_w}\,.\] We now fix \(K_1 = \lceil \frac{16\sqrt\beta(1-\eta)\log(14\sqrt{2d})}{h\alpha}+1\rceil\), so that the per-block factor contracts, \(7\sqrt{2d}(1-c(h))^{\frac{B-1}{2}} \leq \tfrac12\), making the contraction over \(i\) blocks at most \(2^{-i}\). Substituting the \(\tilde{l}\)-step error bound and these per-term estimates into 96 , together with the last-term bound 92 , and summing the geometric factor \(2^{-i}\) over \(i\), we obtain \[\label{eqn-part-b-baoab-sparse} (b) \leq \left(1 + 2\left( 14\sqrt{2}+1+\tfrac{2}{\sqrt{3}}\right)\sum_{k_1=0}^{K_1-1} \sqrt{s_{r_{j_{k_1}}}} \right)O\Big(\frac{h^2\sqrt\beta}{1-\eta}\sqrt{\log(2d)}\Big)\,.\tag{99}\] By an integral comparison as in 88 , with \(s_{r_i}\) increasing in \(i\), \[\begin{align} \sum_{k_1=0}^{K_1-1} \sqrt{s_{r_{j_{k_1}}}} \leq \sum_{k_1=1}^{K_1}\sqrt{s_{r_{k_1\tilde{l}}}} &\leq \sqrt{C}\frac{\left(\tfrac{\tilde{l}e^2\beta (K_1+1)}{1-\eta}h^2+\log\sqrt{d}+2\right)^{\frac{n}{2} + 1}}{(\frac{n}{2} + 1) \frac{\tilde{l} e^2\beta}{1-\eta}h^2}\\ &= \frac{1-\eta}{\sqrt\beta h}\left(O(\tfrac{\beta}{\alpha}\log(2d))\right)^{\frac{n}{2} +1}\,. \end{align}\] Combining with 95 and 99 in 94 and taking \(k \to \infty\), \[W_{2,\ell^\infty}(\pi_h, \pi) = h \sqrt{\log(2d)} \left(O(\tfrac{\beta}{\alpha}\log(2d))\right)^{\frac{n}{2} +1}\,.\] ◻

References↩︎

[1]
B. Leimkuhler and C. Matthews, Molecular dynamics: With deterministic and stochastic numerical methods. Springer, 2015.
[2]
R. M. Neal, MCMC using Hamiltonian dynamics,” in Handbook of markov chain monte carlo, Chapman; Hall/CRC, 2011, pp. 113–162.
[3]
B. Carpenter et al., Stan: A probabilistic programming language,” Journal of Statistical Software, vol. 76, no. 1, pp. 1–32, 2017.
[4]
J. Salvatier, T. V. Wiecki, and C. Fonnesbeck, “Probabilistic programming in Python using PyMC3,” PeerJ Computer Science, vol. 2, p. e55, 2016.
[5]
Y. Chen, X. Cheng, J. Niles-Weed, and J. Weare, “Convergence of unadjusted langevin in high dimensions: Delocalization of bias,” Communications on Pure and Applied Mathematics, vol. 79, no. 6, pp. 1467–1491, 2026.
[6]
S. Duane, A. D. Kennedy, B. J. Pendleton, and D. Roweth, “Hybrid Monte Carlo,” Physics letters B, vol. 195, no. 2, pp. 216–222, 1987.
[7]
H. C. Andersen, “Molecular dynamics simulations at constant pressure and/or temperature,” The Journal of chemical physics, vol. 72, no. 4, pp. 2384–2393, 1980.
[8]
D. Frenkel and B. Smit, Understanding molecular simulation: From algorithms to applications. Elsevier, 2023.
[9]
M. P. Allen and D. J. Tildesley, Computer simulation of liquids. Oxford University Press, 2017.
[10]
B. Leimkuhler and C. Matthews, “Rational construction of stochastic numerical methods for molecular sampling,” Applied Mathematics Research eXpress, vol. 2013, no. 1, pp. 34–56, 2013.
[11]
J. A. C. Eastman Peter AND Swails, OpenMM 7: Rapid development of high performance algorithms for molecular dynamics,” PLOS Computational Biology, vol. 13, no. 7, p. e1005659, 2017.
[12]
M. J. Abraham et al., GROMACS: High performance molecular simulations through multi-level parallelism from laptops to supercomputers,” SoftwareX, vol. 1, pp. 19–25, 2015.
[13]
S. Kieninger and B. G. Keller, GROMACS stochastic dynamics and BAOAB are equivalent configurational sampling algorithms,” Journal of Chemical Theory and Computation, vol. 18, no. 10, pp. 5792–5798, 2022.
[14]
D. A. Case et al., “Recent developments in Amber biomolecular simulations,” Journal of Chemical Information and Modeling, vol. 65, no. 15, pp. 7835–7843, 2025.
[15]
J. A. Rackers et al., Tinker 8: Software tools for molecular design,” Journal of Chemical Theory and Computation, vol. 14, no. 10, pp. 5273–5289, 2018.
[16]
J. C. Phillips et al., “Scalable molecular dynamics on CPU and GPU architectures with NAMD,” The Journal of Chemical Physics, vol. 153, no. 4, p. 044130, 2020.
[17]
A. P. Thompson et al., LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales,” Computer Physics Communications, vol. 271, p. 108171, 2022.
[18]
A. Beskos, N. Pillai, G. Roberts, J.-M. Sanz-Serna, and A. Stuart, “Optimal tuning of the Hybrid Monte-Carlo Algorithm,” Bernoulli, vol. 19, no. 5A, pp. 1501–1534, 2013.
[19]
L. Riou-Durand and J. Vogrinc, “Metropolis adjusted Langevin trajectories: A robust alternative to Hamiltonian Monte Carlo,” arXiv preprint arXiv:2202.13230, 2022.
[20]
Y. Chen and K. Gatmiry, “When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?” arXiv preprint arXiv:2304., 2023.
[21]
M. S. Zhang, J. M. Altschuler, and S. Chewi, “Algorithmic warm starts for Hamiltonian Monte Carlo,” arXiv preprint arXiv:2603.22741, 2026.
[22]
B. Leimkuhler and C. Matthews, “Robust and efficient configurational molecular sampling via Langevin dynamics,” The Journal of Chemical Physics, vol. 138, no. 17, p. 174102, 2013.
[23]
N. Bou-Rabee and M. Marsden, “Unadjusted Hamiltonian MCMC with stratified Monte Carlo time integration,” The Annals of Applied Probability, vol. 35, no. 1, pp. 360–392, 2025.
[24]
P. Monmarché, “High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion,” Electronic Journal of Statistics, vol. 15, no. 2, pp. 4117–4166, 2021.
[25]
O. Mangoubi and A. Smith, “Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators,” in, 2019.
[26]
O. Mangoubi and N. Vishnoi, “Dimensionally tight bounds for second-order Hamiltonian Monte Carlo,” in, 2018.
[27]
N. Bou-Rabee and A. Eberle, “Mixing time guarantees for unadjusted Hamiltonian Monte Carlo,” Bernoulli, vol. 29, no. 1, pp. 75–104, 2023.
[28]
N. Bou-Rabee, S. Mitra, and A. Wibisono, “Tail-sensitive KL and Rényi convergence of unadjusted Hamiltonian Monte Carlo via one-shot couplings,” arXiv preprint arXiv:2601.09019, 2026.
[29]
B. J. Leimkuhler, D. Paulin, and P. A. Whalley, “Contraction and convergence rates for discretized kinetic Langevin dynamics,” SIAM Journal on Numerical Analysis, vol. 62, no. 3, pp. 1226–1258, 2024.
[30]
X. Cheng, N. S. Chatterji, P. L. Bartlett, and M. I. Jordan, “Underdamped Langevin MCMC: A non-asymptotic analysis,” in, 2018.
[31]
A. S. Dalalyan and L. Riou-Durand, “On sampling from a log-concave density using kinetic Langevin diffusions,” Bernoulli, vol. 26, no. 3, pp. 1956–1988, 2020.
[32]
Y.-A. Ma, N. Chatterji, X. Cheng, N. Flammarion, P. Bartlett, and M. I. Jordan, “Is there an analog of Nesterov acceleration for MCMC?” Bernoulli, vol. 27, no. 3, pp. 1942–1992, 2021.
[33]
A. Eberle, A. Guillin, and R. Zimmer, “Couplings and quantitative contraction rates for Langevin dynamics,” The Annals of Probability, vol. 47, no. 4, pp. 1982–2010, 2019.
[34]
K. Schuh and P. A. Whalley, “Convergence of kinetic Langevin samplers for non-convex potentials,” arXiv preprint arXiv:2405.09992, 2024.
[35]
M. Chak and P. Monmarché, “Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case,” IMA Journal of Numerical Analysis, p. draf045, 2025.
[36]
P. Monmarché, “An entropic approach for Hamiltonian Monte Carlo: The idealized case,” The Annals of Applied Probability, vol. 34, no. 2, pp. 2243–2293, 2024.
[37]
E. Camrud, A. Durmus, P. Monmarché, and G. Stoltz, “Second order quantitative bounds for unadjusted generalized Hamiltonian Monte Carlo,” arXiv preprint arXiv:2306.09513, 2023.
[38]
N. Gouraud, P. L. Bris, A. Majka, and P. Monmarché, HMC and underdamped Langevin united in the unadjusted convex smooth case,” SIAM/ASA Journal on Uncertainty Quantification, vol. 13, no. 1, pp. 278–303, 2025.
[39]
R. Shen and Y. T. Lee, “The randomized midpoint method for log-concave sampling,” in, 2019.
[40]
D. Lacker and F. Zhou, “A hierarchical entropy method for the delocalization of bias in high-dimensional Langevin Monte Carlo,” arXiv preprint arXiv:2509.08619, 2025.
[41]
T. Cui, S. Liu, and X. T. Tong, Stein’s method for marginals on large graphical models,” arXiv preprint arXiv:2410.11771, 2024.
[42]
N. Bou-Rabee and K. Schuh, “Convergence of unadjusted Hamiltonian Monte Carlo for mean-field models,” Electronic Journal of Probability, vol. 28, pp. 1–40, 2023.
[43]
A. Durmus and A. Eberle, “Asymptotic bias of inexact Markov chain Monte Carlo methods in high dimension,” The Annals of Applied Probability, vol. 34, no. 4, pp. 3435–3468, 2024.
[44]
N. K. Chada, B. Leimkuhler, D. Paulin, and P. A. Whalley, “Unbiased kinetic Langevin Monte Carlo with inexact gradients,” arXiv preprint arXiv:2311.05025, 2023.
[45]
J. Robnik, R. Cohn-Gordon, and U. Seljak, “Black-box unadjusted Hamiltonian Monte Carlo,” arXiv preprint arXiv:2412.08876, 2024.
[46]
Z. Chen and S. S. Vempala, “Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions,” Theory of Computing, vol. 18, no. 9, pp. 1–18, 2022.
[47]
P. Monmarché, “Almost sure contraction for diffusions on \(\mathbb{R}^d\). Application to generalised Langevin diffusions,” Stochastic Processes and their Applications, vol. 161, pp. 316–349, 2023.
[48]
O. Mangoubi and A. Smith, “Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: Continuous dynamics,” The Annals of Applied Probability, vol. 31, no. 5, pp. 2019–2045, 2021.
[49]
N. Bou-Rabee and J. M. Sanz-Serna, “Randomized Hamiltonian Monte Carlo,” The Annals of Applied Probability, vol. 27, no. 4, pp. 2159–2194, 2017.
[50]
S. Apers, S. Gribling, and D. Szilágyi, “Hamiltonian Monte Carlo for efficient Gaussian sampling: Long and random steps,” Journal of Machine Learning Research, vol. 25, no. 348, pp. 1–30, 2024.
[51]
M. Abramowitz and I. A. Stegun, Handbook of mathematical functions: With formulas, graphs, and mathematical tables. Dover, 1964.

  1. Note that the unadjusted Langevin algorithm (ULA) is instead a discretization of the overdamped Langevin dynamics.↩︎