Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients

C\'onall Kelly; Fandi Sun; Gabriel Lord

REVIEW 2 major objections 4 minor 28 references

Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients

T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that an explicit adaptive Milstein scheme, using path-bounded step sizes and a backstop method, converges strongly with first order for SDEs with one-sided Lipschitz drift and no commutativity condition on the noise.

desk verdict A genuinely new adaptive Milstein scheme without commutativity, with a main convergence proof that contains one repairable false equality and a backstop gap; worth refereeing, not accept-ready. read the letter →

arxiv 1909.00099 v2 pith:VVYR6ZDJ submitted 2019-08-31 math.NA cs.NA

Cónall Kelly , Gabriel Lord , Fandi Sun This is my paper · ORCID

classification math.NAcs.NA MSC 65C3060H35

keywords stochasticdifferentialequationsadaptivetime-steppingMilsteinmethodstrongconvergenceone-sidedLipschitzdriftLévyareanon-commutativenoisebackstop

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves a first-order strong-convergence result for an explicit adaptive Milstein method applied to SDEs whose drift is only one-sided Lipschitz and may grow polynomially, with no commutativity condition on the noise. The method shrinks its step size when the numerical path approaches a sphere of radius $R$, and falls back to a small-step backstop scheme if the step would become too small. The main theorem bounds the $L_2$ error at the terminal time by $C h_{\max}$, so halving the maximum step halves the error. This matters because explicit methods on uniform meshes are known to diverge for such SDEs, and Milstein-type methods usually need commutative noise; the adaptive scheme overcomes both. The paper also shows the probability of ever invoking the backstop can be made arbitrarily small.

What carries the argument

The central object is a path-bounded time-stepping strategy (Definition 3.3): whenever the step size is interior, the numerical path satisfies $Q \leq \|Y_n\| < R$, in practice achieved by $h_{n+1} = \max(h_{\min}, \min(h_{\max}, h_{\max}/\|Y_n\|))$, so the step shrinks as the norm grows. Bounding the path by $R$ makes the non-globally Lipschitz drift bounded along the numerical path, turning the one-sided Lipschitz condition into a usable error estimate. The argument also relies on the mean-square consistency bound (3.5) for the backstop method used at $h_{\min}$, and on Lemma 2.3, which bounds conditional moments of L\'evy areas by powers of the step length; that lemma is what lets the proof handle non-commutative noise.

What would settle it

Estimate the conditional mean-square error in (3.5) for one step of the tamed Milstein backstop at $h_{\min}$ in the non-commutative setup: if Monte Carlo averages show it scales worse than $h_{\min}^3$, the backstop does not meet the theorem's hypothesis, and a direct strong-convergence plot for the full scheme in that regime should show order loss.

Watch

Extended reading notes

Core claim

The central claim is Theorem 4.1: for a solution $X$ of (1.1) and an adaptive Milstein solution $\bar{Y}$ built with a path-bounded time-stepping strategy (Definition 3.3) and a backstop satisfying the mean-square consistency bound (3.5), the root-mean-square terminal error satisfies $(\mathbb{E}[\|X(T)-\bar{Y}(T)\|^2])^{1/2} \leq C(R,\rho,h_{\max}) h_{\max}$, with $C(R,\rho,h_{\max}) = C(R,\rho) + O(h_{\max})$. Thus, for fixed radius $R$ and step ratio $\rho$, the scheme is strongly convergent of order one. A second result (Theorem 4.2) says the probability that a step falls below $h_{\min}$ and triggers the backstop can be made smaller than any tolerance by taking $\rho$ large enough. The proof does not impose the commutativity condition $Dg_i g_j = Dg_j g_i$; instead it uses conditional moment bounds on L\'evy areas (Lemma 2.3) to control the non-commutative terms.

Load-bearing premise

Everything rests on the backstop method satisfying a mean-square accuracy condition, and in the non-commutative numerical test that condition is assumed rather than checked, because the tamed Milstein backstop was only proven for commutative noise.

