Deterministic Envelopes for Tamed SGLD:
Decoupling Stochastic-Gradient Noise and Localizing Taming
June 03, 2026
Stochastic-gradient Langevin algorithms often use tamed denominators to stabilize non-globally Lipschitz drifts. This paper shows that when the denominator depends on the same stochastic-gradient realization as the numerator, the taming step changes the
stochastic oracle itself and can create a stationary bias even if the original stochastic gradient is unbiased. We propose a structure-preserving framework for designing tamed denominators. It fixes the denominator before the oracle noise is sampled and
uses localized deterministic envelopes to avoid unnecessary taming in typical regions. These kernels keep the stabilizing effect of taming while avoiding the bias introduced by a gradient-dependent denominator. Our theory explains how the stationary error
splits into the bias caused by oracle-dependent taming and the remaining error introduced by deterministic stabilization. Within this deterministic-envelope family, the analysis identifies a far-tail condition that explains the limitation of local soft
envelopes and motivates a hybrid member: soft in the typical region, but protected by hard-tail control on rare excursions. Experiments confirm the predicted stationary distortions of random denominators, the bias reduction of deterministic-envelope
designs, and the stabilizing effect of the hybrid construction.
AMS subject classification: Primary 65C30; Secondary 60H10, 60J22, 60J60, 62F15.
Key Words: Tamed SGLD; deterministic envelopes; stochastic-gradient noise; localized taming; stationary bias.
Stochastic Gradient Langevin Dynamics (SGLD) turns an empirical risk into a noisy sampling dynamics [1], [2]. Given data \[z=(z_1,\ldots,z_N), \qquad F_z(w)=\frac{1}{N}\sum_{i=1}^N f(w,z_i),\] the reference overdamped Langevin diffusion is \[\label{eq:langevin} \,\mathrm{d}X_t=-\nabla F_z(X_t)\,\mathrm{d}t+\sqrt{2\beta^{-1}}\,\mathrm{d}B_t,\tag{1}\] with Gibbs invariant law \[\label{eq:gibbs} \pi_z(\,\mathrm{d}w)=\Lambda_z^{-1}e^{-\beta F_z(w)}\,\mathrm{d}w.\tag{2}\] For polynomial-growth objectives, the continuous Langevin drift may be stabilizing, while the fixed-stepsize explicit Euler update can still be unstable. A simple example is \[F(x)=\frac{1}{4}x^4-\frac{1}{2}x^2, \qquad F'(x)=x^3-x,\] where the far-field Euler increment may overshoot. Taming is therefore needed to make fixed-stepsize explicit simulation meaningful in the superlinear-drift regime.
The design issue is not only how to stabilize the drift. In stochastic-gradient SGLD, the taming factor may also depend on the current stochastic-gradient realization. This coupling can change the conditional mean of the update. We therefore treat the denominator as a design object: its dependence structure determines whether the stochastic-gradient oracle is preserved, and its activation pattern determines where the drift is modified. Deterministic envelopes separate these roles by stabilizing the far-field drift while keeping the oracle structure transparent.
A useful way to locate this question is to separate finite-time sampling error into two parts. If \(\pi_\eta\) denotes an invariant law of the numerical chain, then for any suitable distance \(d\), \[\label{eq:intro-finite-time-split} d(\mathcal{L}(X_k),\pi_z) \le d(\mathcal{L}(X_k),\pi_\eta) + d(\pi_\eta,\pi_z).\tag{3}\] The first term is the mixing error of the numerical chain toward its own invariant law. The second term is the stationary bias created by the discretization, the taming denominator, and the stochastic-gradient oracle; fixed-stepsize SGLD bias and finite-time SGLD analyses have been studied in, for example, [3], [4]. This paper targets the second term: the stationary effect of denominator design in a fixed-step sampling kernel. The numerical experiments show that this component can change substantially across denominator choices.
The construction is analysis-driven. We first isolate the bias mechanism caused by a random denominator, and then design the deterministic envelope to remove that first-order oracle-bias channel. Localized and hybrid envelopes apply the same principle to deterministic taming: instead of damping the drift globally, they choose where taming should turn on.
We use denominators of the form \[1+\eta^\alpha A_\eta(x),\] where the envelope depends only on the current state and the fixed dataset. It does not depend on the current stochastic-gradient realization. Then \[\mathbb{E}\left[\frac{g(x,\xi)}{1+\eta^\alpha A_\eta(x)}\mid x\right] =\frac{\nabla F_z(x)}{1+\eta^\alpha A_\eta(x)}.\] Deterministic taming removes the bias caused by a gradient-dependent denominator, but it still introduces a deterministic drift modification. The design goal is to keep this modification mild where the chain typically moves, while retaining enough stabilization in the far tail. Thus the improvement is structural: stabilization is separated from nonlinear transformation of the stochastic-gradient oracle.
A global hard envelope can be stable but overly conservative. To reduce unnecessary common-region taming, we use a localized deterministic-envelope template rather than a single prescribed rule: \[\label{eq:intro-hybrid-envelope} A_\eta^{c_s,c_h}(x) =c_s\big(\bar A(x)-R\big)_+^\gamma +c_h\big(\bar A(x)-S_\eta\big)_+, \qquad c_s,c_h\in\{0,1\},\quad 0<\gamma\le1,\tag{4}\] where \(\bar A\) is a computable deterministic growth indicator. This template includes local soft \((c_s,c_h)=(1,0)\), local hard \((0,1)\), and hybrid \((1,1)\) envelopes. A nonlocalized global envelope instead uses the growth indicator everywhere, for example \(A_\eta(x)=\bar A(x)\) up to a fixed scaling. Thus the local soft, local hard, and hybrid rules are not different oracle principles; they are different activation patterns for the same deterministic-envelope idea across typical, intermediate, and tail regions.
The contributions are organized around this denominator-design viewpoint:
We isolate the taming denominator as an oracle-level transformation. If the denominator is computed from the same stochastic-gradient realization as the numerator, it can couple the taming factor to the oracle noise and create a systematic mean shift. This elementary mechanism, including its variance and covariance forms, motivates deterministic-envelope designs.
We formulate a structure-preserving framework for tamed denominators. Global, local soft, local hard, and hybrid envelopes are activation patterns of the same deterministic-envelope template, with the hybrid rule combining mild typical-region behavior and hard-tail protection.
We establish the stationary theory for this framework. The analysis gives Lyapunov stability, invariant-measure existence, small-stepsize stationary consistency, and a Poisson-residual decomposition separating oracle-dependent taming bias from the remaining deterministic-envelope residual.
We validate the denominator-design principle in controlled numerical examples. The experiments show the stationary distortions caused by gradient-dependent denominators, the bias reduction obtained by localized deterministic envelopes, and the stabilizing role of the hybrid construction in high-growth and empirical-risk settings.
Taming and truncation are standard stabilization tools for SDEs with non-globally Lipschitz coefficients [5]–[9] and for Langevin-type algorithms with superlinear potentials [10]–[12]. TULA-style methods provide deterministic stabilization for Langevin drifts, while TUSLA-type analyses give finite-time guarantees for stabilized stochastic-gradient Langevin dynamics, including sampling, optimization, and nonconvex learning guarantees [13], [14].
The present paper takes a different viewpoint. We study the denominator as part of the stochastic-gradient oracle in a fixed-step sampling kernel. This makes the distinction between a denominator fixed before the oracle noise is sampled and a denominator coupled to the sampled stochastic gradient explicit. A concrete gradient-dependent example is the tamed stochastic-gradient direction \[\frac{\nabla f(\xi_n,w_n)}{1+\alpha_n\|\nabla f(\xi_n,w_n)\|},\] where the normalization is applied to the current stochastic-gradient realization [15]. Table 1 summarizes the comparison.
3pt
| Class | Denominator / normalization | Main analytical target | Relation to this paper |
|---|---|---|---|
| TULA-type Langevin taming | Deterministic drift, state, or full-gradient normalization | Stability and sampling error for deterministic superlinear drift | Background stabilization |
| TUSLA-type stochastic-gradient taming | Step-size, state, or growth dependent taming of stochastic-gradient dynamics | Finite-time sampling, optimization, or excess-risk control in nonconvex learning | Finite-time tamed SGLD theory |
| Gradient-dependent denominator | Normalization by the sampled gradient magnitude, e.g. \(1+\alpha_n\|\nabla f(\xi_n,w_n)\|\) | Stabilized stochastic-gradient descent or stochastic approximation | Oracle-coupled baseline |
| Deterministic global envelope | \(1+\eta^\alpha A(x)\) or a prescribed deterministic envelope | Oracle-preserving stabilization with a deterministic drift modification | Conservative deterministic baseline |
| Local/hybrid deterministic envelope | Inactive safe region, soft intermediate region, hard-tail safeguard | Stable tamed SGLD with localized deterministic residual | Proposed localized design |
Section 2 develops the oracle-transformation viewpoint. Section 3 defines the polynomial-growth Langevin model, deterministic-envelope recursions, and global/local/hybrid envelope family. Sections 4–5 establish moment stability, invariant-measure existence, and small-stepsize stationary consistency. Section 6 decomposes exact-gradient finite-stepsize stationary bias into Euler and deterministic-envelope residuals. Section 7 extends the framework to stochastic-gradient kernels, Section 8 gives numerical evidence, and Section 9 discusses the stationary-bias viewpoint and extensions.
In this section we view taming denominators as transformations of the stochastic-gradient oracle. For an oracle output \(v\), a deterministic-envelope transformation is \[\mathcal{T}_\eta^{\rm det}(x,v) =\frac{v}{1+\eta^\alpha A_\eta(x)}.\] A gradient-dependent transformation is instead \[\mathcal{T}_\lambda^{\rm gd}(v) =\frac{v}{1+\lambda\|v\|}.\] The distinction is structural: conditional on \(x\), a deterministic-envelope denominator is fixed, whereas a gradient-dependent denominator remains coupled to the current oracle realization.
Let \(g(x,\xi)\) be a stochastic-gradient oracle satisfying \[\label{eq:oracle-unbiased-intro} \mathbb{E}[g(x,\xi)\mid x]=\nabla F_z(x).\tag{5}\] For a deterministic envelope \(A_\eta(x)\), define the tamed oracle \[G_\eta^{\rm det}(x,\xi)=\frac{g(x,\xi)}{1+\eta^\alpha A_\eta(x)}.\]
Observation 1 (Oracle-preservation identity). If 5 holds and \(A_\eta(x)\) depends only on \(x\), then \[\label{eq:oracle-preservation} \mathbb{E}[G_\eta^{\rm det}(x,\xi)\mid x] =\frac{\nabla F_z(x)}{1+\eta^\alpha A_\eta(x)}.\qquad{(1)}\]
Because the denominator is state-measurable, a deterministic envelope preserves the conditional mean of the stochastic-gradient oracle relative to the modified drift. This matters for fixed-stepsize sampling because a denominator-induced drift perturbation changes the Markov transition whose invariant law is being approximated. The next result quantifies the corresponding drift bias for gradient-dependent denominators; later sections use this diagnostic to motivate the envelope family and the stationary residual decomposition.
Proposition 2 (Variance-induced bias of gradient-dependent denominator taming). Let \(g>0\) be a one-dimensional positive random variable with \(\mathbb{E}g=\mu\) and \(\mathbb{E}g^3<\infty\). For \(\lambda\downarrow0\), \[\label{eq:variance-induced-bias} \mathbb{E}\left[\frac{g}{1+\lambda g}\right] -\frac{\mu}{1+\lambda\mu} =-\lambda\operatorname{Var}(g)+O(\lambda^2).\qquad{(2)}\] In particular, gradient-dependent denominator taming introduces a first-order drift distortion proportional to the oracle variance.
Proof. Use \((1+\lambda g)^{-1}=1-\lambda g+\lambda^2g^2+O(\lambda^3g^3)\) and the corresponding expansion for \((1+\lambda\mu)^{-1}\). Then \[\mathbb{E}\left[\frac{g}{1+\lambda g}\right] =\mu-\lambda\mathbb{E}[g^2]+O(\lambda^2), \qquad \frac{\mu}{1+\lambda\mu} =\mu-\lambda\mu^2+O(\lambda^2),\] which gives ?? . ◻
Remark 3 (Absolute-value denominators). Proposition 2 uses the scalar calculation with \(1+\lambda g\) to display the variance mechanism in its cleanest form. The same oracle-coupling effect is present for the absolute-value normalization commonly used in scalar tamed stochastic-gradient updates. Indeed, if \(G\) is a scalar oracle with \(\mathbb{E}|G|^3<\infty\) and \(\mu=\mathbb{E}G\), then, as \(\lambda\downarrow0\), \[\mathbb{E}\left[\frac{G}{1+\lambda |G|}\right] - \frac{\mu}{1+\lambda |\mu|} = -\lambda\left(\mathbb{E}[G|G|]-\mu|\mu|\right) +O\left(\lambda^2\mathbb{E}|G|^3\right).\] When \(G\) has a fixed positive sign, this reduces to the variance term \(-\lambda\operatorname{Var}(G)+O(\lambda^2)\). If \(G\) can cross zero, the nondifferentiability of \(|\cdot|\) changes the first-order coefficient. It does not restore the conditional-mean identity. Thus absolute-value taming remains a gradient-dependent oracle transformation rather than an oracle-preserving deterministic envelope.
Example 1 (A two-point oracle). Let \(G\) be a scalar unbiased oracle with \[G= \begin{cases} 0, & \text{with probability }1/2,\\ 2\mu, & \text{with probability }1/2. \end{cases}\] Then \(\mathbb{E}G=\mu\), but \[\mathbb{E}\left[\frac{G}{1+\lambda G}\right] =\frac{\mu}{1+2\lambda\mu} \ne \frac{\mu}{1+\lambda\mu} = \frac{\mathbb{E}G}{1+\lambda\mathbb{E}G}.\] Thus even this elementary unbiased oracle is not preserved by a gradient-dependent denominator.
Proposition 4 (High-dimensional first-order oracle distortion). Let \(G\in\mathbb{R}^d\) be an unbiased vector oracle with \(\mathbb{E}G=\mu\ne0\) and \(\mathbb{E}\|G\|^3<\infty\). Define \[T_\lambda(v)=\frac{v}{1+\lambda\|v\|},\qquad v\in\mathbb{R}^d .\] Then, as \(\lambda\downarrow0\), \[\label{eq:vector-first-order-bias} \mathbb{E}[T_\lambda(G)]-T_\lambda(\mu) =-\lambda\bigl(\mathbb{E}[G\|G\|]-\mu\|\mu\|\bigr) +O\bigl(\lambda^2\mathbb{E}\|G\|^3\bigr).\qquad{(3)}\] Moreover, if \(G=\mu+\varepsilon\xi\), where \(\mathbb{E}\xi=0\), \(\mathbb{E}\|\xi\|^3<\infty\), and \(\Sigma=\mathbb{E}[\xi\xi^\top]\), then \[\label{eq:small-noise-directional-bias} \mathbb{E}[G\|G\|]-\mu\|\mu\| =\varepsilon^2\left[ \frac{\Sigma\mu}{\|\mu\|} +\frac{\mu}{2\|\mu\|} \left(\operatorname{tr}\Sigma- \frac{\mu^\top\Sigma\mu}{\|\mu\|^2}\right) \right]+O(\varepsilon^3).\qquad{(4)}\] The component \(\Sigma\mu/\|\mu\|\) is parallel to \(\mu\) only when \(\mu\) is an eigenvector of \(\Sigma\). Thus a genuine directional rotation appears precisely when the oracle covariance is not aligned with the mean-gradient direction; in isotropic or aligned cases the leading effect is a scalar shrinkage.
Proof. The expansion \[\frac{v}{1+\lambda\|v\|}=v-\lambda v\|v\|+O(\lambda^2\|v\|^3)\] with \(v=G\) and \(v=\mu\) gives ?? . For the small-noise expansion, write \(r=\|\mu\|\) and \(u=\mu/r\). Taylor expansion of the norm gives \[\|\mu+\varepsilon\xi\| =r+\varepsilon u^\top\xi+ \frac{\varepsilon^2}{2r}\bigl(\|\xi\|^2-(u^\top\xi)^2\bigr)+O(\varepsilon^3\|\xi\|^3).\] Multiplying by \(\mu+\varepsilon\xi\), taking expectations, and using \(\mathbb{E}\xi=0\) yields \[\mathbb{E}[(\mu+\varepsilon\xi)\|\mu+\varepsilon\xi\|]-\mu r =\varepsilon^2\left[\Sigma u+ \frac{\mu}{2r}\bigl(\operatorname{tr}\Sigma-u^\top\Sigma u\bigr)\right]+O(\varepsilon^3),\] which is ?? . ◻
Example 2 (A two-dimensional transverse component). Take \(\mu=e_1=(1,0)^\top\) and let the small-noise covariance be \[\Sigma_\rho=\begin{pmatrix}1&\rho\\ \rho&1\end{pmatrix}, \qquad |\rho|<1.\] Then \(\|\mu\|=1\) and \(\Sigma_\rho\mu=(1,\rho)^\top\). Hence the first term in ?? has a transverse component \(\rho e_2\). Consequently, \[\mathbb{E}[T_\lambda(G)]-T_\lambda(\mu) =-\lambda\varepsilon^2\bigl(c_{\parallel} e_1+\rho e_2\bigr) +O(\lambda\varepsilon^3+\lambda^2),\] for an explicit scalar \(c_{\parallel}\) depending on the parallel component. If \(\rho=0\), the leading distortion is aligned with \(\mu\). If \(\rho\ne0\), the gradient-dependent denominator produces a transverse first-order bias. This illustrates the precise sense in which high-dimensional oracle distortion can be directional: it requires misalignment between the oracle covariance and the mean-gradient direction.
We now turn the oracle-level mechanism into the concrete tamed Langevin kernels used in the rest of the paper. This section fixes the deterministic setting: the drift assumptions, the envelope conditions, and the exact-gradient fixed-stepsize recursion. The stochastic-gradient kernel is introduced later, after the exact-gradient stationary structure has been established.
Throughout, the dataset \(z\) is fixed and \[b(x)=b_z(x)=-\nabla F_z(x).\] The Langevin generator is \[\label{eq:generator} \mathcal{L}_zf(x)=\langle b(x),\nabla f(x)\rangle+\beta^{-1}\Delta f(x).\tag{6}\] Constants may depend on structural parameters such as \(d,\beta,p\), polynomial-growth orders, and Lyapunov constants, but not on the iteration index or on sufficiently small \(\eta\), unless explicitly stated.
Assumption 1 (Polynomial local Lipschitz drift). There exist constants \(L>0\) and \(r>0\) such that for all \(x,y\in\mathbb{R}^d\), \[\label{eq:poly-lip} \|b(x)-b(y)\|\le L(1+\|x\|^r+\|y\|^r)\|x-y\|.\qquad{(5)}\] Moreover, \[\label{eq:grad-b-growth} \|\nabla b(x)\|_{\mathrm{op}}\le L(1+\|x\|^r).\qquad{(6)}\]
Assumption 2 (Dissipativity). There exist constants \(m>0\) and \(b_0\ge0\) such that \[\label{eq:dissipative} \langle x,b(x)\rangle\le b_0-m\|x\|^{r+2},\qquad x\in\mathbb{R}^d.\qquad{(7)}\]
Assumption 3 (Taming envelope). There is a deterministic continuous envelope \(A:\mathbb{R}^d\to[0,\infty)\) and constants \(C_A,L_A>0\) such that \[\label{eq:envelope-dom} \|\nabla b(x)\|_{\mathrm{op}}\le A(x)\le L_A(1+\|x\|^r),\qquad{(8)}\] \[\label{eq:taming-compatible} \frac{\|b(x)\|}{1+A(x)}\le C_A(1+\|x\|),\qquad x\in\mathbb{R}^d.\qquad{(9)}\]
The assumptions have separate roles. Assumptions 1–2 describe a polynomial-growth dissipative drift. Assumption 3 describes an envelope that controls the far-field size of the explicit drift increment. The compatibility bound ?? is the key point; it will be used below to make the tamed increment effectively linear.
Here “deterministic” means that the denominator depends only on the current state and the fixed dataset. It is not computed from the fresh stochastic-gradient sample used in the current update. This convention becomes the oracle-preservation condition in Section 7.
Localized envelopes below are built from a deterministic growth indicator \(\bar A\). It is used only to decide where the envelope becomes active; the actual envelope in the update is \(A_\eta\). For example, \(\bar A\) may satisfy \[\|\nabla F_z(x)\|\le \bar A(x)\le C(1+\|x\|^{r+1}).\]
Example 3 (Quartic empirical risk). Consider the regularized quartic empirical risk \[\label{eq:quartic-risk} F_z(w)=\frac{1}{N}\sum_{i=1}^N \frac{1}{4}(a_i^\top w-y_i)^4+\frac{\lambda}{2}\|w\|^2, \qquad \lambda>0.\qquad{(10)}\] Assume that the data are bounded and that the quartic loss is coercive in all directions, for instance under a standard nondegeneracy condition on the covariates. Then \(b(w)=-\nabla F_z(w)\) has cubic growth, while \(\nabla b(w)\) has quadratic growth. Hence the polynomial local-Lipschitz condition holds with \(r=2\), and the coercivity gives the order-four dissipativity required in Assumption 2. Moreover, a Hessian-type deterministic envelope \[A(w)=C_z(1+\|w\|^2)\] satisfies \[\|\nabla b(w)\|_{\mathrm{op}}\le A(w), \qquad \frac{\|b(w)\|}{1+A(w)}\le C(1+\|w\|).\] Thus this quartic empirical-risk class gives a non-globally Lipschitz example covered by the structural assumptions.
We next define a family of localized deterministic envelopes. The oracle principle is unchanged: the denominator is still fixed by the current state and dataset. The different members only specify where the deterministic correction becomes active.
Definition 1 (Localized deterministic-envelope family). Let \(\bar A:\mathbb{R}^d\to[0,\infty)\) be a deterministic growth indicator. For parameters \(R\ge0\), \(0<\gamma\le1\), a threshold \(S_\eta\ge R\), and activation indicators \(c_s,c_h\in\{0,1\}\), define \[\label{eq:hybrid-envelope} A_\eta^{c_s,c_h}(x) \mathrel{\vcenter{:}}= c_s\big(\bar A(x)-R\big)_+^\gamma+c_h\big(\bar A(x)-S_\eta\big)_+.\qquad{(11)}\]
The threshold \(R\) defines the safe region \[\mathcal{S}_R \mathrel{\vcenter{:}}= \{x:\bar A(x)\le R\}.\] If \(S_\eta>R\), the intermediate region is \[\mathcal{I}_{R,S_\eta} \mathrel{\vcenter{:}}= \{x:R<\bar A(x)\le S_\eta\}.\] The far-tail region is \[\mathcal{T}_{S_\eta} \mathrel{\vcenter{:}}= \{x:\bar A(x)>S_\eta\}.\] We call these envelopes localized because they are inactive on the safe region and become active only after the prescribed growth thresholds are crossed. The exponent \(\gamma\) defines the soft component: it lets taming turn on gradually after the safe region, so that the intermediate region can be controlled without unnecessary drift modification. This soft component is not meant to be the extreme-tail stabilizer; when \(\gamma<1\), it may grow too slowly to control rare large excursions by itself. The second term is therefore the hard-tail safeguard, active only in \(\mathcal{T}_{S_\eta}\). The hybrid envelope combines soft intermediate control with hard-tail protection. The local soft, local hard, and hybrid envelopes are \[A_\eta^{\rm soft} \mathrel{\vcenter{:}}= A_\eta^{1,0},\qquad A_\eta^{\rm hard} \mathrel{\vcenter{:}}= A_\eta^{0,1},\qquad A_\eta^{\rm hyb} \mathrel{\vcenter{:}}= A_\eta^{1,1}.\]
In Lemma 1 below, we choose \(S_\eta=c_S\eta^{-\alpha}\) precisely to obtain the effective-linearity bound ?? . Its fixed-stepsize interpretation is discussed in the envelope-design remarks below.
Remark 5 (Selective taming). The localized family is designed to avoid taming the drift everywhere. A global envelope is the safest baseline, but it can also shrink the drift in regions where the target law places most of its mass. Since the deterministic-envelope residual in Section 6 contains the factor \(A_\eta(x)\|b(x)\|\), unnecessarily large envelope values in such regions can increase finite-stepsize stationary error. The parameters \(R\), \(S_\eta\), and \(\gamma\) specify where taming is inactive, where it turns on softly, and where a hard-tail safeguard begins. Soft localization is useful when there is no sharp boundary between the common region and the tail, while a hard-tail safeguard is needed when one wants the general effective-linearity bound used in the Lyapunov proof. The hybrid rule combines these two roles.
Later results for a deterministic envelope \(A_\eta\) apply to any localized envelope satisfying the stated conditions.
The later stability theory uses the effective-linearity consequence of Assumption 3. Global envelopes satisfy this condition by assumption. Localized rules require a separate check. The check below assumes that the growth indicator itself has global-envelope-type far-field control. It then shows that rules with a hard-tail safeguard, such as local hard and hybrid envelopes, retain the needed control. Local soft rules do not satisfy this bound automatically; Remark 6 explains the resulting far-tail limitation and the motivation for adding a hard-tail safeguard.
Lemma 1 (Effective-linearity bound for localized envelopes with a hard-tail safeguard). Let \(S_\eta=c_S\eta^{-\alpha}\). Let \(A_\eta^{c_s,1}\) be a localized envelope from ?? with a hard-tail safeguard. Assume that the deterministic growth indicator satisfies \[\label{eq:localized-growth-compatibility} \frac{\|b(x)\|}{1+\bar A(x)}\le C_b(1+\|x\|), \qquad \bar A(x)\le C_b(1+\|x\|^r).\qquad{(12)}\] Then there is a constant \(C\), independent of sufficiently small \(\eta\), such that \[\label{eq:localized-step-control} \eta\frac{\|b(x)\|}{1+\eta^\alpha A_\eta^{c_s,1}(x)} \le C\eta^{1-\alpha}(1+\|x\|), \qquad x\in\mathbb{R}^d .\qquad{(13)}\] Moreover, \(A_\eta^{c_s,1}\) has the same polynomial upper growth as \(\bar A\): \[\label{eq:localized-upper-growth} A_\eta^{c_s,1}(x) \le C(1+\bar A(x)) \le C(1+\|x\|^r).\qquad{(14)}\]
Proof. The upper-growth bound follows from \(0<\gamma\le1\): \[(\bar A-R)_+^\gamma+(\bar A-S_\eta)_+ \le 1+2\bar A .\] We prove the displacement estimate by separating the regions defined by the two thresholds. The additional split at \(2S_\eta\) is only technical. The factor \(2\) has no special meaning; any fixed factor larger than one would work with different constants.
First, on the safe region \(\bar A(x)\le R\), the localized envelope is inactive. Since \(R\le S_\eta\) for all sufficiently small \(\eta\), ?? gives \[\eta\frac{\|b(x)\|}{1+\eta^\alpha A_\eta^{c_s,1}(x)} =\eta\|b(x)\| \le C\eta(1+R)(1+\|x\|) \le C\eta(1+S_\eta)(1+\|x\|).\] With \(S_\eta=c_S\eta^{-\alpha}\), this is bounded by \(C\eta^{1-\alpha}(1+\|x\|)\).
Second, on the intermediate region \(R<\bar A(x)\le S_\eta\), the denominator is at least one. Hence \[\eta\frac{\|b(x)\|}{1+\eta^\alpha A_\eta^{c_s,1}(x)} \le \eta\|b(x)\| \le C\eta(1+\bar A(x))(1+\|x\|) \le C\eta(1+S_\eta)(1+\|x\|) \le C\eta^{1-\alpha}(1+\|x\|).\] This is the region where the soft part may be active, but the growth indicator is still below the hard-tail threshold.
Third, consider the moderate-tail region \(S_\eta<\bar A(x)\le 2S_\eta\). The hard-tail safeguard is active, but it need not yet dominate \(\bar A(x)\) inside the denominator. The key point is that \(\bar A(x)\) is still bounded by a constant multiple of the threshold \(S_\eta=c_S\eta^{-\alpha}\). Therefore the same argument as in the preceding case, using only the lower bound \(1+\eta^\alpha A_\eta^{c_s,1}(x)\ge1\), gives \[\eta\frac{\|b(x)\|}{1+\eta^\alpha A_\eta^{c_s,1}(x)} \le C\eta^{1-\alpha}(1+\|x\|).\]
Finally, on the extreme-tail region \(\bar A(x)>2S_\eta\), the hard-tail safeguard controls the growth indicator: \[(\bar A(x)-S_\eta)_+\ge \frac{1}{2}\bar A(x).\] Hence \[1+\eta^\alpha A_\eta^{c_s,1}(x) \ge 1+\frac{1}{2}\eta^\alpha\bar A(x).\] Using ?? , \[\eta\frac{\|b(x)\|}{1+\eta^\alpha A_\eta^{c_s,1}(x)} \le 2\eta^{1-\alpha}\frac{\|b(x)\|}{1+\bar A(x)} \le C\eta^{1-\alpha}(1+\|x\|).\] Combining the four regimes proves ?? . The proof also explains the role of the hard-tail safeguard: without such a term, a local soft envelope need not provide a uniform effective-linearity bound in the extreme tail. ◻
The preceding proof also gives a useful diagnostic for local soft rules.
Remark 6 (Far-tail limitation of local soft envelopes). The effective-linearity proof needs the envelope to retain linear-order control of the growth indicator on the extreme tail. In the last part of Lemma 1, this role is played by the hard-tail safeguard, which gives \[(\bar A(x)-S_\eta)_+\ge \frac{1}{2}\bar A(x), \qquad \bar A(x)>2S_\eta .\] A local soft localized envelope does not generally have this behavior. For \[A_\eta^{\rm soft}(x)=(\bar A(x)-R)_+^\gamma, \qquad 0<\gamma\le1,\] linear-order tail control would require \(A_\eta^{\rm soft}(x)\) to remain comparable with \(\bar A(x)\) as \(\bar A(x)\to\infty\). This is possible, up to constants, when \(\gamma=1\). However, for the sublinear choices \(0<\gamma<1\), \[\frac{A_\eta^{\rm soft}(x)}{\bar A(x)} = \frac{(\bar A(x)-R)_+^\gamma}{\bar A(x)} \longrightarrow 0 \qquad\text{as } \bar A(x)\to\infty .\] Thus a sublinear local soft envelope can be mild in the typical and intermediate regions, but it does not provide the uniform far-tail effective-linearity safeguard used in the Lyapunov argument. This is a limitation of the envelope design, not merely a technical artifact of the proof: rare excursions into the extreme tail may see too little denominator growth to control the large drift scale. The radial stress test in Table 5 shows this behavior concretely: the local soft row becomes unstable in the hardest case, while the hybrid rule remains stable. The hybrid construction is motivated by exactly this tradeoff. Its soft component avoids unnecessary shrinkage near the typical region, and its hard-tail component restores linear-order tail control where the stability argument requires it.
We now define the exact-gradient Markov chain that serves as the base stationary object. The stochastic-gradient kernel is introduced later in Section 7, after the exact-gradient stationary theory and residual decomposition have been established.
Fix \(\alpha\in(0,1/2)\). For a constant stepsize \(\eta\in(0,\eta_0]\), define \[\label{eq:tamed-drift} b^T_\eta(x)=\frac{b(x)}{1+\eta^\alpha A_\eta(x)},\tag{7}\] where \(A_\eta\) may be the global envelope \(A\) from Assumption 3 or any localized deterministic envelope satisfying the same effective-linearity condition. The exact-gradient tamed Langevin recursion is \[\label{eq:tamed-chain} Y_{k+1}=Y_k+\eta b^T_\eta(Y_k)+\sqrt{2\beta^{-1}\eta}\,\xi_{k+1},\tag{8}\] where \((\xi_k)\) are independent standard Gaussian vectors in \(\mathbb{R}^d\). We denote its Markov kernel by \(Q_\eta\). Equivalently, if \(X_0=x\) and \[X_1=x+\Delta_\eta(x),\qquad \Delta_\eta(x):=\eta b^T_\eta(x)+\sqrt{2\beta^{-1}\eta}\,\xi,\] then, for every bounded measurable test function \(\varphi\), \[\label{eq:kernel-conditional-expectation} Q_\eta\varphi(x) =\mathbb{E}\big[\varphi(X_1)\mid X_0=x\big] =\mathbb{E}\big[\varphi(x+\Delta_\eta(x))\big].\tag{9}\] This conditional-expectation form will be used in the Lyapunov drift argument below. In terms of \(F_z\), the Hessian-envelope form is \[\label{eq:hessian-tamed} Y_{k+1}=Y_k- \eta\frac{\nabla F_z(Y_k)}{1+\eta^\alpha\|\nabla^2F_z(Y_k)\|_{\mathrm{op}}} +\sqrt{2\beta^{-1}\eta}\,\xi_{k+1}.\tag{10}\]
Remark 7 (Choice of the taming exponent). The exponent \(\alpha\in(0,1/2)\) controls the strength of taming. Smaller \(\alpha\) gives stronger stabilization, while values closer to \(1/2\) keep the modified drift closer to the original drift. The restriction \(\alpha<1/2\) is used in the later residual estimates. In the experiments we use \(\alpha=0.45\) to avoid overly aggressive taming while retaining visible stabilization.
We now prove moment stability and invariant-measure existence for the exact-gradient deterministic-envelope kernel \(Q_\eta\). The key input is the effective-linearity bound in Assumption 3. For localized envelopes with a hard-tail safeguard, the corresponding bound is verified in Lemma 1; Remark 6 explains why sublinear local soft envelopes do not generally provide the same far-tail control.
We first collect two elementary estimates used in the Lyapunov drift argument. The first one controls the tamed drift under the envelope condition, while the second one converts one-step updates into increments of the polynomial Lyapunov function.
Lemma 2 (Effective-linearity bound for the tamed drift step). Under Assumption 3, for every \(\eta\in(0,1]\), \[\label{eq:effective-linear} \eta\|b^T_\eta(x)\|\le C\eta^{1-\alpha}(1+\|x\|),\qquad x\in\mathbb{R}^d.\qquad{(15)}\]
Proof. Since \(1+\eta^\alpha A(x)\ge \eta^\alpha(1+A(x))\), \[\eta\|b^T_\eta(x)\| =\eta\frac{\|b(x)\|}{1+\eta^\alpha A(x)} \le \eta^{1-\alpha}\frac{\|b(x)\|}{1+A(x)} \le C\eta^{1-\alpha}(1+\|x\|).\] ◻
Lemma 3 (Global increment bound for polynomial Lyapunov functions). Let \(q\ge2\). There exists a constant \(C_q<\infty\) such that, for all \(x,u\in\mathbb{R}^d\), \[\label{eq:poly-taylor} V_q(x+u)-V_q(x) \le q\|x\|^{q-2}\langle x,u\rangle +C_q(1+\|x\|^{q-2})\|u\|^2+C_q\|u\|^q, \qquad V_q(x)=1+\|x\|^q.\qquad{(16)}\]
Proof. The case \(x=0\) follows immediately after increasing \(C_q\). Assume \(x\neq0\) and set \(\phi(y)=\|y\|^q\). If \(\|u\|\le \|x\|/2\), then the segment \(x+tu\), \(0\le t\le1\), stays away from the origin and \[\|\nabla^2\phi(x+tu)\|\le C_q\|x\|^{q-2}.\] Taylor’s formula gives \[\phi(x+u)-\phi(x) \le \langle \nabla\phi(x),u\rangle+C_q\|x\|^{q-2}\|u\|^2,\] and \(\nabla\phi(x)=q\|x\|^{q-2}x\). If \(\|u\|>\|x\|/2\), then \(\|x\|^q\le C_q\|u\|^q\) and \[\phi(x+u)-\phi(x)-\langle \nabla\phi(x),u\rangle \le C_q\|u\|^q+C_q\|x\|^{q-1}\|u\| \le C_q\|u\|^q.\] Combining the two cases proves the claim. ◻
Proposition 8 (Polynomial Lyapunov stability). Assume Assumptions 1–3. For every \(q\ge2\), there exist constants \(c_q>0\), \(C_q<\infty\), and \(\eta_0>0\), independent of \(x\) and \(\eta\), such that for all \(\eta\in(0,\eta_0]\), the tamed chain 8 satisfies \[\label{eq:uniform-moment-trajectory} \sup_{k\ge0}\mathbb{E}[1+\|Y_k\|^q] \le C_q(1+\mathbb{E}\|Y_0\|^q).\qquad{(17)}\] Equivalently, with \(V_q(x)=1+\|x\|^q\), \[\label{eq:drift-condition} Q_\eta V_q(x)\le (1-c_q\eta)V_q(x)+C_q\eta.\qquad{(18)}\]
Proof. We give the proof in detail because this is where the denominator enters the Lyapunov argument.
First, we rewrite the kernel action in one-step form. By the conditional-expectation representation 9 , applied to the Lyapunov function \(V_q\), \[Q_\eta V_q(x) =\mathbb{E}\big[V_q(X_1)\mid X_0=x\big] =\mathbb{E}\big[V_q(x+\Delta_\eta(x))\big],\] where \[\Delta_\eta(x)=\eta b^T_\eta(x)+\sqrt{2\beta^{-1}\eta}\,\xi, \qquad \xi\sim N(0,I_d).\] Applying Lemma 3 with \(u=\Delta_\eta(x)\) and taking expectation gives the decomposition \[\begin{align} Q_\eta V_q(x)-V_q(x) &\le q\eta\|x\|^{q-2}\langle x,b^T_\eta(x)\rangle \notag\\ &\quad +C_q(1+\|x\|^{q-2})\mathbb{E}\|\Delta_\eta(x)\|^2 +C_q\mathbb{E}\|\Delta_\eta(x)\|^q . \label{eq:lyapunov-basic-decomposition} \end{align}\tag{11}\] Here the Gaussian part does not contribute to the first-order term because \(\mathbb{E}\xi=0\).
We next estimate the first-order drift term. By Assumption 2, \[\langle x,b^T_\eta(x)\rangle =\frac{\langle x,b(x)\rangle}{1+\eta^\alpha A(x)} \le \frac{b_0}{1+\eta^\alpha A(x)} -m\frac{\|x\|^{r+2}}{1+\eta^\alpha A(x)}.\] The positive part is bounded by \(b_0\). For the negative part, Assumption 3 and \(0<\eta\le1\) give \[1+\eta^\alpha A(x) \le 1+L_A(1+\|x\|^r) \le C(1+\|x\|^r).\] Hence the dissipative quotient retains a quadratic control: \[\label{eq:key-ratio} \frac{\|x\|^{r+2}}{1+\eta^\alpha A(x)} \ge c\frac{\|x\|^{r+2}}{1+\|x\|^r} \ge c\|x\|^2-C .\tag{12}\] Consequently, \[\langle x,b^T_\eta(x)\rangle \le C-c\|x\|^2 .\] Multiplying by \(q\eta\|x\|^{q-2}\) and using Young’s inequality to absorb the lower power \(\|x\|^{q-2}\), we obtain \[\label{eq:dissipative-tamed} q\eta\|x\|^{q-2}\langle x,b^T_\eta(x)\rangle \le -c_q\eta\|x\|^q+C_q\eta .\tag{13}\]
It remains to control the quadratic and higher-order remainders in 11 . Lemma 2, the elementary inequality \(\|a+b\|^m\le C_m(\|a\|^m+\|b\|^m)\), and Gaussian moment bounds give, for every \(m\ge2\), \[\label{eq:delta-moment-bound} \mathbb{E}\|\Delta_\eta(x)\|^m \le C_m\eta^{m(1-\alpha)}(1+\|x\|^m)+C_m\eta^{m/2} .\tag{14}\] For \(m=2\), this implies \[(1+\|x\|^{q-2})\mathbb{E}\|\Delta_\eta(x)\|^2 \le C_q\eta^{2-2\alpha}(1+\|x\|^q) +C_q\eta(1+\|x\|^{q-2}).\] Another use of Young’s inequality gives \[C_q\eta(1+\|x\|^{q-2}) \le \frac{c_q}{4}\eta\|x\|^q+C_q\eta.\] For \(m=q\), 14 gives \[\mathbb{E}\|\Delta_\eta(x)\|^q \le C_q\eta^{q(1-\alpha)}(1+\|x\|^q)+C_q\eta^{q/2}.\] Since \(\alpha<1/2\) and \(q\ge2\), we have \[2-2\alpha>1, \qquad q(1-\alpha)>1.\] Thus, after decreasing \(\eta_0\) if necessary, \[C_q\eta^{2-2\alpha}\|x\|^q +C_q\eta^{q(1-\alpha)}\|x\|^q \le \frac{c_q}{4}\eta\|x\|^q, \qquad 0<\eta\le\eta_0.\] The remaining constants are of order \(\eta\), since \(\eta^{q/2}\le\eta\) for \(q\ge2\) and \(0<\eta\le1\). Combining these estimates with 13 in 11 , and decreasing \(\eta_0\) if necessary, yields \[Q_\eta V_q(x)-V_q(x) \le -\frac{c_q}{2}\eta\|x\|^q+C_q\eta.\] After decreasing \(c_q\) and increasing \(C_q\) if necessary, and using \(V_q(x)=1+\|x\|^q\), this gives ?? . Iterating ?? gives ?? . ◻
Theorem 9 (Invariant measures of the exact-gradient deterministic-envelope kernel). Under the assumptions of Proposition 8, there exist constants \(C_q<\infty\) and \(\eta_0>0\) such that, for every \(0<\eta\le\eta_0\), the exact-gradient deterministic-envelope kernel \(Q_\eta\) admits at least one invariant probability measure. Moreover, every invariant probability measure \(\pi_{\eta}\) of \(Q_\eta\) satisfies \[\label{eq:inv-moment-vq} \int V_q(x)\,\pi_{\eta}(\,\mathrm{d}x)\le C_q .\qquad{(19)}\] Equivalently, for every \(q\ge2\) covered by Proposition 8, \[\label{eq:inv-moment} \sup_{0<\eta\le\eta_0}\int \|x\|^q\,\pi_{\eta}(\,\mathrm{d}x)<\infty .\qquad{(20)}\]
Proof. The kernel \(Q_\eta\) is Feller because the one-step update map is continuous in the initial state and the Gaussian noise is fixed. Fix \(x\in\mathbb{R}^d\) and define the Krylov–Bogoliubov averages \[\mu_n^{\eta,x}:=\frac{1}{n}\sum_{k=0}^{n-1}\delta_x Q_\eta^k .\] The drift estimate ?? and the trajectory moment bound ?? imply \[\sup_{n\ge1}\int V_q(y)\,\mu_n^{\eta,x}(\,\mathrm{d}y)<\infty .\] Since \(V_q(y)\to\infty\) as \(\|y\|\to\infty\), the family \((\mu_n^{\eta,x})_{n\ge1}\) is tight. By the standard Krylov–Bogoliubov argument for Feller kernels, any weak limit point is an invariant probability measure of \(Q_\eta\).
Let \(\pi_{\eta}\) be any invariant probability measure of \(Q_\eta\). Integrating ?? with respect to \(\pi_{\eta}\) gives \[\int V_q\,\,\mathrm{d}\pi_{\eta} = \int Q_\eta V_q\,\,\mathrm{d}\pi_{\eta} \le (1-c_q\eta)\int V_q\,\,\mathrm{d}\pi_{\eta}+C_q\eta .\] Hence \[\int V_q\,\,\mathrm{d}\pi_{\eta}\le \frac{C_q}{c_q} .\] After increasing \(C_q\) if necessary, this yields ?? and therefore ?? . ◻
Theorem 9 motivates a convention for selecting invariant measures uniformly in the stepsize. We write the selected family as \((\pi_\eta)_{0<\eta\le\eta_0}\), where each \(\pi_\eta\) is an invariant probability measure of the corresponding kernel \(K_\eta\).
Definition 2 (Admissible families of invariant measures). Let \((K_\eta)_{0<\eta\le\eta_0}\) be a family of Markov kernels on \(\mathbb{R}^d\), and fix a moment order \(q\ge2\). A family \((\pi_\eta)_{0<\eta\le\eta_0}\) is called an admissible family of invariant measures for \(K_\eta\) at order \(q\)* if, for every \(0<\eta\le\eta_0\), \[\pi_\eta K_\eta=\pi_\eta,\] and the selected invariant measures satisfy the uniform Lyapunov-moment bound \[\sup_{0<\eta\le\eta_0}\int_{\mathbb{R}^d} V_q(x)\,\pi_\eta(\,\mathrm{d}x)<\infty .\] When several moment orders are needed, admissibility means admissibility at all those orders.*
For the exact-gradient deterministic-envelope kernel \(Q_\eta\), Theorem 9 supplies this uniform bound for any such selection \((\pi_\eta)_{0<\eta\le\eta_0}\) of invariant probability measures, at each polynomial moment order covered there. The uniform \(V_q\)-moment bound is the tightness input used below: since \(V_q(x)\to\infty\) as \(\|x\|\to\infty\), every sequence \(\eta_j\downarrow0\) admits a subsequence for which \(\pi_{\eta_j}\Rightarrow\pi\). The phrase admissible family of invariant measures will be used in the same way for stochastic-gradient kernels once the corresponding Lyapunov estimate supplies the required uniform \(V_q\)-moment bound.
The preceding results were stated for a deterministic envelope satisfying Assumption 3. We now record the corresponding drift estimate for a localized exact-gradient kernel whose envelope has a hard-tail safeguard.
Proposition 10 (Drift estimate for a localized exact-gradient kernel with hard-tail safeguard). Assume Assumptions 1 and 2. Suppose the computable envelope \(\bar A\) satisfies ?? , and let \(A_\eta^{c_s,1}\) be a localized envelope from ?? with threshold \(S_\eta=c_S\eta^{-\alpha}\). Then the corresponding localized exact-gradient kernel \(Q_\eta^{c_s,1}\) satisfies the following drift estimate: for every \(q\ge2\) covered by the polynomial growth assumptions, there are constants \(c_q>0\), \(C_q<\infty\), and \(\eta_0>0\) such that \[\label{eq:hybrid-drift-condition} Q_\eta^{c_s,1}V_q(x) \le (1-c_q\eta)V_q(x)+C_q\eta, \qquad 0<\eta\le\eta_0 .\qquad{(21)}\] Consequently, the localized exact-gradient kernel \(Q_\eta^{c_s,1}\) admits invariant probability measures, and every such invariant measure satisfies the same uniform \(V_q\)-moment bound as in Theorem 9.
Proof. This is a direct application of Proposition 8 with the generic envelope bounds replaced by Lemma 1. Indeed, Lemma 1 gives the effective-linearity estimate ?? and the polynomial upper-growth bound ?? for \(A_\eta^{c_s,1}\). These are precisely the envelope inputs used in the proof of Proposition 8.
The first-order dissipative term is therefore controlled in the same way: ?? yields the quadratic quotient bound 12 , and hence \[\eta\|x\|^{q-2}\langle x,b_\eta^T(x)\rangle \le C\eta-c\eta\|x\|^q .\] The increment estimate for \(V_q\) from Lemma 3 applies unchanged, while ?? gives the same quadratic and higher-order remainder bounds as in Proposition 8. Since \(\alpha<1/2\), those remainders are absorbed by the negative drift for small enough \(\eta\), giving ?? . The invariant-measure statement then follows from the Krylov–Bogoliubov argument and the stationary moment estimate used in Theorem 9, with ?? replacing ?? . ◻
Section 4 gives invariant measures for each fixed-stepsize exact-gradient deterministic-envelope kernel \(Q_\eta\). Since \(Q_\eta\) is an Euler-type numerical kernel with a modified drift, its invariant measures need not equal the Gibbs law \(\pi_z\) at fixed \(\eta\). This section proves that every admissible family \((\pi_\eta)_{0<\eta\le\eta_0}\) for \(Q_\eta\) satisfies \[\pi_\eta\Rightarrow\pi_z,\qquad \eta\downarrow0,\] and then extends this convergence to polynomial-growth observables.
Admissibility makes \((\pi_\eta)_{0<\eta\le\eta_0}\) tight, so subsequential weak limits exist as \(\eta\downarrow0\). To identify these limits with the Gibbs law, we impose the following stationary identification condition for the limiting Langevin generator.
Assumption 4 (Stationary identification of the Gibbs law). Let \[\mathcal{L}_zf(x) := \langle b(x),\nabla f(x)\rangle+\beta^{-1}\Delta f(x), \qquad f\in C_c^\infty(\mathbb{R}^d).\] If a probability measure \(\mu\) on \(\mathbb{R}^d\) satisfies \[\int \mathcal{L}_zf\,\,\mathrm{d}\mu=0, \qquad f\in C_c^\infty(\mathbb{R}^d),\] then \(\mu=\pi_z\).
Remark 11 (A standard route to stationary identification). Assumption 4 is used only to identify weak limits through the limiting Langevin generator. It is not a uniqueness assumption for the fixed-stepsize kernels \(Q_\eta\). For gradient Langevin diffusions with nondegenerate additive noise, the Gibbs law \(\pi_z\) is infinitesimally invariant by integration by parts. Under standard dissipativity, local polynomial-growth, and recurrence conditions, strong Feller/irreducibility and Lyapunov arguments identify this invariant law as the unique stationary law of the limiting diffusion; see, for example, the Meyn–Tweedie framework [16] and the locally Lipschitz ergodicity results of Mattingly–Stuart–Higham [17]. We keep the condition explicit because the proof below only needs this identification property, not a full reproof of diffusion ergodicity.
Lemma 4 (Local generator consistency for compactly supported test functions). Assume Assumptions 1–3. Let \(f\in C_c^\infty(\mathbb{R}^d)\). Then, for every compact set \(K\subset\mathbb{R}^d\), \[\label{eq:compact-generator-consistency} \sup_{x\in K}\left| \frac{Q_\eta f(x)-f(x)}{\eta}-\mathcal{L}_zf(x) \right|\longrightarrow 0, \qquad \eta\downarrow0 .\qquad{(22)}\] Moreover, the same convergence holds for any deterministic localized envelope \(A_\eta\) such that each \(A_\eta\) is locally bounded and, for every compact \(K\subset\mathbb{R}^d\), \[\sup_{x\in K}\eta^\alpha A_\eta(x)\longrightarrow0, \qquad \eta\downarrow0 .\]
Proof. For \(f\in C_c^\infty\), all derivatives of \(f\) are bounded. On a fixed compact set, the drift and the deterministic envelope are bounded, and \(\eta^\alpha A_\eta(x)\to0\) uniformly. Hence \[b^T_\eta(x)=\frac{b(x)}{1+\eta^\alpha A_\eta(x)}\to b(x)\] uniformly on the compact set. Taylor expanding one step of the Gaussian Euler update gives \[Q_\eta f(x)-f(x) =\eta\langle b^T_\eta(x),\nabla f(x)\rangle +\beta^{-1}\eta\Delta f(x)+o_K(\eta),\] where \(o_K(\eta)/\eta\to0\) uniformly on \(K\). Dividing by \(\eta\) and using local uniform convergence of \(b^T_\eta\) gives ?? . ◻
For compactly supported test functions, the generator limit only sees compact subsets of the state space. The condition \(\eta^\alpha A_\eta\to0\) locally uniformly means that the denominator perturbation disappears on each such compact set: \[\frac{1}{1+\eta^\alpha A_\eta(x)}\longrightarrow1 .\] Consequently, the tamed drift \(b(x)/(1+\eta^\alpha A_\eta(x))\) converges locally to the original drift \(b(x)\). Without this local vanishing, the limiting generator could contain a modified drift rather than \(\mathcal{L}_z\).
Theorem 12 (Weak stationary Gibbs consistency). Suppose the assumptions of Theorem 9 and Assumption 4 hold. Let \((\pi_\eta)_{0<\eta\le\eta_0}\) be an admissible family of invariant measures for \(Q_\eta\) at the moment order required to control the generator-consistency terms below. Then \[\label{eq:weak-conv} \pi_\eta\Rightarrow\pi_z,\qquad \eta\downarrow0 .\qquad{(23)}\] Equivalently, for every sequence \(\eta_j\downarrow0\), the selected invariant measures satisfy \(\pi_{\eta_j}\Rightarrow\pi_z\).
Remark 13 (No fixed-stepsize uniqueness is required). The conclusion does not require uniqueness of invariant probability measures for each fixed stepsize \(\eta\). It applies to any admissible family \((\pi_\eta)_{0<\eta\le\eta_0}\). Thus different admissible selections of fixed-stepsize invariant measures have the same weak limit \(\pi_z\) as \(\eta\downarrow0\).
Proof. Let \(\eta_j\downarrow0\). By admissibility, after passing to a subsequence we may assume \(\pi_{\eta_j}\Rightarrow\pi_*\). For \(f\in C_c^\infty(\mathbb{R}^d)\), invariance gives \[\int \frac{Q_{\eta_j}f-f}{\eta_j}\,\,\mathrm{d}\pi_{\eta_j}=0.\] Lemma 4 gives local uniform convergence of the integrand to \(\mathcal{L}_zf\) on a compact neighborhood of \(\operatorname{supp} f\). The contribution from outside this neighborhood is the one-step term \(\eta_j^{-1}Q_{\eta_j}|f|\); it is controlled by the Gaussian tail of the proposal and the admissible \(V_q\)-moment bound. Hence \[\int \mathcal{L}_zf\,\,\mathrm{d}\pi_*=0, \qquad f\in C_c^\infty(\mathbb{R}^d).\] Assumption 4 identifies \(\pi_*\) with \(\pi_z\). Since every sequence \(\eta_j\downarrow0\) has only this possible subsequential limit, \(\pi_\eta\Rightarrow\pi_z\). ◻
Weak convergence only guarantees convergence of integrals against bounded continuous test functions \(f\in C_b(\mathbb{R}^d)\). The examples and empirical risks used below may be unbounded, so we call such quantities observables when their expectations under invariant measures are compared. The next lemma records the standard compact–tail argument for polynomial-growth observables.
Lemma 5 (Weak convergence plus uniform integrability). Let \(\mu_n\Rightarrow\mu\) on \(\mathbb{R}^d\). Suppose the observable \(H:\mathbb{R}^d\to\mathbb{R}\) is continuous and has polynomial growth, \[|H(x)|\le C_H(1+\|x\|^s),\] and suppose that for some \(\delta>0\), \[\sup_n\int \|x\|^{s+\delta}\,\mu_n(\,\mathrm{d}x)<\infty, \qquad \int \|x\|^{s+\delta}\,\mu(\,\mathrm{d}x)<\infty.\] Then \[\int H\,\,\mathrm{d}\mu_n\to \int H\,\,\mathrm{d}\mu.\]
Proof. Fix \(R>0\), set \(K_R=\{x:\|x\|\le R\}\), and choose a continuous cutoff \(\chi_R\) with \(\chi_R=1\) on \(K_R\) and \(\chi_R=0\) outside \(K_{2R}\). Then \(H_R:=H\chi_R\in C_b(\mathbb{R}^d)\), so \[\int H_R\,\,\mathrm{d}\mu_n\to \int H_R\,\,\mathrm{d}\mu .\] The remaining terms are supported in \(K_R^c\). From \(|H(x)|\le C_H(1+\|x\|^s)\) and the uniform \((s+\delta)\)-moment bound, \[\sup_n\int_{K_R^c}|H(x)|\,\mu_n(\,\mathrm{d}x)\to0, \qquad \int_{K_R^c}|H(x)|\,\mu(\,\mathrm{d}x)\to0 \qquad (R\to\infty).\] Letting \(n\to\infty\) for fixed \(R\), and then \(R\to\infty\), gives the result. ◻
Corollary 1 (Polynomial stationary observable consistency). Suppose the assumptions of Theorem 12 hold. Let \(H\) be continuous and satisfy \[|H(x)|\le C_H(1+\|x\|^s).\] If the admissible family of invariant measures satisfies a uniform \(s+\delta\) moment bound for some \(\delta>0\), and \(\pi_z\) has finite \(s+\delta\) moment, then \[\int H\,\,\mathrm{d}\pi_{\eta}\to \int H\,\,\mathrm{d}\pi_z, \qquad \eta\downarrow0.\] In particular, empirical-risk observables with polynomial growth are consistent whenever the Lyapunov estimate gives a moment order strictly higher than their growth order.
Proof. Apply Lemma 5 with \(\mu_n=\pi_{\eta_n}\) and \(\mu=\pi_z\). ◻
This corollary gives the stationary interpretation used in this paper: fixed-stepsize taming may bias the invariant law, but the bias disappears for polynomial-growth observables as \(\eta\to0\), provided the admissible family has a uniform moment bound of order strictly higher than the growth order of the observable.
Section 5 proves the qualitative limit \(\pi_{\eta}\Rightarrow\pi_z\) as \(\eta\downarrow0\). This section studies what remains when the stepsize is fixed. For an observable \(H\), we compare the two stationary expectations \[\pi_{\eta}(H)-\pi_z(H).\] The Poisson equation rewrites this difference as the average one-step generator residual of the numerical kernel. We then decompose that residual into an Euler discretization residual and a deterministic-envelope residual. The stochastic-gradient extension in Section 7 adds the oracle covariance channel.
Proposition 14 (Poisson-residual identity for stationary bias). Let \(H\) be an observable with \(\pi_z(H)\) finite. Suppose the Poisson equation, written with the sign convention \[\label{eq:poisson-certificate} \mathcal{L}_zu_H=H-\pi_z(H),\qquad{(24)}\] has a solution \(u_H\) such that all integrals below are finite. Let \(Q_\eta\) be any Markov kernel admitting an invariant probability measure \(\pi_{\eta}\). Then \[\label{eq:poisson-residual-identity} \pi_{\eta}(H)-\pi_z(H) = \int\left(\mathcal{L}_zu_H-\frac{Q_\eta u_H-u_H}{\eta}\right)\,\mathrm{d}\pi_{\eta}.\qquad{(25)}\] Consequently, \[\label{eq:poisson-residual-bound} \left|\pi_{\eta}(H)-\pi_z(H)\right| \le \int \left|\mathcal{L}_zu_H-\frac{Q_\eta u_H-u_H}{\eta}\right|\,\mathrm{d}\pi_{\eta}.\qquad{(26)}\]
Proof. By invariance of \(\pi_{\eta}\), \[\int \frac{Q_\eta u_H-u_H}{\eta}\,\,\mathrm{d}\pi_{\eta}=0.\] Using ?? , \[\pi_{\eta}(H)-\pi_z(H) =\int \mathcal{L}_zu_H\,\,\mathrm{d}\pi_{\eta} =\int\left(\mathcal{L}_zu_H-\frac{Q_\eta u_H-u_H}{\eta}\right)\,\mathrm{d}\pi_{\eta}.\] The inequality follows by taking absolute values. ◻
Remark 15 (Role of the Poisson identity). This is the standard Poisson-equation device used in invariant-measure weak error analysis for numerical SDEs; see Mattingly–Stuart–Tretyakov [18]. In the present setting, it turns stationary bias into a one-step generator residual, so that the effect of the deterministic envelope appears explicitly in the residual.
Assumption 5 (Poisson regularity for residual bounds). Fix an observable \(H\). The Poisson equation \[\mathcal{L}_zu_H=H-\pi_z(H)\] admits a solution \(u_H\) with the following weighted \(C^{2,\gamma}\)-type bounds for some \(\gamma\in(0,1]\). Namely, there exist constants \(C_H,m_H\) such that \[\|\nabla u_H(x)\|+\|\nabla^2 u_H(x)\| \le C_H(1+\|x\|^{m_H}), \qquad x\in\mathbb{R}^d,\] and \[\|\nabla^2u_H(x)-\nabla^2u_H(y)\| \le C_H(1+\|x\|^{m_H}+\|y\|^{m_H})\|x-y\|^\gamma, \qquad x,y\in\mathbb{R}^d .\]
Remark 16 (A route to Poisson regularity). Assumption 5 is an analytic input for the Poisson-residual argument. For ergodic elliptic diffusions, Pardoux–Veretennikov [19] provide a standard route to existence, uniqueness, local Sobolev regularity, and polynomial-growth estimates for the Poisson equation. In smooth uniformly elliptic Langevin settings, such growth estimates can be combined with classical local elliptic Schauder estimates [20] to obtain weighted \(C^{2,\gamma}\)-type bounds of the form used above. We keep the assumption explicit because the precise Hölder exponent and polynomial weights depend on the model and are not part of the denominator construction. The smooth quartic and polynomial examples in Section 8 are meant to fall within this standard verification route.
Proposition 17 (One-step residual decomposition). Assume Assumption 5. Consider the exact-gradient deterministic-envelope update \[\label{eq:drift-form-exact-step} Y=x+\eta\frac{b(x)}{1+\eta^\alpha A_\eta(x)} +\sqrt{2\beta^{-1}\eta}\,Z,\qquad{(27)}\] where \(A_\eta\) is nonnegative, deterministic, and locally bounded. Assume also that \(b\) has the polynomial growth implied by Assumption 1. Let \(Q_\eta\) be the corresponding exact-gradient deterministic-envelope kernel. Then there exist constants \(C_H,m\), independent of sufficiently small \(\eta\), such that \[\label{eq:onestep-residual-decomposition} \left| \frac{Q_\eta u_H(x)-u_H(x)}{\eta} -\mathcal{L}_zu_H(x) \right| \le C_H(1+\|x\|^m) \left[ \eta^{\gamma/2} +\eta^\alpha A_\eta(x)\|b(x)\| \right].\qquad{(28)}\]
Proof. Set \[b_\eta(x)=\frac{b(x)}{1+\eta^\alpha A_\eta(x)},\] and write the one-step increment as \[\Delta=\eta b_\eta(x)+\sqrt{2\beta^{-1}\eta}\,Z, \qquad Z\sim N(0,I_d).\] Then \[Q_\eta u_H(x)=\mathbb{E}[u_H(x+\Delta)\mid x].\] A second-order Taylor expansion with the \(C^{2,\gamma}\) remainder gives \[Q_\eta u_H(x)-u_H(x) =\langle \nabla u_H(x),\mathbb{E}[\Delta\mid x]\rangle +\frac{1}{2}\mathbb{E}[\nabla^2u_H(x)[\Delta,\Delta]\mid x] +R_\eta(x),\] where \[|R_\eta(x)| \le C_H\mathbb{E}\left[(1+\|x\|^{m_H}+\|x+\Delta\|^{m_H})\|\Delta\|^{2+\gamma}\mid x\right].\] Since \(1+\eta^\alpha A_\eta(x)\ge 1\), we have \(\|b_\eta(x)\|\le \|b(x)\|\). The polynomial growth of \(b\), together with Gaussian moment bounds, gives \[\label{eq:poisson-taylor-remainder-bound} \eta^{-1}|R_\eta(x)| \le C_H(1+\|x\|^m)\eta^{\gamma/2}.\tag{15}\]
The first-order term is \[\eta^{-1}\langle \nabla u_H(x),\mathbb{E}[\Delta\mid x]\rangle =\langle b_\eta(x),\nabla u_H(x)\rangle .\] For the second-order term, expand \(\Delta=\eta b_\eta(x)+\sqrt{2\beta^{-1}\eta}\,Z\). The drift–noise cross term has zero expectation, and the pure Gaussian term gives \[\frac{1}{2\eta}\mathbb{E}\left[ (\sqrt{2\beta^{-1}\eta}\,Z)^\top \nabla^2u_H(x) (\sqrt{2\beta^{-1}\eta}\,Z) \mid x \right] =\beta^{-1}\operatorname{tr}(\nabla^2u_H(x)) =\beta^{-1}\Delta u_H(x),\] because \(\mathbb{E}[ZZ^\top]=I_d\) and \(\Delta u_H=\operatorname{tr}(\nabla^2u_H)\) is the Laplacian. The deterministic drift-square contribution is \[\frac{\eta}{2}\nabla^2u_H(x)[b_\eta(x),b_\eta(x)],\] which is of order \(\eta\) with polynomial weight and is absorbed into the Euler residual term \(\eta^{\gamma/2}\) after increasing \(m\). Thus \[\frac{Q_\eta u_H(x)-u_H(x)}{\eta} =\langle b_\eta(x),\nabla u_H(x)\rangle +\beta^{-1}\Delta u_H(x) +\mathcal{R}_\eta(x),\] with \[|\mathcal{R}_\eta(x)|\le C_H(1+\|x\|^m)\eta^{\gamma/2}.\] Comparing this with \[\mathcal{L}_zu_H(x)=\langle b(x),\nabla u_H(x)\rangle+\beta^{-1}\Delta u_H(x),\] the diffusion terms cancel. The remaining drift difference is \[b_\eta(x)-b(x) =-\frac{\eta^\alpha A_\eta(x)}{1+\eta^\alpha A_\eta(x)}\,b(x),\] and therefore \[|\langle b_\eta(x)-b(x),\nabla u_H(x)\rangle| \le C_H(1+\|x\|^m)\eta^\alpha A_\eta(x)\|b(x)\|.\] Combining this estimate with the bound on \(\mathcal{R}_\eta\) proves ?? . ◻
Corollary 2 (Fixed-stepsize stationary bias decomposition). Under the assumptions of Proposition 17, let \(\pi_\eta\) be an invariant probability measure of \(Q_\eta\) that integrates the polynomial weights and residual terms appearing on the right-hand side below. Then \[\label{eq:stationary-bias-decomposition} \left|\pi_\eta(H)-\pi_z(H)\right| \le C_H\int (1+\|x\|^m) \left[ \eta^{\gamma/2} +\eta^\alpha A_\eta(x)\|b(x)\| \right]\pi_\eta(\,\mathrm{d}x).\qquad{(29)}\]
The bound separates two residuals. The term \(\eta^{\gamma/2}\) is the Euler residual; it comes from the Taylor remainder in the one-step expansion of \(Q_\eta u_H\). The second term is the deterministic-envelope residual; it measures how much the denominator changes the drift on the region sampled by \(\pi_\eta\).
In this bound, the deterministic-envelope residual is the only part that depends explicitly on the denominator design. To isolate this channel, fix a reference probability law \(\mu\) and define, with the exponent \(m\) from Proposition 17, \[\label{eq:det-env-residual-functional} \mathcal{D}_\eta(A;\mu) :=\eta^\alpha\int_{\mathbb{R}^d}(1+\|x\|^m)A_\eta(x)\|b(x)\|\,\mu(\,\mathrm{d}x).\tag{16}\] This fixed-law functional measures the denominator-dependent drift modification under \(\mu\). The next proposition compares this residual channel for a global envelope and a localized hybrid envelope under the same reference law.
Proposition 18 (Fixed-law comparison of deterministic-envelope residuals). Let \(\mu\) be a probability measure for which the residual functionals below are finite. Suppose that a global envelope \(A_{\rm glob}\) and a hybrid envelope \(A_{{\rm hyb},\eta}\) satisfy \[0\le A_{{\rm hyb},\eta}(x)\le A_{\rm glob}(x),\qquad x\in\mathbb{R}^d,\] and define the inactive safe region \[\mathcal{S}_\eta=\{x:A_{{\rm hyb},\eta}(x)=0\}.\] Then, under the same reference law \(\mu\), \[\label{eq:fixed-law-hybrid-localization} \mathcal{D}_\eta(A_{{\rm hyb},\eta};\mu) =\eta^\alpha\int_{\mathcal{S}_\eta^c}(1+\|x\|^m) A_{{\rm hyb},\eta}(x)\|b(x)\|\,\mu(\,\mathrm{d}x),\qquad{(30)}\] and \[\label{eq:fixed-law-envelope-dominance} \mathcal{D}_\eta(A_{{\rm hyb},\eta};\mu) \le \mathcal{D}_\eta(A_{\rm glob};\mu).\qquad{(31)}\]
Proof. The identity follows from \(A_{{\rm hyb},\eta}=0\) on \(\mathcal{S}_\eta\). The inequality follows by integrating the pointwise bound \(A_{{\rm hyb},\eta}\le A_{\rm glob}\) against the nonnegative weight \((1+\|x\|^m)\|b(x)\|\). ◻
Proposition 18 compares the deterministic-envelope residual functional \(\mathcal{D}_\eta(A;\mu)\) under a fixed reference law \(\mu\). This functional measures how much the envelope changes the drift on the region sampled by \(\mu\). Localization can reduce this drift modification on the typical region, while the hard-tail component remains available for Lyapunov stability. The comparison is therefore made under the same reference law, not between the invariant measures of different kernels. It should not be used by itself to rank all members of the envelope family: an envelope that is almost inactive under \(\mu\) can have a small fixed-law residual while still turning on too late to give good finite-stepsize stability or stationary behavior.
Overall, this section decomposes fixed-stepsize bias into an Euler residual and a deterministic-envelope residual, in the same broad weak-error tradition as numerical SDE bias expansions [18], [21]. Section 7 adds the stochastic-gradient layer, where centered oracle noise appears through covariance and higher-order residual terms.
Section 6 decomposed the fixed-stepsize residual for the exact-gradient deterministic-envelope kernel into an Euler residual and a deterministic-envelope residual. This section extends the deterministic-envelope kernel to stochastic-gradient oracles. The key point is that the denominator is fixed conditional on the current state, so a centered oracle error remains centered after envelope scaling.
Let \[\label{eq:sg-oracle} g(x,U_z)=\nabla F_z(x)+\zeta(x,U_z), \qquad \mathbb{E}[\zeta(x,U_z)\mid x]=0.\tag{17}\] The deterministic-envelope stochastic-gradient update is \[\label{eq:sg-tamed-kernel} Y_{k+1}^{\mathrm{sg}} =Y_k^{\mathrm{sg}} -\eta\frac{g(Y_k^{\mathrm{sg}},U_{z,k+1})}{1+\eta^\alpha A_\eta(Y_k^{\mathrm{sg}})} +\sqrt{2\beta^{-1}\eta}\,\xi_{k+1}.\tag{18}\] Since \(b=-\nabla F_z\), the tamed stochastic drift can be written as \[\label{eq:sg-tamed-drift-decomposition} \widehat b^T_\eta(x,U_z) :=\frac{b(x)-\zeta(x,U_z)}{1+\eta^\alpha A_\eta(x)} =b^T_\eta(x)+\varepsilon_\eta(x,U_z), \qquad \varepsilon_\eta(x,U_z):=-\frac{\zeta(x,U_z)}{1+\eta^\alpha A_\eta(x)}.\tag{19}\] Because the denominator is deterministic conditional on \(x\), \[\label{eq:sg-centered-tamed-drift} \mathbb{E}[\widehat b^T_\eta(x,U_z)\mid x]=b^T_\eta(x), \qquad \mathbb{E}[\varepsilon_\eta(x,U_z)\mid x]=0.\tag{20}\] This identity will be used in both the Lyapunov estimate and the stationary residual decomposition below.
A mini-batch-dependent denominator generally does not have this property. If the same oracle realization appears in the denominator, then typically \[\label{eq:random-denominator-centering-failure} \mathbb{E}\left[ \frac{b(x)-\zeta(x,U_z)}{1+\eta^\alpha \widetilde{A}_\eta(x,U_z)} \mid x \right] \ne b^T_\eta(x).\tag{21}\] Thus random denominators may create a first-order oracle drift shift. A deterministic envelope eliminates this mean-shift channel.
The stochastic-gradient extension requires three basic controls: a centered oracle error, conditional moments, and envelope-compatible one-step increments. The next assumption records these requirements in this order.
Assumption 6 (Stochastic-gradient oracle compatible with the deterministic envelope). The stochastic-gradient oracle satisfies the following conditions.
(Centered oracle error.) The decomposition in 17 is centered: \[\mathbb{E}[\zeta(x,U_z)\mid x]=0.\]
(Polynomial conditional moments.) Fix a maximal moment order \(r\ge2\) large enough to include all Lyapunov and one-step generator expansion orders used below. For each \(2\le j\le r\), the centered oracle error satisfies \[\label{eq:sg-raw-moments} \mathbb{E}[\|\zeta(x,U_z)\|^j\mid x] \le C_j\delta^{j/2}(1+\|x\|^{s_j}),\qquad{(32)}\] where \(0\le\delta\le\delta_0<\infty\).
(Envelope-compatible stochastic increments.) For each moment order \(q\le r\) used in the Lyapunov estimate, the envelope-scaled oracle increment satisfies, for \(2\le j\le q\), \[\label{eq:sg-compatible-increment} \mathbb{E}\left\| \eta\frac{\zeta(x,U_z)}{1+\eta^\alpha A_\eta(x)} \right\|^j \le C_{q,j}\eta^{j(1-\alpha)}\delta^{j/2}(1+\|x\|^j).\qquad{(33)}\]
With this oracle condition in place, the Lyapunov stability estimate extends to the stochastic-gradient kernel. The only new term is the envelope-scaled oracle increment, whose conditional mean and moments are controlled by Assumption 6.
Proposition 19 (Moment stability for the stochastic-gradient chain). Assume Assumptions 1–3 and Assumption 6; alternatively, use any localized deterministic envelope satisfying the effective-linearity and polynomial-growth bounds used in Proposition 8. For every \(q\ge2\) for which ?? holds, the stochastic-gradient tamed chain 18 satisfies the same type of Lyapunov estimate as ?? : for all sufficiently small \(\eta\), \[\label{eq:sg-drift-condition} Q_\eta^{\mathrm{sg}}V_q(x) \le (1-c_q\eta)V_q(x)+C_q\eta, \qquad V_q(x)=1+\|x\|^q.\qquad{(34)}\] Consequently \(Q_\eta^{\mathrm{sg}}\) admits invariant measures. Moreover, any selected family of invariant measures satisfying ?? is admissible at the corresponding moment order for the consistency arguments below.
Proof. We only indicate the modifications to the proof of Proposition 8. Write the stochastic-gradient increment as \[\Delta_\eta^{\mathrm{sg}} = \eta b^T_\eta(x) + \eta\varepsilon_\eta(x,U_z) + \sqrt{2\beta^{-1}\eta}\,\xi .\] The deterministic drift and Gaussian parts are the same as in Proposition 8. The only new term is the envelope-scaled oracle increment \(\eta\varepsilon_\eta(x,U_z)\).
The first-order Lyapunov contribution of this oracle increment vanishes. By Assumption 6(i) and the fact that the denominator \(1+\eta^\alpha A_\eta(x)\) is fixed conditional on \(x\), \[\mathbb{E}[\varepsilon_\eta(x,U_z)\mid x]=0.\] Hence the first-order drift term remains \[q\eta\|x\|^{q-2}\langle x,b^T_\eta(x)\rangle,\] the same deterministic-envelope dissipative term estimated in Proposition 8.
It remains to control the oracle contribution to the polynomial remainders. Assumption 6(iii) gives, for the moment orders used in the Lyapunov expansion, \[\mathbb{E}\|\eta\varepsilon_\eta(x,U_z)\|^j \le C_{q,j}\eta^{j(1-\alpha)}\delta^{j/2}(1+\|x\|^j), \qquad 2\le j\le q.\] Since \(\delta\le\delta_0\), the factor \(\delta^{j/2}\) is absorbed into the constant below. Thus the oracle increment has the same effective size as the deterministic tamed drift increment in the remainder estimates. Combining this bound with the deterministic and Gaussian increment estimates from Proposition 8, the same absorption argument yields ?? . The invariant-measure existence and uniform moment bound then follow exactly as in Theorem 9. ◻
Before stating the weak consistency result, define the conditional second moment of the envelope-scaled oracle perturbation by \[\label{eq:sg-oracle-second-moment} \begin{align} \mathsf{Var}_x(\varepsilon_\eta) &:= \mathbb{E}[\|\varepsilon_\eta(x,U_z)\|^2\mid x] \\ &= \mathbb{E}\left[ \left\| \frac{\zeta(x,U_z)}{1+\eta^\alpha A_\eta(x)} \right\|^2 \mid x\right]. \end{align}\tag{22}\] This scalar conditional second moment is the covariance scale used in the stochastic-gradient residual conditions below.
Proposition 19 gives the stability and tightness needed to identify stationary limits. We now identify the small-step limits of the stochastic-gradient invariant measures.
Theorem 20 (Weak stationary consistency for deterministic-envelope SGLD). Assume the hypotheses of Proposition 19, Lemma 4 for the deterministic part, and Assumption 4. Let \(\eta_j\downarrow0\), and let \(\pi_{\eta_j}^{\mathrm{sg}}\) be any invariant measure from an admissible family for the stochastic-gradient kernel \(Q_{\eta_j}^{\mathrm{sg}}\). Suppose that, for a polynomial weight \(W\) large enough to control the weighted remainders in the one-step generator expansion used in Proposition 17, \[\label{eq:sg-weak-covariance-condition} \eta_j\int W(x)\,\mathsf{Var}_x(\varepsilon_{\eta_j})\, \pi_{\eta_j}^{\mathrm{sg}}(\,\mathrm{d}x) \longrightarrow0,\qquad{(35)}\] and that the moment bounds from Proposition 19 hold at a sufficiently high order to integrate these remainders. Then \[\pi_{\eta_j}^{\mathrm{sg}}\Rightarrow \pi_z.\]
Proof. The Lyapunov estimate in Proposition 19 gives tightness. Along any weakly convergent subsequence, invariance gives \[\int \frac{Q_{\eta_j}^{\mathrm{sg}}f-f}{\eta_j} \,\,\mathrm{d}\pi_{\eta_j}^{\mathrm{sg}}=0, \qquad f\in C_c^\infty(\mathbb{R}^d).\] For compactly supported smooth \(f\), Lemma 4 gives the deterministic-envelope part of the local generator convergence. The centering identity 20 removes the first-order oracle term. The centered oracle increment \(\varepsilon_{\eta_j}\) enters through covariance and higher-order Taylor remainders. For compactly supported \(f\), the higher-order oracle terms are controlled by Assumption 6(ii)–(iii) and the stated uniform moment bounds; the remaining second-order oracle channel is controlled by the covariance condition ?? . Hence every subsequential stationary limit \(\mu\) satisfies \[\int \mathcal{L}_zf\,\,\mathrm{d}\mu=0, \qquad f\in C_c^\infty(\mathbb{R}^d).\] Assumption 4 identifies \(\mu=\pi_z\). Therefore the full family converges weakly to \(\pi_z\). ◻
Remark 21 (Mini-batch interpretation of the covariance condition). The covariance condition ?? has a simple scale interpretation for mini-batch oracles. If \[\mathsf{Var}_x(\zeta_{\ell_b})\le \frac{C}{\ell_b}(1+\|x\|^s),\] and the invariant measures satisfy the corresponding uniform moment bound, then the denominator only decreases the conditional second moment: \[\mathsf{Var}_x(\varepsilon_\eta) \le \mathsf{Var}_x(\zeta_{\ell_b}).\] Thus ?? follows, for instance, from \(\eta_j/\ell_b\to0\).
Corollary 3 (Stochastic-gradient polynomial-observable consistency). Under the assumptions of Theorem 20, let \(H\) be a continuous polynomial-growth observable. If the invariant measures have a uniform moment bound of order strictly larger than the growth order of \(H\), then \[\int H\,\,\mathrm{d}\pi_{\eta_j}^{\mathrm{sg}} \to \int H\,\,\mathrm{d}\pi_z.\]
Proof. Apply Lemma 5 to the weak convergence in Theorem 20 and to the stated uniform moment bound. ◻
The consistency result above identifies the small-stepsize limit. We next give the corresponding finite-stepsize stationary error decomposition for Poisson observables.
Theorem 22 (Stationary error decomposition for stochastic-gradient envelopes). Assume the Poisson regularity condition in Assumption 5. Assume also that Assumption 6 supplies the finite conditional moment order needed for the polynomially weighted Taylor remainder below, and that \(b\) has the polynomial growth implied by Assumption 1. Let \(\pi_\eta^{\mathrm{sg}}\) be an invariant probability measure of \(Q_\eta^{\mathrm{sg}}\) for which the right-hand side below is integrable. Then there exist constants \(C_H,m\), independent of sufficiently small \(\eta\), such that \[\label{eq:sg-stationary-bias-decomposition} \left|\pi_\eta^{\mathrm{sg}}(H)-\pi_z(H)\right| \le C_H\int (1+\|x\|^m) \left[ \eta^{\gamma/2} +\eta^\alpha A_\eta(x)\|b(x)\| +\eta\,\mathsf{Var}_x(\varepsilon_\eta) \right]\pi_\eta^{\mathrm{sg}}(\,\mathrm{d}x).\qquad{(36)}\]
Proof. We first record the local residual estimate. The argument is the proof of Proposition 17 with only the new oracle terms retained. Write the stochastic-gradient increment as \[\Delta = \eta b^T_\eta(x)+\eta\varepsilon_\eta(x,U_z) +\sqrt{2\beta^{-1}\eta}\,Z, \qquad Z\sim N(0,I_d).\] The deterministic drift part and the Gaussian covariance are the same as in the exact-gradient residual decomposition. The new first-order oracle term vanishes because \[\mathbb{E}[\varepsilon_\eta(x,U_z)\mid x]=0.\] Thus the deterministic-envelope drift residual remains \[|\langle b^T_\eta(x)-b(x),\nabla u_H(x)\rangle| \le C_H(1+\|x\|^m)\eta^\alpha A_\eta(x)\|b(x)\|.\]
It remains to bound the new second-order and higher-order oracle terms. The mixed deterministic–oracle term vanishes conditionally by centering, and the mixed Gaussian–oracle term vanishes by independence and centering. The pure oracle covariance is estimated directly by the Hessian growth bound: \[\begin{align} \left| \frac{\eta}{2} \mathbb{E}\!\left[ \nabla^2u_H(x)[\varepsilon_\eta(x,U_z),\varepsilon_\eta(x,U_z)] \mid x \right] \right| &\le \frac{\eta}{2}\|\nabla^2u_H(x)\|_{\mathrm{op}} \mathbb{E}\!\left[\|\varepsilon_\eta(x,U_z)\|^2\mid x\right] \\ &\le C_H(1+\|x\|^m)\eta\,\mathsf{Var}_x(\varepsilon_\eta). \end{align}\] The second line uses the polynomial Hessian bound from Assumption 5. The remaining Taylor remainder is controlled by the same weighted \(C^{2,\gamma}\) argument as in Proposition 17, using the oracle moment bounds in Assumption 6; after division by \(\eta\), it is bounded by \[C_H(1+\|x\|^m)\eta^{\gamma/2}.\] Combining these estimates gives the pointwise local residual bound \[\left| \frac{Q_\eta^{\mathrm{sg}}u_H(x)-u_H(x)}{\eta} -\mathcal{L}_zu_H(x) \right| \le C_H(1+\|x\|^m) \left[ \eta^{\gamma/2} +\eta^\alpha A_\eta(x)\|b(x)\| +\eta\,\mathsf{Var}_x(\varepsilon_\eta) \right].\] Applying the Poisson-residual identity in Proposition 14 with \(Q_\eta=Q_\eta^{\mathrm{sg}}\), and then integrating this local bound against \(\pi_\eta^{\mathrm{sg}}\), gives ?? . ◻
Theorem 22 separates three stationary-error channels. The term \(\eta^{\gamma/2}\) is the Euler residual from the local Taylor remainder. The term \(\eta^\alpha A_\eta(x)\|b(x)\|\) is the deterministic-envelope residual from replacing \(b\) by \(b^T_\eta\). For the deterministic-envelope stochastic-gradient kernel considered here, the taming denominator does not create an additional first-order oracle-bias term; the oracle contribution appears through the covariance residual \(\eta\,\mathsf{Var}_x(\varepsilon_\eta)\). This is the structural advantage of a deterministic envelope: conditional on \(x\), the denominator is fixed, so the current stochastic-gradient realization enters only through the numerator. This separation also identifies which design choice acts on which residual channel: deterministic denominators remove the oracle-coupled mean-shift channel, localized activation reduces deterministic-envelope residuals in typical regions, and batch size or variance reduction controls the covariance channel.
The experiments answer three concrete questions suggested by the theory. First, does using a denominator computed from the same stochastic gradient create an extra average drift bias? Second, how much stationary error is introduced by different deterministic-envelope choices? Third, do the same patterns persist in regression examples, implementable envelope rules, and a higher-dimensional stress test?
The experiments isolate how denominator design affects stationary error. We compare gradient-dependent denominators, global deterministic taming, and localized deterministic-envelope designs on controlled high-growth and empirical-risk examples. Reported errors are measured against either an analytic reference or a long-run numerical reference for the corresponding invariant-law quantity.
When a numerical reference is used, we account for its Monte Carlo uncertainty. For an error of the form \[\Delta H=\widehat H_{\rm method}-\widehat H_{\rm ref},\] we use the propagated standard error \[\mathrm{SE}(\Delta H) = \left( \mathrm{SE}_{\rm method}(H)^2+ \mathrm{SE}_{\rm ref}(H)^2 \right)^{1/2}.\] Errors comparable to this scale are interpreted as reaching the numerical-reference uncertainty level, rather than as resolved nonzero stationary bias.
| Experiment / method class | Parameters | Parameter source | Reference use |
|---|---|---|---|
| Radial gradient-dependent denominator | scale in denominator | fixed stress-test scale | reporting only |
| Radial deterministic envelopes | global/local/hybrid thresholds | fixed stress-test rules | reporting only |
| Quartic deterministic envelopes | typical/tail thresholds | warm-up growth quantiles | reporting only |
| \(d=50\) hybrid stress test | \(R,S,\gamma\) | warm-up quantiles plus small grid | reporting only |
| Polynomial envelope | growth order and scale | objective growth bound | reporting only |
Table 2 records how envelope parameters are selected. The radial rows use fixed stress-test rules, and the analytic reference values are used only for reporting. In the quartic-regression examples, warm-up quantiles of a deterministic growth indicator estimate typical and tail regimes. The high-dimensional row is included as a stress-test setting rather than as an optimized sampler benchmark.
Experiment 1: One-step random-denominator bias.
This short diagnostic illustrates the local mechanism from Propositions 2 and 4. We use the scalar unbiased oracle \[g_b=\mu+\sigma b^{-1/2}Z, \qquad Z\sim N(0,1),\] with \(\mu=1\) and \(\sigma=3\), and compare a random-denominator transform with its deterministic-denominator counterpart, \[T_\lambda^{\rm rand}(g)=\frac{g}{1+\lambda |g|}, \qquad T_\lambda^{\rm det}(\mu)=\frac{\mu}{1+\lambda |\mu|}.\] The diagnostic reports \[\left|\mathbb{E}\,T_\lambda^{\rm rand}(g_b)-T_\lambda^{\rm det}(\mu)\right|,\] which is zero for a deterministic denominator but generally nonzero when the same noisy oracle realization enters the denominator.
Experiment 1 is only a local sanity check. The more important question is whether this denominator-induced mean drift shift is visible after the Markov chain reaches stationarity; Experiment 2 addresses that question.
Experiment 2: Stationary observable errors for the quartic target.
We now test the same denominator effect at the stationary-observable level. Before specifying the target, we first define the diagnostics used in the table. Let \(\widehat b_\eta(x,U)\) denote the tamed stochastic drift used by the method being tested, and let \(b_\eta^T(x)\) be the deterministic-envelope drift. The reported mean drift shift is \[\mathbb{E}_x\left\|\mathbb{E}_U[\widehat b_\eta(x,U)\mid x]-b_\eta^T(x)\right\|.\] It measures the extra first-order oracle-bias channel that appears for a random denominator and is removed by a deterministic denominator.
The reported \(\eta\)-noise variance is \[\eta\,\mathbb{E}_x\mathbb{E}_U\left[ \left\|\widehat b_\eta(x,U)-\mathbb{E}_U[\widehat b_\eta(x,U)\mid x]\right\|^2 \right].\] It measures the scale of the covariance-level stochastic-gradient contribution. Finally, the observable columns report the stationary errors \[|\Delta \mathbb{E}H| =\left|\mathbb{E}_{\pi_\eta^{\rm method}}H-\mathbb{E}_{\rm ref}H\right|,\] for \(H=x^2,x^4,F\), probing scale, tail sensitivity, and energy-level error. The deterministic-envelope residual associated with the choice of \(A_\eta\) is examined later in Experiment 4, where different deterministic envelopes are compared directly.
We instantiate these diagnostics on the one-dimensional quartic target \[F(x)=\frac{x^4}{4},\qquad b(x)=-x^3,\] for which the Gibbs moments are available analytically. The stochastic-gradient oracle is \[g(x,U)=b(x)+\sigma U, \qquad U\sim N(0,1),\] with \(\sigma=2.5\), and the stepsize is \(\eta=0.04\). We compare exact deterministic-envelope taming, stochastic-gradient taming with the same deterministic denominator, and stochastic-gradient taming with a denominator recomputed from the current oracle realization. Each row averages ten independent runs; the errors are absolute deviations from the analytic Gibbs values.
| Method | mean drift shift | \(\eta\)-noise var. | \(|\Delta \mathbb{E}x^2|\) | \(|\Delta \mathbb{E}x^4|\) | \(|\Delta \mathbb{E}F|\) |
|---|---|---|---|---|---|
| Exact-gradient deterministic envelope | \(0\) | \(0\) | \(0.233\pm0.001\) | \(1.091\pm0.012\) | \(0.273\pm0.003\) |
| SG, deterministic denominator | \(0\) | \(0.187\pm0.0001\) | \(0.297\pm0.002\) | \(1.336\pm0.014\) | \(0.334\pm0.004\) |
| SG, random denominator | \(0.140\pm0.0002\) | \(0.0727\pm0.00004\) | \(0.362\pm0.003\) | \(1.595\pm0.015\) | \(0.399\pm0.004\) |
Table 3 shows the denominator effect at the level of stationary averages. With a deterministic denominator, the measured mean drift shift is zero. With a random denominator, the mean shift is nonzero, and the errors in \(x^4\) and \(F\) are larger in this experiment. Thus the one-step bias mechanism from Experiment 1 remains visible after the chain is run to stationarity.
Experiment 3: Batch-size scaling of the stochastic-gradient error.
The previous experiment uses a fixed oracle noise level. Experiment 3 checks a more specific prediction behind the covariance condition in Theorem 20 and Remark 21: increasing the batch size should reduce the \(\eta\)-scaled noise-variance contribution, while the deterministic denominator should still have no mean drift shift. We vary the batch-size proxy while keeping the same quartic target and stepsize \(\eta=0.04\). The stochastic-gradient oracle is \[g_{\ell_b}(x,U)=b(x)+\sigma \ell_b^{-1/2}U, \qquad U\sim N(0,1),\] so increasing \(\ell_b\) reduces only the oracle noise. Thus the \(\eta\)-scaled noise variance for the deterministic-denominator scheme should decrease approximately like \(1/\ell_b\), while the mean drift shift should remain absent.
| \(\ell_b\) | Deterministic denominator | Random denominator | \(|\Delta \mathbb{E}x^4|\) | |||
|---|---|---|---|---|---|---|
| 2-3(lr)4-5(lr)6-7 | mean drift shift | \(\eta\)-noise var. | mean drift shift | \(\eta\)-noise var. | det. denom. | rand. denom. |
| 1 | \(0\) | \(0.187 \pm 0.0001\) | \(0.140 \pm 0.0003\) | \(0.0726 \pm 5\times10^{-5}\) | \(1.36 \pm 0.01\) | \(1.62 \pm 0.02\) |
| 2 | \(0\) | \(0.0944 \pm 7\times10^{-5}\) | \(0.0919 \pm 0.0002\) | \(0.0450 \pm 4\times10^{-5}\) | \(1.25 \pm 0.01\) | \(1.42 \pm 0.02\) |
| 4 | \(0\) | \(0.0474 \pm 4\times10^{-5}\) | \(0.0580 \pm 0.0001\) | \(0.0266 \pm 2\times10^{-5}\) | \(1.20 \pm 0.01\) | \(1.29 \pm 0.01\) |
| 8 | \(0\) | \(0.0238 \pm 2\times10^{-5}\) | \(0.0355 \pm 5\times10^{-5}\) | \(0.0151 \pm 1\times10^{-5}\) | \(1.13 \pm 0.01\) | \(1.19 \pm 0.01\) |
| 16 | \(0\) | \(0.0119 \pm 1\times10^{-5}\) | \(0.0210 \pm 4\times10^{-5}\) | \(0.00826 \pm 8\times10^{-6}\) | \(1.11 \pm 0.01\) | \(1.19 \pm 0.01\) |
Table 4 shows two effects. For the deterministic denominator, the mean drift shift is structurally zero and the \(\eta\)-scaled noise variance is nearly halved whenever \(\ell_b\) is doubled. For the random denominator, increasing \(\ell_b\) also reduces the extra mean drift shift, but this first-order bias is not absent at finite batch size. The observable error \(|\Delta \mathbb{E}x^4|\) moves in the same direction, so the batch-size trend is visible both at the drift level and at the stationary-observable level.
Experiment 4: Deterministic-envelope choices for radial targets.
The next experiment returns to the selective-taming principle in Remark 5. Once the denominator is deterministic, the remaining design question is where the envelope should start acting. We use the controlled radial potential \[U_p(x)=\frac{\|x\|^p}{p},\qquad x\in\mathbb{R}^d,\] with \(d=5\). Under the Gibbs reference law, \(\pi(U_p)=d/p\), so we measure stationary risk error by \[\left|\widehat\mathbb{E}_{\pi_\eta}U_p-\frac{d}{p}\right|.\] This observable is used only as a finite-stepsize stationary check; no convergence-rate fitting is used.
We compare gradient-dependent denominator taming, global hard deterministic taming, global soft deterministic taming, local hard deterministic taming, and the hybrid deterministic envelope \[A^{\rm hyb}(x) =\big(\|\nabla U_p(x)\|-R\big)_+^{1/2} +\big(\|\nabla U_p(x)\|-S\big)_+ .\] The first term keeps the envelope inactive in the safe region and turns it on softly afterward; the second term is a hard-tail safeguard. Thus the experiment compares different choices of the taming range, rather than different stochastic-gradient oracles. The envelope parameters follow the fixed stress-test rules in Table 2.
| Method | \(\mathcal{D}_\eta\) scale | \((p,\eta)=(8,0.025)\) | \((10,0.015)\) | \((30,0.002)\) | \((30,0.005)\) |
|---|---|---|---|---|---|
| Random denominator | – | \(2.22\times10^{1}\pm3.8\times10^{-1}\) | \(2.18\times10^{1}\pm5.9\times10^{-1}\) | \(1.19\times10^{3}\pm1.12\times10^{3}\) | \(2.78\times10^{5}\pm2.72\times10^{4}\) |
| Global hard deterministic | \(\le 2.8\) | \(1.95\times10^{1}\pm5.2\times10^{-1}\) | \(2.18\times10^{1}\pm7.5\times10^{-1}\) | \(1.08\times10^{2}\pm2.18\times10^{1}\) | \(1.25\times10^{5}\pm5.90\times10^{4}\) |
| Global soft deterministic | \(\le 1.3\) | \(8.35\times10^{-1}\pm2.2\times10^{-2}\) | \(5.55\times10^{-1}\pm2.1\times10^{-2}\) | \(1.33\times10^{-1}\pm1.3\times10^{-2}\) | unstable |
| Local hard deterministic | \(\le 1.3\) | \(2.52\times10^{-1}\pm1.1\times10^{-2}\) | \(1.28\times10^{-1}\pm6.0\times10^{-3}\) | \(6.79\pm3.43\) | \(4.58\times10^{2}\pm4.22\times10^{2}\) |
| Hybrid deterministic | \(\le 1.3\) | \(2.07\times10^{-1}\pm3.3\times10^{-3}\) | \(1.14\times10^{-1}\pm3.1\times10^{-3}\) | \(6.06\times10^{-2}\pm1.1\times10^{-2}\) | \(1.82\times10^{1}\pm8.94\) |
Table 5 reports absolute error relative to \(d/p\), averaged over three independent repetitions. The main empirical comparison is the invariant-law error and stability behavior. Here “unstable” means that the run leaves the prescribed computational domain, produces non-finite values, or has moment estimates dominated by rare explosive excursions before the sampling horizon. The \(\mathcal{D}_\eta\)-scale column is included as a grouped diagnostic linking the experiment to the fixed-law residual mechanism in Proposition 18.
The results support the selective-taming principle. Global hard taming is stable but can be overly conservative, while the global soft row is mild in easier cases but becomes unstable in the hardest case, consistent with the far-tail limitation in Remark 6. The hybrid envelopes combine mild typical-region behavior with a hard-tail safeguard and give the smallest errors among the reported stable deterministic-envelope runs.
To make this interpretation concrete, Table 6 reports envelope-range diagnostics for the hardest radial case \(p,\eta)=(30,0.005)\). The effective drift factor is \[R_\eta(x)=\frac{1}{1+\eta^\alpha A_\eta(x)},\] so smaller values mean stronger taming. The first row measures how much drift is retained at the 99.9% reference quantile of \(\|\nabla U_p(X)\|\). The second row measures the far-tail deterministic step size \(\eta\|\nabla U_p\|R_\eta\) at \(\|\nabla U_p\|=10^5\).
| Diagnostic | Global hard | Global soft | Local soft | Local hard | Hybrid |
|---|---|---|---|---|---|
| \(R_\eta\) at 99.9% reference quantile | 0.0969 | 0.496 | 0.533 | 1.000 | 0.564 |
| Far-tail step at \(\|\nabla U_p\|=10^5\) | \(5.42\times10^{-2}\) | 16.54 | 16.59 | \(5.44\times10^{-2}\) | \(5.57\times10^{-2}\) |
Table 6 gives the local scale information behind these outcomes. Global hard taming already removes most of the drift at the 99.9% reference quantile, while the hybrid envelope retains more than half of it. Local soft envelopes are also mild near the reference mass, but their far-tail step remains large; the hard-tail part of the hybrid rule brings this step back to the hard-taming scale.
The local hard row shows the opposite failure mode: it is inactive on the sampled reference mass but can turn on too late for good finite-stepsize stationary behavior. Overall, the diagnostics match the design compromise in Remark 5: mild behavior near the typical region, with a hard safeguard only in the far tail.
Experiment 5: Non-radial quartic-regression target.
The radial tests above isolate the denominator and envelope choices in a setting with an analytic reference value. We next compare ordinary global taming with selective deterministic envelopes in a non-radial empirical-risk problem. The purpose is to check whether the advantage of the envelope family persists beyond radial examples.
We use the quartic-regression objective in ?? , repeated here for convenience: \[\label{eq:quartic-regression-experiment} F_z(w)=\frac{1}{n}\sum_{i=1}^n \frac{1}{4}(a_i^\top w-y_i)^4+\frac{\lambda}{2}\|w\|^2 .\tag{23}\] Its gradient depends cubically on the residuals \(a_i^\top w-y_i\), so the drift scale is nonuniform across directions and regions of the state space. This makes it a natural test case for selective taming: global taming can be stable but conservative, while local or hybrid envelopes can leave moderate-gradient regions less changed and still act when the drift scale is large.
The stochastic-gradient oracle is the mini-batch estimator \[g(w,B)=\frac{1}{|B|}\sum_{i\in B}\nabla_w \left[\frac{1}{4}(a_i^\top w-y_i)^4+\frac{\lambda}{2}\|w\|^2\right],\] with batches sampled uniformly from the dataset. In the first run we use \(d=4\), \(n=50\), ridge parameter \(\lambda=0.2\), Gaussian covariates scaled by \(d^{-1/2}\), and mini-batch size \(|B|=6\).
Since no closed-form Gibbs reference is available, we use small-stepsize exact-gradient Langevin runs as numerical references: \(\eta_{\rm ref}=10^{-3}\), 80 parallel chains, 5000 iterations, and 1500 burn-in iterations. Eight independent reference runs give reference empirical-risk average approximately \(1.46\), with standard error about \(2.2\times10^{-2}\). The sampled chains use 40 parallel chains, 2500 iterations, and 800 burn-in iterations. A run is declared unstable if \(\|w_k\|>25\) or if the empirical risk becomes non-finite.
To isolate the denominator-design effect, Table 7 first uses the full-gradient envelope \(\bar A_{\rm diag}(w)=\|\nabla F_z(w)\|\) for deterministic-envelope methods. Values close to the propagated uncertainty scale \(\mathrm{SE}(\Delta H)\) should be interpreted as reaching the numerical-reference noise floor rather than as meaningful nonzero stationary bias.
| Method | \(\eta=0.005\) | \(\eta=0.009\) | ||
|---|---|---|---|---|
| 2-3(lr)4-5 | Risk mean \(\pm\) SE | Error | Risk mean \(\pm\) SE | Error |
| Random denominator | \(3.049\pm0.182\) | \(1.586\) | \(2.947\pm0.104\) | \(1.484\) |
| Global hard deterministic | \(2.020\pm0.013\) | \(0.558\) | \(2.287\pm0.085\) | \(0.824\) |
| Global soft deterministic | \(1.764\pm0.114\) | \(0.301\) | \(1.956\pm0.013\) | \(0.493\) |
| Local hard deterministic | \(1.542\pm0.015\) | \(0.080\) | \(1.588\pm0.031\) | \(0.125\) |
| Hybrid deterministic | \(1.562\pm0.030\) | \(0.099\) | \(1.581\pm0.042\) | \(0.118\) |
The local hard and hybrid rows are close to the numerical-reference noise floor, while random-denominator and global hard taming remain visibly farther from the exact-gradient reference. Thus, in this non-radial example, selective deterministic envelopes improve on ordinary global taming, with local hard and hybrid both effective. The slightly smaller error of local hard in the smaller-stepsize run is consistent with the envelope interpretation: when tail excursions are rare, a local hard rule can be nearly inactive on the sampled typical region and therefore introduce less deterministic shrinkage, while the hybrid rule trades this for additional tail robustness.
These risk means are stationary averages, not optimized training losses. Several stabilized schemes may still move toward low-risk regions when viewed as optimization methods, but their fixed-step invariant laws can differ. A random denominator changes the transition kernel by coupling the current mini-batch gradient to the taming factor, and this mean distortion is visible in stationary averages such as \(\pi_\eta(F_z)\).
The same qualitative separation appears in a moderately larger synthetic instance with \(n=500\), \(d=10\), and mini-batch size \(|B|=20\). The reference is again a small-stepsize exact-gradient Langevin numerical average for the same empirical objective, with estimated reference standard error about \(9.6\times10^{-2}\). Under the propagated-error calculation, the hybrid and local hard rows remain several uncertainty scales closer to the reference than the random-denominator and global-hard rows. All listed runs had zero blow-up.
| Method | Risk mean \(\pm\) SE | Error |
|---|---|---|
| Random denominator | \(5.307\pm0.146\) | \(2.10\) |
| Global hard deterministic | \(4.814\pm0.060\) | \(1.61\) |
| Local hard deterministic | \(3.885\pm0.216\) | \(6.81\times10^{-1}\) |
| Hybrid deterministic | \(3.682\pm0.036\) | \(4.77\times10^{-1}\) |
| Hybrid polynomial envelope | \(18.558\pm0.939\) | \(1.54\times10^{1}\) |
Experiment 6: Implementable deterministic envelopes.
Experiment 6 replaces the full-gradient diagnostic envelope by a cheaper deterministic growth bound. The full-gradient envelope \(\bar A_{\rm diag}(w)=\|\nabla F_z(w)\|\) is useful for mechanism diagnosis, while an implementable rule can use a deterministic polynomial scale. For the quartic regression objective, we use \[\bar A_{\rm poly}(w)=C_z(1+\|w\|^3),\] which is independent of the current mini-batch and has negligible cost compared with a mini-batch gradient evaluation.
Table 9 compares this polynomial envelope with the full-gradient envelope. Since the polynomial envelope operates on a different numerical scale, the local and hybrid thresholds are rescaled. The reference standard error is about \(2.2\times10^{-2}\); for the ideal hybrid row, the reported error is below the propagated numerical-reference uncertainty scale, while the polynomial hybrid and global-hard errors remain much larger.
| Method | Envelope | Thresholds \((R,S)\) | Risk mean \(\pm\) SE | Risk error |
|---|---|---|---|---|
| Global hard | ideal | – | \(2.085\pm0.007\) | \(6.23\times10^{-1}\) |
| Global hard | poly | – | \(47.421\pm8.294\) | \(4.60\times10^{1}\) |
| Local hard | ideal | \((5,50)\) | \(1.584\pm0.054\) | \(1.21\times10^{-1}\) |
| Local hard | poly | \((200,2000)\) | \(15.539\pm5.444\) | \(1.41\times10^{1}\) |
| Hybrid | ideal | \((5,50)\) | \(1.460\pm0.061\) | \(2.50\times10^{-3}\) |
| Hybrid | poly | \((200,2000)\) | \(2.023\pm0.060\) | \(5.61\times10^{-1}\) |
The ideal and polynomial hybrid rows use the same hybrid activation pattern; they differ only in the deterministic growth indicator. The ideal row uses the full-gradient scale \(\|\nabla F_z(w)\|\), whereas the polynomial row uses the cheaper proxy \(C_z(1+\|w\|^3)\). Thus Experiment 6 tests whether the selective-envelope idea remains useful under a coarser, implementable scale. The polynomial hybrid row retains a clear advantage over the global-hard and local-hard polynomial rows, although its gap from the ideal hybrid row shows that envelope scale matching still matters.
To see why, Table 10 reports the effective drift factor \[R_\eta(w)=\frac{1}{1+\eta^\alpha A_\eta(w)}\] at two reference quantiles of the implementable polynomial scale. Larger values of \(R_\eta\) mean that more of the original drift is retained after taming.
| Reference quantile of \(\bar A_{\rm poly}(W)\) | \(\bar A_{\rm poly}\) | Global hard poly | Local hard poly | Hybrid poly |
|---|---|---|---|---|
| 95% | 94.2 | 0.102 | 1.000 | 1.000 |
| 99.9% | 206.2 | 0.050 | 0.637 | 0.813 |
The table helps explain the pattern in Table 9. The global hard polynomial envelope is already very aggressive over much of the reference mass: at the 95% quantile it keeps only about 10% of the drift. The local and hybrid polynomial envelopes leave that region essentially unchanged. At the 99.9% quantile the hybrid envelope has started to act, but it remains much milder than the global hard polynomial denominator.
This is the selective-taming design of Remark 5 in an implementable form. The envelope family gives different ways of choosing where taming turns on; for this quartic-regression problem, the hybrid polynomial rule is a better match to the observed growth-scale separation than the ordinary global polynomial denominator.
Experiment 7: High-dimensional quartic-regression stress test.
Finally, we include a calibrated high-dimensional stress test with the same quartic-regression structure, using \(n=1000\), \(d=50\), mini-batch size \(|B|=50\), and \(\eta=8\times10^{-4}\). The numerical reference is an averaged small-stepsize exact-gradient run for the same empirical objective, computed from twelve independent reference chains; the estimated reference empirical risk is \(8.69\), with standard error about \(8.3\times10^{-2}\).
The hybrid thresholds are selected from warm-up quantiles of the deterministic growth indicator, with \(R\approx Q_{0.6}\), \(S\approx Q_{0.99}\), and \(\gamma=0.5\), so that the safe, soft, and hard-tail regimes are all represented. The selected thresholds are then held fixed for the reported production runs. In Table 11, entries are relative to the averaged exact-gradient numerical reference, and the safe/soft/tail columns report sampled regime fractions.
| Method | Risk mean \(\pm\) SE | Error | Safe | Soft | Tail |
|---|---|---|---|---|---|
| Random denominator | \(10.579\pm0.610\) | \(1.89\) | – | – | – |
| Global hard deterministic | \(9.662\pm0.382\) | \(9.76\times10^{-1}\) | – | – | – |
| Local hard deterministic | \(10.458\pm0.257\) | \(1.77\) | 0.55 | 0.36 | 0.09 |
| Hybrid deterministic | \(8.999\pm0.347\) | \(3.13\times10^{-1}\) | 0.63 | 0.36 | 0.01 |
Table 11 is a stress test of the envelope family. The high-dimensional reference itself has a non-negligible Monte Carlo uncertainty. The selected deterministic-envelope choice remains stable and gives the smallest reported stationary error, but its error, about \(3.13\times10^{-1}\), is comparable to the propagated uncertainty scale \(3.57\times10^{-1}\). Thus the selected hybrid row is already at the numerical-reference resolution scale for this experiment.
By contrast, the random-denominator, global-hard, and local hard rows remain several propagated standard errors away from the numerical reference, so their larger discrepancies are still informative method-level differences. Thus, even in this higher-dimensional stress setting, the hybrid envelope still shows a clear advantage among the reported denominator designs. This suggests that the selective-envelope idea remains useful in moderately high dimension, while the choice of envelope parameters becomes more sensitive to dimension.
Overall, the numerical results support the interpretation developed above. Random-denominator taming and global hard deterministic taming can stabilize the update, but they may introduce large finite-stepsize stationary error for different reasons. Local and hybrid envelopes instead choose where taming turns on.
The examples also show that the best member of the envelope family can be problem-dependent. In the moderate quartic-regression example, local hard and hybrid can be statistically comparable; in the high-dimensional stress test, the hybrid rule is more robust among the reported choices. The polynomial-envelope rows show an additional scale effect: matching polynomial growth can be enough for stability control but still produce poor finite-stepsize error if the envelope is too conservative on the typical region.
This paper studied tamed denominators in fixed-stepsize stochastic-gradient Langevin sampling from an oracle-structure viewpoint. The main observation is that a denominator depending on the same stochastic-gradient realization as the numerator is not a neutral stabilizer: it changes the stochastic oracle and can create a stationary mean distortion even when the original stochastic gradient is unbiased. Deterministic envelopes separate stabilization from current oracle randomness by fixing the denominator conditional on the state.
The deterministic-envelope framework turns this observation into a denominator-design principle. The denominator is a problem-dependent component of the Markov transition: it controls both the coupling to stochastic-gradient noise and the region in which stabilization is activated. Global deterministic envelopes remove the oracle-coupled mean-shift channel, but they may still damp the drift too strongly in typical regions. Localized and hybrid envelopes address this second issue by choosing where taming turns on. In particular, the hybrid construction combines mild behavior near the sampled mass with a hard-tail safeguard for rare excursions.
The theory reflects this separation. Weak stationary consistency identifies the limiting Gibbs law, while the stationary error decomposition separates the Hölder discretization remainder, the deterministic-envelope residual, and the stochastic-gradient covariance residual. This decomposition also suggests a residual-budget view of denominator design: avoid the oracle-coupled mean-shift channel, keep deterministic-envelope residuals small in typical regions, and retain far-tail control for stability. Turning this view into systematic rules for envelope selection is a natural next step. The numerical experiments support the same interpretation: random denominators create visible drift shifts, batch-size scaling controls the covariance contribution, selective envelopes reduce stationary error relative to ordinary global taming, and the hybrid design remains effective in the higher-dimensional stress test.
The present framework suggests a broader denominator-design program for tamed stochastic-gradient Langevin kernels. For a tamed stochastic-gradient oracle, the denominator should be chosen as a deterministic envelope rather than as a fixed stabilization formula or a function of the current oracle realization. The stationary decomposition gives a practical guide for this design: avoid the oracle-coupled mean-shift channel, keep deterministic-envelope residuals small in typical regions, and retain enough far-tail control for stability.
Several questions remain open. The most immediate one is how to turn this residual-budget view into systematic rules for choosing the envelope scale, activation thresholds, soft-growth exponent, and implementable growth proxy. The experiments indicate that these choices depend on the growth profile of the objective and become more delicate as dimension increases. A further direction is to extend the same deterministic-envelope principle to more general stochastic-gradient oracles, as long as the denominator remains fixed before the current oracle noise is sampled. The central point is that the denominator should be a deterministic, problem-dependent component of the Markov transition, not an additional stochastic transformation of the oracle.