UBU Splitting in Kinetic Langevin Sampling

• UBU splitting is a symmetric kinetic Langevin integrator that alternates half-steps of the Ornstein–Uhlenbeck transport (U) with a full force (B) update, achieving second-order convergence under smooth potential assumptions.
• The palindromic composition of U-h/2, B-h, and U-h/2 minimizes discretization bias and ensures enhanced contraction and ergodicity properties, outperforming simpler Euler schemes in non‐convex settings.
• Extensions like SG-UBU, SVRG-UBU, and SMS-UBU adapt the scheme to stochastic-gradient and minibatch contexts while preserving its favorable second-order bias reduction and scalable performance.

to=arxiv_search.search 大发彩票官网 无码不卡高清免费 code +="{"query":"UBU splitting kinetic Langevin (Schuh et al., 2024)", "max_results": 10, "sort_by": "relevance"}" to=arxiv_search.search _人人碰 code +="{"query":"\"UBU\" Langevin splitting sampler", "max_results": 10, "sort_by": "relevance"}" to=arxiv_search.search 天天中彩票买 code +="{"query":"(Schuh et al., 2024)", "max_results": 5, "sort_by": "relevance"}" to=arxiv_search.search 彩神争霸如何 code +="{"query":"Convergence of kinetic Langevin samplers for non-convex potentials", "max_results": 5, "sort_by": "relevance"}" to=arxiv_search.search 天天中彩票中了 code +="{"query":"Sampling from Bayesian Neural Network Posteriors with Symmetric Minibatch Splitting Langevin Dynamics UBU", "max_results": 5, "sort_by": "relevance"}" UBU splitting denotes the palindromic kinetic Langevin composition

$$\mathcal U_{h/2}\circ \mathcal B_h\circ \mathcal U_{h/2},$$

where $\mathcal U$ is the universal Ornstein–Uhlenbeck $+$ transport subflow and $\mathcal B$ is the potential or force subflow. In the recent sampling literature, it appears as a symmetric, second-order splitting strategy for underdamped Langevin dynamics, with the most detailed non-convex convergence analysis given in "Convergence of kinetic Langevin samplers for non-convex potentials" (Schuh et al., 2024). In that work, UBU is analyzed alongside Euler discretization and the BU scheme, and is identified as the most accurate scheme among the three under stronger regularity assumptions. Related work studies the same splitting in stochastic-gradient and minibatch settings, including SG-UBU, SVRG-UBU, SAGA-UBU, and SMS-UBU (Lu et al., 6 Nov 2025, Paulin et al., 2024).

1. Continuous dynamics and the splitting principle

The underlying continuous-time process is the kinetic Langevin system

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$

with friction $\gamma>0$. Its invariant measure is the Boltzmann-Gibbs law

$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$

The operator-splitting viewpoint used in the non-convex analysis separates the dynamics into a force step $\mathcal B$ and a universal Ornstein–Uhlenbeck $+$ transport step $\mathcal U$ (Schuh et al., 2024).

In this formulation, UBU is distinguished by its symmetry. The composition

$\mathcal U$0

is a palindromic composition, and the cited analysis attributes to it a higher-quality splitting than Euler. Under additional smoothness assumptions, that structure yields second-order asymptotic bias rather than first-order bias (Schuh et al., 2024).

The same structural description appears in later stochastic-gradient work, where the notation is written as

$\mathcal U$1

with $\mathcal U$2 the linear Ornstein–Uhlenbeck-like part and $\mathcal U$3 the force or gradient part. That paper explicitly describes UBU splitting as a Lie–Trotter/Strang-type splitting of the underdamped Langevin SDE into pieces that can be solved exactly or very cheaply (Lu et al., 6 Nov 2025).

2. Definition of the UBU integrator

For the non-convex kinetic Langevin setting, the force step is

$\mathcal U$4

The $\mathcal U$5-step integrates

$\mathcal U$6

in the weak sense. With $\mathcal U$7, the map is written using Gaussian random variables $\mathcal U$8 as

$\mathcal U$9