Editorial extensions

If this is right

For additive noise, the adaptive Milstein scheme coincides with an adaptive Euler-Maruyama scheme, and the same proof gives order-one strong convergence for that scheme.
The method applies without the commutativity condition (2.16), so the L\'evy-area terms are controlled rather than assumed away.
The probability of using the backstop at any step can be driven below any fixed tolerance by increasing $\rho$, so in typical runs the backstop is rarely activated.
The error constant grows as $\rho \to \infty$, so a larger step ratio makes backstop use rarer but worsens the error constant; $h_{\max}$ and $\rho$ must be balanced.
The error bound depends on $R$ through constants that grow with $R$, so paths should be confined to the smallest radius compatible with the dynamics.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A natural extension is to prove the mean-square bound (3.5) for the tamed Milstein backstop in the non-commutative setting; that would close the gap between the theorem's hypotheses and the paper's two-dimensional numerical example.
The path-bounded strategy suggests a practical calibration rule: choose $\rho$ large enough that the backstop is never triggered, then choose $h_{\max}$ small enough that the $O(h_{\max})$ term in the error constant stays negligible.
Because the error bound is exponential in $T$ and in constants depending on $R$, the method is likely best suited to moderate time horizons; the adaptive step rule could be combined with other base methods whenever a backstop satisfying (3.5) is available.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Quick take: this is a genuinely new adaptive Milstein method for non-globally Lipschitz SDEs without commutativity, and the main theorem is almost right—but there is a false equality in the proof of Theorem 4.1 that needs repairing, not just polishing.

What it does well: the path-bounded step-size strategy is a real extension of the authors' earlier adaptive Euler framework. The proof is structured honestly: explicit constants, separate treatment of drift and diffusion errors, and a self-contained Lévy area moment lemma via the characteristic function. The claim that the backstop is used with arbitrarily small probability (Theorem 4.2) follows from Markov and the convergence bound. That is a useful package.

The soft spots, in order of severity. First, I1.2 in Section 6: the paper sets E[|F_tn]=0 "by (3.6)". That is not justified. E(r)=X(r)-Ybar(r) depends on the Brownian increments on [tn,r], so it is not F_tn-measurable, and the conditional expectation of the product does not vanish. The stress-test example is correct: for f(x)=g(x)=x, one gets nonzero x0 Δt(e^{Δt}-1), which is O(Δt^2). So the printed equality is false. The good news is the error is not order-destroying; it can be bounded by (1/2)E‖E(r)‖^2 + C Δt^2 and absorbed into the existing K2 h^2 terms. The proof is repairable, but a referee should insist the step be rewritten.

Second, the backstop gap the reader flagged: Theorem 4.1 assumes the backstop φ satisfies (3.5), and Remark 3.1 says in practice they use tamed Milstein (2.15), which is only proved for commutative noise. In the non-commutative experiment (Section 5.2), the implemented backstop is therefore not covered by existing theory, and (3.5) is never checked. This is a real gap, though it may be minor in practice because the backstop is rarely triggered. It should be stated as an assumption plus numerical evidence, not left implicit.

Third, the numerical rate plots compare hmax for the adaptive scheme against hmean for fixed-step schemes. That is a defensible convention, but it slightly obscures the comparison; worth an explicit sentence.

Bottom line: the central idea is new and the convergence framework is mostly sound, but the false equality means the paper is not accept-ready. I would send it out—a good referee can get the proof fixed in one round.

Referee Report

2 major / 4 minor

Summary. The paper introduces an explicit adaptive time-stepping Milstein method for Itô SDEs with one-sided Lipschitz drift and globally Lipschitz diffusion, without the usual commutativity assumption on the noise. The stepsize is chosen by a path-bounded strategy that shrinks steps when the numerical solution nears a sphere and invokes a backstop method if the step would fall below a minimum size. The main result (Theorem 4.1) states that, for any backstop satisfying the conditional mean-square consistency bound (3.5), the method is strongly L2 convergent of order one in the maximum step size; Theorem 4.2 asserts that the probability of using the backstop can be made arbitrarily small. The proofs rely on new moment bounds for Lévy areas (Lemma 2.3), proved in the appendix via the characteristic function. Numerical experiments on scalar and two-dimensional systems with multiplicative, additive, and non-commutative noise illustrate the convergence and efficiency claims.

