Pith. sign in

REVIEW 1 cited by

A modified tamed scheme for stochastic differential equations with superlinear drifts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2507.09475 v1 pith:RSZBSU7A submitted 2025-07-13 math.NA cs.NA

A modified tamed scheme for stochastic differential equations with superlinear drifts

classification math.NA cs.NA
keywords tamedmodifiedschemeschemesdiscretizationexplicitstochasticanalysis
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Explicit discretizations of stochastic differential equations often encounter instability when the coefficients are not globally Lipschitz. The truncated schemes and tamed schemes have been proposed to handle this difficulty, but truncated schemes involve analyzing of the stopping times while the tamed schemes suffer from the reduced order of accuracy. We propose a modified tamed scheme by introducing an additional cut-off function in the taming, which enjoys the convenience for error analysis and preserving the original order of explicit discretization. While the strategy could be applied to any explicit discretization, we perform rigorous analysis of the modified tamed scheme for the Euler discretization as an example. Then, we apply the modified tamed scheme to the stochastic gradient Langevin dynamics for sampling with super-linear drift, and obtain a uniform-in-time near-sharp error estimate under relative entropy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. RELTA-SGLD: Relative-Growth Localized Taming for Nonconvex Stochastic-Gradient Langevin Learning

    stat.ML 2026-07 conditional novelty 6.0

    A relative-growth, threshold-localized taming denominator for SGLD achieves O(λ) stationary W1 and (in the potential case) W2 accuracy for nonconvex superlinear stochastic-gradient oracles.