where $+$0 and $+$1 are auxiliary Gaussian constructions encoding the correlated Brownian increments for the integrated OU dynamics (Schuh et al., 2024).

The full one-step UBU update is

$+$2

that is,

$+$3

This exact ordering is the defining feature of the scheme (Schuh et al., 2024).

A closely related presentation appears in Bayesian posterior sampling, where the same force impulse is written

$+$4

and the $+$5-half-step is expressed through the exact OU semigroup, with damping factor $+$6. That work emphasizes that the exact treatment of the $+$7 piece and the overall symmetry give second-order accuracy for the full-gradient scheme without Metropolis correction (Paulin et al., 2024).

3. Assumptions, coordinates, and the custom distance

The non-convex theory assumes that $+$8 is $+$9-smooth and strongly convex outside a ball. More precisely, there exist $\mathcal B$0 and $\mathcal B$1 such that

$\mathcal B$2

Equivalently,

$\mathcal B$3

where $\mathcal B$4 is symmetric positive definite with smallest eigenvalue $\mathcal B$5, and $\mathcal B$6 is convex outside the ball of radius $\mathcal B$7 (Schuh et al., 2024).

For the improved UBU bias and complexity theory, the same paper imposes additional regularity, either a Lipschitz Hessian condition or the stronger strongly Hessian Lipschitz condition. This is the point at which the sharper UBU complexity bounds become available (Schuh et al., 2024).

A central technical ingredient is a hybrid synchronous/reflection coupling for the difference variables

$\mathcal B$8

together with the auxiliary combination

$\mathcal B$9

The construction uses synchronous coupling when the chains are far apart and a reflection-type coupling in the small-distance regime (Schuh et al., 2024).

The resulting analysis is organized around two intermediate distances. The large-distance metric is

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$0

while the small-distance metric is

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$1

with

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$2

These are glued into a single metric $\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$3 through a concave increasing function $\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$4,

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$5

The paper proves the equivalence

$\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$6

with $\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$7 independent of $\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$8 and $\begin{cases} dX_t = V_t\,dt,\[2mm] dV_t = -\nabla U(X_t)\,dt - \gamma V_t\,dt + \sqrt{2\gamma}\,dB_t, \end{cases}$9. This is what permits transfer of contraction estimates in $\gamma>0$0 to standard $\gamma>0$1-Wasserstein control (Schuh et al., 2024).

4. Contractivity, ergodicity, and invariant measures

The UBU convergence theorem is obtained by combining the BU contraction estimate with control of the two half-$\gamma>0$2 steps under synchronous coupling. The resulting bound is

$\gamma>0$3

where $\gamma>0$4 is the prefactor arising from the two half-$\gamma>0$5 corrections (Schuh et al., 2024).

Via the equivalence of metrics, the same result yields

$\gamma>0$6

The stated consequences are the existence of a unique invariant measure $\gamma>0$7 for the UBU chain and exponential convergence to it, with constants independent of dimension and step size under the imposed restrictions (Schuh et al., 2024).

The paper situates UBU relative to Euler and BU. Euler–Maruyama is described as the simplest scheme to implement, with one gradient evaluation per step but only first-order asymptotic bias. BU uses the splitting $\gamma>0$8 then $\gamma>0$9, and is analyzed with the same custom metric and coupling framework. UBU retains those coupling ideas while adding control of the half-$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$0 corrections and achieves the best smooth-regime bias behavior among the three schemes (Schuh et al., 2024).

A concise comparison is:

Scheme	Composition	Stated behavior
Euler	Euler discretization	first-order asymptotic bias
BU	$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$1	contraction via the same custom metric/coupling framework
UBU	$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$2	higher-order bias; best complexity in the smooth setting

This suggests that the principal analytical role of UBU is not merely stability, but the conversion of splitting symmetry into stronger invariant-measure control.

5. Discretization bias and complexity

The asymptotic bias is measured as

$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$3