Significance. If the proof is repaired, the paper makes a solid contribution: it provides an explicit order-one strong scheme for non-globally Lipschitz SDEs that does not require the commutativity condition, and it does so within a general adaptive framework with a probabilistic guarantee on backstop usage. The self-contained Lévy-area moment estimates with explicit constants, the detailed one-step error analysis, and the demonstration that the backstop is rarely triggered are strengths. The central convergence result depends on a hypothesis on the backstop that is not verified for the non-commutative numerical example, and the proof contains a false equality in the local error analysis; both issues are local and repairable, so the core claim remains plausible.

major comments (2)

[Section 6, proof of Theorem 4.1, estimate for I_{1.2}] In the estimate for I_{1.2} (the second line after Eq. (6.9)), the equality to zero is not justified by (3.6). The error E(r) = X(r) - Ybar(r) depends on the Brownian increments on [tn, r], so it is not F_tn-measurable, and E[<E(r), V>|F_tn] with V = sum_i Df(Yn)g_i(Yn)∫_{tn}^r dW_i does not generally vanish. A concrete scalar example with f(x)=g(x)=x and Yn=x0 gives E[(X(r)-Ybar(r))∫_{tn}^r dW] = x0 (r-tn)(e^{r-tn}-1), which is nonzero. This is load-bearing because it removes a term from the local error bound (6.15); as written, the proof does not establish (6.15). The term appears to be O((r-tn)^2) and can be bounded via Cauchy-Schwarz and an 'a b' inequality, preserving the Gronwall argument and the final order-one convergence, but the proof must be corrected.
[Definition 3.2 / Remark 3.1 / Section 5.2] The theorem requires the backstop map φ to satisfy the conditional mean-square bound (3.5). In the numerical experiments the backstop is the tamed Milstein method (2.15) from [27], which is analysed in [27] only under the commutativity condition (2.16). For the non-commutative test in Section 5.2, (2.16) fails and (3.5) is not verified, so the experiment in Figure 2(e,f) is not covered by Theorem 4.1. The authors should either prove (3.5) for a tamed/truncated Milstein scheme without commutativity, or use a backstop for which (3.5) is known to hold, or explicitly state that the non-commutative experiment is illustrative rather than a consequence of the theorem.

minor comments (4)

[Assumption 3.1] The word 'asssume' should be 'assume'.
[Definition 3.2, Eq. (3.4)] In the display of (3.4), the integrals in the backstop term are written with limits ∫_s^{tn}, which appears to be reversed; they should presumably read ∫_{tn}^{s}.
[Theorem 4.2, proof] The proof invokes (4.1) for the error X(tn)-Yn at intermediate mesh points, but (4.1) is stated only for the terminal time T. The argument would be complete if the authors state that the same bound holds at all mesh points, or justify the extension.
[Figure 2 caption] In the caption of Figure 2(e), 'Aaptive' should be 'Adaptive'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the strong-convergence proof is self-contained, with explicit constants and independently derived Lévy-area bounds; cited prior work is background, not load-bearing.

full rationale

The central claim (Theorem 4.1) is proved directly by a one-step error decomposition and Gronwall argument; the constants in (6.10), (6.11), (6.14) and (6.19) are explicit upper bounds and no parameter is fitted to simulation data or renamed as a prediction. The backstop consistency condition (3.5) is an explicit hypothesis, and the final error constant depends on its constants C1 and C2; this is a standard modular assumption, not a circular input. Lemma 2.3 (Lévy-area moment bounds) is proved in Appendix A from the characteristic function of the Lévy area, and the cited inputs are classical results (Lévy, Malham–Wiese), not the authors' own conclusions. The paper does rely on the authors' earlier adaptive Euler–Maruyama framework [14,15] for the definition of admissible/backstop strategies and for Remarks 3.1–3.2, but the Milstein convergence proof does not reduce to those papers: it re-derives the required estimates and introduces the path-bounded condition as a new sufficient condition. Theorem 4.2 uses Theorem 4.1's bound, but that is legitimate use of a previously proved result rather than a self-referential definition. The use of the tamed Milstein method [27] as the backstop in the numerical experiments is not backed by a proof of (3.5) for non-commutative noise, and the I1,2 step in the proof appears to contain an unjustified zero; both are correctness risks, not circularity. Overall the derivation chain does not reduce to its own inputs.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claim rests on standard SDE theory (existence, moments, Ito formula), one new moment estimate for Levy areas, and one ad hoc consistency assumption on the backstop method. The ad hoc assumption is the most fragile element because it is not verified for the implementation used in the non-commutative numerical test.

assumptions (5)

domain assumption The drift f is C^2 and satisfies one-sided Lipschitz (2.2), polynomial derivative bounds (2.3) and (2.4); the diffusion g is C^2, globally Lipschitz, with bounded second derivative (2.6) and (2.7).
These are the standing assumptions on the SDE coefficients; they imply existence and uniqueness of the solution and are needed for the Milstein expansion.
standard math The SDE (1.1) has a unique strong solution and finite moments (Lemma 2.2 via [8, Lemma 3.2]).
Used throughout the error analysis to bound moments of the exact solution; taken from Higham, Mao, and Stuart.
standard math Levy area moments satisfy E[|Aij(tn,s)|^b | Ftn] <= Ihat_b |s-tn|^b (Lemma 2.3).
Proven in Appendix A from the characteristic function of the Levy area, following Levy [18].
ad hoc to paper The backstop method phi satisfies the mean-square consistency bound (3.5) with constants C1 and C2.
This is an assumption on the fallback method that is never verified for the tamed Milstein backstop used in the non-commutative numerical examples.
standard math Optional sampling and conditional normality of Wiener increments over Ftn-stopping times (Remark 3.2).
Used to compute conditional moments of stochastic integrals over random meshes.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients." pith.science (2026). https://pith.science/paper/VVYR6ZDJ

@misc{pith2026190900099,
  author       = {Pith},
  title        = {Pith review of: Strong convergence of an adaptive time-stepping Milstein method for SDEs with monotone coefficients},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VVYR6ZDJ}},
  note         = {Machine review of arXiv:1909.00099}
}

abstract

We introduce an explicit adaptive Milstein method for stochastic differential equations (SDEs) with no commutativity condition. The drift and diffusion are separately locally Lipschitz and together satisfy a monotone condition. This method relies on a class of path-bounded time-stepping strategies which work by reducing the stepsize as solutions approach the boundary of a sphere, invoking a backstop method in the event that the timestep becomes too small. We prove that such schemes are strongly $L_2$ convergent of order one. This order is inherited by an explicit adaptive Euler-Maruyama scheme in the additive noise case. Moreover we show that the probability of using the backstop method at any step can be made arbitrarily small. We compare our method to other fixed-step Milstein variants on a range of test problems.

Figures

Figures reproduced from arXiv: 1909.00099 by the authors.