where $\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$4 is the true invariant measure of the diffusion and $\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$5 is the invariant law of the UBU discretization. The argument compares the continuous diffusion and UBU over many steps using synchronized Brownian motion and then uses the contraction estimate to convert pathwise discretization discrepancy into a stationary bias bound (Schuh et al., 2024).

Under only the basic smoothness and non-convex-outside-a-ball assumptions, the paper obtains an $\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$6-type bias: $\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$7 If $\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$8 has Lipschitz Hessian, the bias improves to

$\mu(dx\,dv)\propto e^{-U(x)-|v|^2/2}\,dx\,dv.$9

and under the stronger Hessian-Lipschitz condition the dimension dependence improves further. The paper identifies this as the key point where UBU outperforms Euler: Euler has first-order bias, whereas UBU achieves second-order asymptotic bias with extra smoothness (Schuh et al., 2024).

The total error is decomposed into discretization bias and mixing error. For $\mathcal B$0-accuracy in $\mathcal B$1-Wasserstein distance, the stated complexity bounds are: $\mathcal B$2

$\mathcal B$3

and, under the stronger Hessian condition,

$\mathcal B$4

The abstract of the same paper presents this $\mathcal B$5 rate as the headline UBU complexity guarantee under appropriate regularity assumptions on the target measure (Schuh et al., 2024).

This improved scaling persists in a related 2026 splitting framework based on an exact harmonic Langevin integrator. That work is not literally classical UBU, but it explicitly states that its second-order scheme has step-size requirements comparable to established splitting schemes such as OBABO or UBU, and it reaches the same $\mathcal B$6 scaling for $\mathcal B$7-accuracy (Schuh, 22 May 2026).

6. Stochastic-gradient, minibatch, and mean-field extensions

UBU splitting has been extended beyond the full-gradient, single-particle setting. In SG-UBU, the force term $\mathcal B$8 is replaced by an unbiased estimator $\mathcal B$9, and the update is

$+$0

A notable structural point is that the stochastic gradient is evaluated at the intermediate position $+$1, not at $+$2. The mean-square error analysis in "Mean square error analysis of stochastic gradient and variance-reduced sampling algorithms" shows that SG-UBU has first-order numerical bias in $+$3, with leading coefficient proportional to the stochastic-gradient variance, while the pure discretization contribution remains $+$4 (Lu et al., 6 Nov 2025).

For finite-sum potentials, the same paper studies SVRG-UBU and SAGA-UBU. It reports a phase transition in the numerical bias: for larger step sizes the bias is first order, while below a critical threshold the rate becomes second order. For SVRG-UBU, the threshold is identified as

$+$5

A plausible implication is that the second-order structure of UBU remains visible in stochastic-gradient sampling only when variance reduction is strong enough to suppress the dominant first-order gradient-noise term (Lu et al., 6 Nov 2025).

A separate minibatch extension, SMS-UBU, combines UBU with a symmetric forward/backward sweep over a random partition of the data. Its main theorem gives

$+$6

and the paper advertises this as bias $+$7 despite using one minibatch per iteration. In Bayesian neural network experiments, SMS-UBU is reported to improve calibration metrics relative to standard training and stochastic weight averaging, while remaining cheaper than metropolized alternatives (Paulin et al., 2024).

The full-gradient non-convex paper also extends the UBU analysis to interacting particle systems of mean-field type. For

$+$8

it introduces the particlewise metric

$+$9

and states that the contraction and complexity bounds extend with constants independent of $\mathcal U$0, provided the interaction is sufficiently weak in Lipschitz norm relative to $\mathcal U$1. Combined with propagation-of-chaos estimates, this yields

$\mathcal U$2

for the UBU discretization under the stronger smoothness regime (Schuh et al., 2024).

In current usage, UBU splitting therefore denotes more than a formal symmetric composition. It is a specific second-order kinetic Langevin discretization whose symmetry supports non-convex Wasserstein contraction, second-order invariant-measure bias under higher smoothness, and a family of stochastic-gradient and minibatch variants that attempt to preserve those advantages in scalable regimes (Schuh et al., 2024, Lu et al., 6 Nov 2025, Paulin et al., 2024).