**Figure 1.** Scalar equation (5.3). (a) and (b) show the strong convergence and efficiency for multiplicative noise (G(x) = 0.2(1 − x)) and (c) and (d) with additive noise (G(x) = 0.2). In (e) and (f) we illustrate with multiplicative noise that the probability of hitting hmin can be made small [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗

**Figure 2.** Two-dimensional system (5.4). (a) and (b) show the strong convergence and efficiency for diagonal noise, (c) and (d) with commutative and (e) and (f) for non-commutative noise [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

[27]

W ang and S

X. W ang and S. Gan. The tamed Milstein method for commuta tive stochastic diﬀerential equations with non-globally Lipschitz continuous coeﬃcients. Journal of Diﬀerence Equations and Applications , 19(3):466–490, 2013

work page 2013
[1]

W.-J. Beyn, E. Isaak, and R. Kruse. Stochastic C-stabili ty and B-consistency of explicit and implicit Milstein-typ e schemes. Journal of Scientiﬁc Computing , 70(3):1042–1077, Mar 2017

work page 2017
[2]

P. M. Burrage, R. Herdiana, and K. Burrage. Adaptive step size based on control theory for stochastic diﬀerential equations. Journal of Computational and Applied Mathematics , 171(1-2):317–336, 2004

work page 2004
[3]

S. Dineen. Probability Theory in Finance: a mathematical guide to the B lack-Scholes Formula . Graduate studies in mathematics; v.70. American Mathematical Society, Univ ersities Press, 2011

work page 2011
[4]

Gaines and T

J. Gaines and T. Lyons. Variable step size control in the n umerical solution of stochastic diﬀerential equations. SIAM J. on Applied Math. , 57(5):1455–1484, 1997

work page 1997
[5]

Q. Guo, W. Liu, X. Mao, and R. Yue. The truncated milstein m ethod for stochastic diﬀerential equations with commutative noise. Journal of Computational and Applied Mathematics , 338:298 – 310, 2018

work page 2018
[6]

Hasminskii

R. Hasminskii. Stochastic Stability of Diﬀerential Equations . Sijthoﬀ & Noordhoﬀ, 1980

work page 1980
[7]

D. J. Higham and P. E. Kloeden. Maple and matlab for stocha stic diﬀerential equations in ﬁnance. In Programming Languages and Systems in Computational Economics and Finan ce, pages 233–269. Springer, 2002

work page 2002

Show all 28 references

[8]

D. J. Higham, X. Mao, and A. M. Stuart. Strong convergence of Euler-type methods for nonlinear stochastic diﬀerential equations. SIAM Journal on Numerical Analysis , 40(3):1041–1063, 2002

2002
[9]

D. J. Higham, X. Mao, and L. Szpruch. Convergence, non-ne gativity and stability of a new Milstein scheme with applications to ﬁnance. Discrete and Continuous Dynamical Systems B , pages 2083–2100, 2013

2013
[10]

Hofmann, T

N. Hofmann, T. Mller-Gronbach, and K. Ritter. The optim al discretization of stochastic diﬀerential equations. Journal of Complexity , 17(1):117 – 153, 2001

2001
[11]

Hutzenthaler, A

M. Hutzenthaler, A. Jentzen, and P. E. Kloeden. Strong a nd weak divergence in ﬁnite time of Euler’s method for stochastic diﬀerential equations with non-globally Lipsc hitz continuous coeﬃcients. Proceedings of the Royal Society of London A: Mathematical, Physical and Enginee...

2011
[12]

Hutzenthaler, A

M. Hutzenthaler, A. Jentzen, P. E. Kloeden, et al. Stron g convergence of an explicit numerical method for SDEs with non-globally Lipschitz continuous coeﬃcients. The Annals of Applied Probability , 22(4):1611–1641, 2012

2012
[13]

S. Ilie, K. R. Jackson, and W. H. Enright. Adaptive time- stepping for the strong numerical solution of stochastic diﬀerential equations. Numer. Algorithms , 68(4):791–812, 2015

2015
[14]

Kelly and G

C. Kelly and G. Lord. Adaptive Euler methods for stochas tic systems with non-globally Lipschitz coeﬃcients. arXiv preprint arXiv:1805.11137, 2018

2018 arXiv
[15]

Kelly and G

C. Kelly and G. J. Lord. Adaptive time-stepping strateg ies for nonlinear stochastic systems. IMA Journal of Nu- merical Analysis, 2016

2016
[16]

Kloeden and E

P. Kloeden and E. Platen. Numerical methods for stochas tic diﬀerential equations. Stochastic Hydrology and Hy- draulics, 5(2):172–172, 1991

1991
[17]

Lamba, J

H. Lamba, J. C. Mattingly, and A. M. Stuart. An adaptive E uler-Maruyama scheme for SDEs: convergence and stability. IMA J. Numer. Anal. , 27(3):479–506, 2007

2007
[18]

P. L´ evy. Wiener’s random function, and other Laplacia n random functions. In Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability . The Regents of the University of California, 1951. 20 C ´ONALL KELLY, GABRIEL LORD, AND F ANDI SUN

1951
[19]

G. J. Lord, C. E. Powell, and T. Shardlow. An introduction to computational stochastic PDEs . Number 50. Cam- bridge University Press, 2014

2014
[20]

G. J. Lord and C. Stuart. Adaptive time-stepping for sto chastic partial diﬀerential equations with non-Lipschitz drift. arXiv:1812.09036

arXiv
[21]

Malham and A

S. Malham and A. Wiese. Eﬃcient almost-exact L´ evy area sampling. Statistics & Probability Letters , 88:50–55, 2014

2014
[22]

X. Mao. Stochastic diﬀerential equations and applications . W oodhead Publishing, Cambridge, 2 edition, 2007

2007
[23]

Mauthner

S. Mauthner. Step size control in the numerical solutio n of stochastic diﬀerential equations. J. of Comp. and Applied Math., 100(1):93–109, 1998

1998
[24]

Øksendal

B. Øksendal. Stochastic diﬀerential equations . Springer, 2003

2003
[25]

Shardlow and P

T. Shardlow and P. Taylor. On the pathwise approximatio n of stochastic diﬀerential equations. arXiv, 2015. 1409.2362v3

2015 arXiv
[26]

Shiryaev

A. Shiryaev. Probability. Springer, Berlin, 2 edition, 1996

1996
[28]

Yao and S

J. Yao and S. Gan. Stability of the drift-implicit and do uble-implicit Milstein schemes for nonlinear SDEs. Applied Mathematics and Computation , 339:294–301, 12 2018. School of Mathematical Sciences, University College Cork, I reland. E-mail address : conall.kelly@ucc.ie Max...

2018

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [27]

W ang and S

X. W ang and S. Gan. The tamed Milstein method for commuta tive stochastic diﬀerential equations with non-globally Lipschitz continuous coeﬃcients. Journal of Diﬀerence Equations and Applications , 19(3):466–490, 2013

work page 2013

[2] [1]

W.-J. Beyn, E. Isaak, and R. Kruse. Stochastic C-stabili ty and B-consistency of explicit and implicit Milstein-typ e schemes. Journal of Scientiﬁc Computing , 70(3):1042–1077, Mar 2017

work page 2017

[3] [2]

P. M. Burrage, R. Herdiana, and K. Burrage. Adaptive step size based on control theory for stochastic diﬀerential equations. Journal of Computational and Applied Mathematics , 171(1-2):317–336, 2004

work page 2004

[4] [3]

S. Dineen. Probability Theory in Finance: a mathematical guide to the B lack-Scholes Formula . Graduate studies in mathematics; v.70. American Mathematical Society, Univ ersities Press, 2011

work page 2011

[5] [4]

Gaines and T

J. Gaines and T. Lyons. Variable step size control in the n umerical solution of stochastic diﬀerential equations. SIAM J. on Applied Math. , 57(5):1455–1484, 1997

work page 1997

[6] [5]

Q. Guo, W. Liu, X. Mao, and R. Yue. The truncated milstein m ethod for stochastic diﬀerential equations with commutative noise. Journal of Computational and Applied Mathematics , 338:298 – 310, 2018

work page 2018

[7] [6]

Hasminskii

R. Hasminskii. Stochastic Stability of Diﬀerential Equations . Sijthoﬀ & Noordhoﬀ, 1980

work page 1980

[8] [7]

D. J. Higham and P. E. Kloeden. Maple and matlab for stocha stic diﬀerential equations in ﬁnance. In Programming Languages and Systems in Computational Economics and Finan ce, pages 233–269. Springer, 2002

work page 2002