Pith. sign in

REVIEW 4 major objections 3 minor 26 references

Central limit theorem of Multilevel Monte Carlo Euler estimators for Stochastic Volterra equations with fractional kernels

T0 review · 4 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read For stochastic Volterra equations with fractional kernels, the multilevel Monte Carlo Euler estimator satisfies a central limit theorem whose limiting variance is identified explicitly and whose two-level error converges stably in law.

desk verdict Genuinely new two-level error CLT for Volterra Euler schemes, but the MLMC CLT leans on an unproved and likely false bias-rate assumption. read the letter →

arxiv 2506.03421 v1 pith:BIL4ZLWB submitted 2025-06-03 math.PR

Shanqi Liu , Yaozhong Hu , Hongjun Gao This is my paper
classification math.PR MSC 60F0560H2062F1265C05
keywords StochasticVolterraintegralequationsMultilevelMonteCarlofractionalkernelsstableconvergencecentrallimittheoremEuler-MaruyamaschemeLindeberg-Fellercondition
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

Stochastic Volterra equations with fractional kernels K(u)=$u^{{H-1/2}}$/\Gamma(H+1/2), H\in(0,1/2], are used when a model needs memory or rough volatility, but their solutions are rarely explicit, so simulation relies on Euler schemes and multilevel Monte Carlo (MLMC). This paper proves that the normalized two-level Euler error n^H($X^{{mn}}$-X^n) converges stably in law to a linear stochastic Volterra equation with an explicit volatility constant, and that the MLMC estimator obeys a Lindeberg-Feller central limit theorem. If the theorems are correct, the heuristic practice of using MLMC variance formulas for such equations becomes a theorem, and the limiting distribution supplies the error constant needed for sample-size allocation and confidence intervals.

What carries the argument

The carrying object is the two-level error process $U^{{mn,n}}$=n^H($X^{{mn}}$-X^n), built from Euler schemes with step sizes 1/(mn) and 1/n on the same Brownian path. The proof expands the coefficient differences by Taylor's formula, isolates a vanishing drift term from a martingale term, and computes the $L^{2}$ limit of the quadratic variation of the associated stochastic integrals. The fractional-kernel calculus is the mechanism that turns discrete kernel increments into the constant g^H_m=\sum_{j=0}^{m-1}$j^{{2H}}$/$m^{{2H+1}}$ and the identity 2H\int_0^\infty|\mu(r,1)|^2 dr+1=G\,\Gamma(2H)\sin\pi H, with G=\Gamma(H+1/2)^2, yielding the explicit limiting volatility.

What would settle it

For the linear SVE with b=0, \$\sigma$=1 and H<1/2, the solution is X_t=\int_0^t K(t-s)dW_s, a Gaussian process whose covariance is known; compute \epsilon_n=E f(X^n_T)-E f(X_T) exactly or by very accurate simulation for f(x)=x and increasing n. If |\epsilon_n| decays like $n^{{-H}}$ rather than $n^{{-\alpha}}$ for some \$\alpha$\ge 1/2, then the bias-rate assumption (H\epsilon n) fails and the mean-shift term of Theorem 3.4 is not supported.

Watch

Extended reading notes

Core claim

The paper's central claims are two. Theorem 2.1: for H\in(0,1/2], fixed integer m\ge 2, and \epsilon\in(0,H), the process $U^{{mn,n}}$_t=n^H($X^{{mn}}$_t-X^n_t) converges stably in law in $C^{{H-\epsilon}}$_0 to the unique solution U of the linear stochastic Volterra equation (2.10), driven by the original Brownian motion W and an independent Brownian motion B, with diffusion coefficient \sqrt{g^H_m/(\Gamma(2H+1)\sin\pi H)}, where g^H_m=\sum_{j=0}^{m-1}$j^{{2H}}$/$m^{{2H+1}}$. Theorem 3.4: if f satisfies the stated growth and differentiability condition, P(X_T\notin D_f)=0, and the Euler bias obeys n^\$\alpha$(E f(X^n_T)-E f(X_T))\to C_f(T,\$\alpha$) for some \$\alpha$\in[1/2,1], then with independent samples and sample sizes N_l=$n^{{2\alpha}}$$m^{{-2H(l-1)}}$a_l/\sum a_l, n^\$\alpha$(Q_n-E f(X_T))\Rightarrow N(C_f(T,\$\alpha$),\$sigma^{2}$), where \$sigma^{2}$ is the variance of \nabla f(X_T)\cdot U_T.

Load-bearing premise

The MLMC central limit theorem assumes that the bias of the Euler estimator decays no slower than the square root of the step size; the paper does not prove this for singular kernels, and its own error bound gives only the slower decay rate $n^{{-H}}$, so the mean-shift constant in the limit is conditional on that unproved rate.

Editorial extensions

If this is right

  • For H=1/2, Theorem 2.1 reproduces the known MLMC Euler central limit theorem for classical Itô SDEs, and letting m tend to infinity recovers the single-level Euler error central limit theorems of Jacod-Protter and Fukasawa-Ugai.
  • The normalized two-level error converges stably in law, so the limiting process is defined on an extension of the original probability space and is conditionally Gaussian given the driving Brownian path.
  • The MLMC variance satisfies Var(Q_n)=O(\sum_{\ell=0}^L N_\ell^{-1} m^{-2H\ell}), giving a quantitative guide for choosing sample sizes per level.
  • Under the bias-rate assumption (H\epsilon n), the central limit theorem provides the asymptotic normal distribution with explicit mean shift C_f(T,\alpha) and variance \sigma^2, so confidence intervals for E f(X_T) can be constructed.

Reading between the lines

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

  • The paper leaves open whether the bias-rate assumption (H\epsilon n) actually holds for H<1/2; since the known Euler error bound is only n^{-H}, the mean-shift term C_f(T,\alpha) is conditional and deserves a separate proof or disproof.
  • The explicit dependence of the limiting variance on g^H_m suggests that the level ratio m in the MLMC scheme can be optimized, and for small H the geometric decay m^{-2H\ell} may change the optimal choice of m compared with the Brownian case.
  • Stable convergence with an independent Brownian motion B appearing in the limit hints that the multilevel error is asymptotically uncorrelated with the increments of W, which could be exploited for control variates or for constructing a Richardson-type extrapolation of the error.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 3 minor

Summary. The paper proves two limit theorems for the Euler discretization of the stochastic Volterra equation (1.1) with fractional kernel K(u)=u^{H-1/2}/Gamma(H+1/2). Theorem 2.1 states that the normalized two-level error U^{mn,n}=n^H(X^{mn}-X^n) converges stably in law in C_0^{H-epsilon} to the unique solution of a linear SVE driven by the original Brownian motion W and an independent Brownian motion B, with explicit volatility constant sqrt(g_m^H/(Gamma(2H+1)sin(pi H))). Theorem 3.4 states that, under the bias-rate assumption (Hεn), the multilevel Monte Carlo estimator Q_n satisfies n^alpha(Q_n-E f(X_T)) => N(C_f(T,alpha), sigma^2) with sigma^2 = Var-tilde(grad f(X_T) . U_T), for the sample sizes N_l specified in (3.16). The proof strategy is to expand the two-level error into low-order and martingale parts, compute all quadratic-variation limits in Section 4 and Appendices B-C, and then apply a Lindeberg-Feller argument to the MLMC decomposition.

Significance. If completed, Theorem 2.1 would be a valuable extension of the MLMC error CLT of Ben Alaya and Kebaier to singular Volterra kernels, and it would recover the Fukasawa-Ugai limit in the formal limit m -> infinity. The variance constants are derived analytically from the kernel and discretization rather than fitted, and the reduction to the classical H=1/2 case is a useful internal check. However, the paper is not yet in publishable form: the proof of Theorem 2.1 omits several load-bearing lemmas, and the proof of Theorem 3.4 has inconsistencies in the sample-size formulas and relies on an unproved, possibly false bias-rate assumption.

major comments (4)
  1. [§3, Eq. (3.16) and proof of Theorem 3.4] With the displayed choice N_l = n^{2alpha} m^{2(l-1)H} a_l / sum_{j=1}^L a_j, the level-0 term is not negligible. For l=0 this gives N_0 = n^{2alpha} m^{-2H} a_0 / A_L with A_L = sum_{j=1}^L a_j, so Var(n^alpha hat Q^1_n) = n^{2alpha} Var(f(X^1_T)) / N_0 = (A_L/a_0) m^{2H} Var(f(X^1_T)), which diverges. Hence the assertion n^alpha hat Q^1_n -> 0 in probability is false for the prescribed N_l. The separate formula for N_0 used in the proof is not the one in (3.16), and the deterministic bias epsilon_n cannot cancel the independent sample average hat Q^1_n. The statement must either choose N_0 with N_0 >> n^{2alpha} and redo the cost analysis, or include the level-0 variance in the asymptotic variance.
  2. [§3, assumption (Hεn)] The bias-rate assumption (Hεn) is load-bearing but is asserted rather than proved for singular kernels. In the scalar model b=0, sigma(x)=x, X_0=1, f(x)=x^2, the second-moment equations give m(t)=1+int_0^t K(s)^2 m(s)ds and m^n(t)=1+int_0^t K(s)^2 m^n([ns]/n)ds. The grid-cell error m^n(s)-m^n([ns]/n) is O(n^{-2H}), so epsilon_n = E f(X^n_T)-E f(X_T) is O(n^{-2H}). For H<1/4 this forces n^{1/2} epsilon_n -> infinity, so no alpha in [1/2,1] can satisfy (Hεn). Thus Theorem 3.4, as stated for all H in (0,1/2], has no content for part of its announced parameter range. The authors need to prove or cite a valid bias expansion for the relevant H-range, or restate Theorem 3.4 with an explicit rate restriction.
  3. [§2, Lemmas 2.4–2.8] The proof of Theorem 2.1 depends on Lemmas 2.4–2.8 for the convergence of the drift discretization remainders, tightness in C_0^{H-epsilon}, characterization of the limit, and strong uniqueness of the limiting equation. The manuscript states that these lemmas are analogous to those in [9] and omits their proofs. These steps are not routine consequences of the computations in Section 4, and the error process here is X^{mn}-X^n rather than X^n-X, so the cited arguments in [9] do not transfer verbatim. The proof of Theorem 2.1 is therefore incomplete as it stands.
  4. [§3, Lyapunov condition in Theorem 3.4] In the verification of the Lyapunov condition, the bound E|Z^{m^l,m^{l-1}}_{T,1}|^p <= K_p m^{-pl/2} is not the rate obtainable from Lemma A.6, which gives m^{-pHl} for H<1/2, and the displayed inequality sum_l n^p N_l^{-p/2} m^{-pl/2} <= tilde C_p (sum_l a_l)^{-p/2} sum_l a_l^{p/2} does not follow algebraically from (3.16). Since this is the step that establishes the Lindeberg condition, the proof of Theorem 3.4 needs a corrected calculation.
minor comments (3)
  1. [Lemma 2.1(iii)] In the final displayed limit of Lemma 2.1(iii), the factor n^{4H} appears in front of the integral; the definition of the quadratic variation and all preceding displays require n^{2H}.
  2. [Theorem 3.4] The condition P(X_T /nelement D_f)=0 should read P(X_T notin D_f)=0.
  3. [Appendix C.1] In Lemmas C.3 and C.5, 'cconverges' is a typo for 'converges'; additionally, in Lemma C.2 the process that is almost surely continuous should be H^{(m)}, not H.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the two-level error limit and its variance are derived analytically, and the MLMC CLT mean is an explicit assumption rather than a hidden fitted or self-referential input.

full rationale

The claimed derivation chain is self-contained. Theorem 2.1's limiting process (2.10) is obtained by normalizing U^{mn,n}=n^H(X^{mn}-X^n), Taylor-expanding the one-step Euler error, and computing quadratic variations directly. The volatility constant sqrt(g^H_m/(Gamma(2H+1) sin pi H)) is produced by Lemma 2.1(iii) from fractional-kernel integrals and the identity 2H int |mu(r,1)|^2 dr + 1 = G Gamma(2H) sin pi H, not fitted to data. The independent Brownian motion B arises through stable convergence and Jacod's conditional Gaussian martingale representation, an external standard result, not a self-citation. For Theorem 3.4, the paper explicitly assumes (Hepsilon_n): lim n^alpha epsilon_n = C_f(T,alpha) with epsilon_n = E f(X^n_T) - E f(X_T). The proof writes Q_n - E f(X_T) = Qhat1 + Qhat2 + epsilon_n and then 'obviously' obtains C_f(T,alpha) in the limit; thus the mean of the limiting normal law is an input assumption, not a derived prediction. This is an explicit limitation (and, for some H values, a correctness risk), but it is not a hidden circularity: the theorem is conditional on that rate. The omitted Lemmas 2.4-2.8, referenced as analogous to Fukasawa-Ugai [9], are a proof gap; the underlying lemmas are external and do not make the variance result equivalent to its inputs. The self-citation [21] supplies auxiliary kernel estimates and is explicitly said to be inapplicable to the main theorem, so it is not load-bearing. No fitted parameter is renamed as a prediction, and no uniqueness claim is imported from the authors' own prior work.

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

No constants are fitted to data; g_H^m and the variance factor are derived analytically. No ad hoc physical entities are introduced; the independent Brownian motion B in (2.10) is a standard stable-limit object from Jacod's martingale representation.

assumptions (4)
  • domain assumption The coefficients b and σ are differentiable with bounded derivatives, a strengthening of the Lipschitz Assumption 1.
    Used throughout for Taylor expansions, moment bounds (Lemmas A.2, A.4) and remainder control in Lemma 2.5.
  • standard math The SVE (1.1) with kernel K has a unique strong solution with Hölder-continuous paths of order < H, as established in [1] and [18].
    Invoked in the limit characterization and tightness argument in the proof of Theorem 2.1.
  • standard math Known fractional-kernel identities, notably 2H∫_0^∞ |μ(r,1)|^2 dr + 1 = G Γ(2H) sin πH from Mishura [23].
    Used in Lemma 2.1(iii) to simplify the limiting quadratic variation to g_H^m/(Γ(2H+1) sin πH).
  • ad hoc to paper The bias-rate assumption (Hεn): lim n^α ε_n = C_f(T,α) for some α∈[1/2,1].
    Assumed in Theorem 3.4; not derived for singular kernels. For H<1/2 the known Euler rate n^{-H} is slower than n^{-α} for α≥1/2, so the assumption may fail in part of the stated range.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Central limit theorem of Multilevel Monte Carlo Euler estimators for Stochastic Volterra equations with fractional kernels." pith.science (2026). https://pith.science/paper/BIL4ZLWB

@misc{pith2026250603421,
  author       = {Pith},
  title        = {Pith review of: Central limit theorem of Multilevel Monte Carlo Euler estimators for Stochastic Volterra equations with fractional kernels},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BIL4ZLWB}},
  note         = {Machine review of arXiv:2506.03421}
}
abstract

This paper is devoted to proving a (Lindeberg-Feller type ) central limit theorem for the multilevel Monte Carlo estimator associated with the Euler discretization scheme for the stochastic Volterra equations with fractional kernels $K(u)=u^{H-\frac{1}{2}}/\Gamma(H+1/2), H\in (0,1/2]$.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [9]

    Fukasawa and T

    M. Fukasawa and T. Ugai, Limit distributions for the discretization error of stocha stic Volterra equations with fractional kernel , Ann. Appl. Probab. 33 (2023), no. 6B, 5071–5110

    work page 2023

  2. [1]

    Abi Jaber, M

    E. Abi Jaber, M. Larsson, and S. Pulido, Affine Volterra processes , Ann. Appl. Probab. 29 (2019), no. 5, 3155– 3200

    work page 2019

  3. [2]

    Daniel Bartl, Conditional nonlinear expectations , Stochastic Process. Appl. 130 (2020), no. 2, 785–805

    work page 2020

  4. [3]

    Ben Alaya, M

    Kebaier A. Ben Alaya, M. and T. T. Ngo, Central limit theorem for the antithetic multilevel Monte C arlo method, Ann. Appl. Probab. 32 (2022), no. 3, 1970–2027

    work page 2022

  5. [4]

    Mohamed Ben Alaya and Ahmed Kebaier, Central limit theorem for the multilevel Monte Carlo Euler m ethod, Ann. Appl. Probab. 25 (2015), no. 1, 211–234

    work page 2015

  6. [5]

    Billingsley, Convergence of probability measures , John Wiley & Sons, Inc., New York-London-Sydney, 1968

    P. Billingsley, Convergence of probability measures , John Wiley & Sons, Inc., New York-London-Sydney, 1968

    work page 1968

  7. [6]

    Dereich and S

    S. Dereich and S. Li, Multilevel Monte Carlo for Lévy-driven SDEs: central limit theorems for adaptive Euler schemes, Ann. Appl. Probab. 26 (2016), no. 1, 136–185. 52 S. LIU, Y. HU, AND H. GAO

    work page 2016

  8. [7]

    A. Deya, A. Neuenkirch, and S. Tindel, A Milstein-type scheme without Lévy area terms for SDEs driv en by fractional Brownian motion , Ann. Inst. Henri Poincaré Probab. Stat. 48 (2012), no. 2, 518–550

    work page 2012

Show all 26 references
  1. [8]

    Friz and S

    P. Friz and S. Riedel, Convergence rates for the full Gaussian rough paths , Ann. Inst. Henri Poincaré Probab. Stat. 50 (2014), no. 1, 154–194

    2014

  2. [10]

    M. B. Giles, Multilevel Monte Carlo path simulation , Oper. Res. 56 (2008), no. 3, 607–617

    2008

  3. [11]

    Giorgi, D

    Lemaire V. Giorgi, D. and G. Pagès, Limit theorems for weighted and regular multilevel estimat ors, Monte Carlo Methods Appl. 23 (2017), no. 1, 43–70

    2017

  4. [12]

    Hoel and S

    H. Hoel and S. Krumscheid, Central limit theorems for multilevel Monte Carlo methods , J. Complexity 54 (2019), 101407, 16

    2019

  5. [13]

    Y. Hu, Y. Liu, and D. Nualart, Rate of convergence and asymptotic error distribution of Eu ler approximation schemes for fractional diffusions , Ann. Appl. Probab. 26 (2016), no. 2, 1147–1207

    2016

  6. [14]

    , Taylor schemes for rough differential equations and fractio nal diffusions , Discrete Contin. Dyn. Syst. Ser. B 21 (2016), no. 9, 3115–3162

    2016

  7. [15]

    Jacod, On continuous conditional Gaussian martingales and stable convergence in law , Séminaire de Probabil- ités, XXXI, Lecture Notes in Math., vol

    J. Jacod, On continuous conditional Gaussian martingales and stable convergence in law , Séminaire de Probabil- ités, XXXI, Lecture Notes in Math., vol. 1655, Springer, Ber lin, 1997, pp. 232–246

    1997

  8. [16]

    Jacod and P

    J. Jacod and P. Protter, Asymptotic error distributions for the Euler method for sto chastic differential equations , Ann. Probab. 26 (1998), no. 1, 267–307

    1998

  9. [17]

    Kebaier and J

    A. Kebaier and J. Lelong, Coupling importance sampling and multilevel Monte Carlo us ing sample average ap- proximation, Methodol. Comput. Appl. Probab. 20 (2018), no. 2, 611–641

    2018

  10. [18]

    A. A. Kilbas, H. M. Srivastava, and J. J. Trujillo, Theory and applications of fractional differential equatio ns, North-Holland Mathematics Studies, vol. 204, Elsevier Sci ence B.V., Amsterdam, 2006

    2006

  11. [19]

    T. G. Kurtz and P. Protter, Wong-Zakai corrections, random evolutions, and simulatio n schemes for SDEs , Stochastic analysis, Academic Press, Boston, MA, 1991, pp. 331–346

    1991

  12. [20]

    M. Li, C. Huang, and Y. Hu, Numerical methods for stochastic Volterra integral equati ons with weakly singular kernels, IMA J. Numer. Anal. 42 (2022), no. 3, 2656–2683

    2022

  13. [21]

    S. Liu, Y. Hu, and H. Gao, Limit error distributions of milstein scheme for stochasti c volterra equations with singular kernels , arXiv preprint arXiv:2412.11126 (2024)

    2024 arXiv

  14. [22]

    Liu and S

    Y. Liu and S. Tindel, First-order Euler scheme for SDEs driven by fractional Brow nian motions: the rough case , Ann. Appl. Probab. 29 (2019), no. 2, 758–826

    2019

  15. [23]

    Y. S. Mishura, Stochastic calculus for fractional Brownian motion and rel ated processes, Lecture Notes in Math- ematics, vol. 1929, Springer-Verlag, Berlin, 2008

    1929

  16. [24]

    Nualart and B

    D. Nualart and B. Saikia, Error distribution of the Euler approximation scheme for st ochastic Volterra equations, J. Theoret. Probab. 36 (2023), no. 3, 1829–1876

    2023

  17. [25]

    Richard, X

    A. Richard, X. Tan, and F. Yang, Discrete-time simulation of stochastic Volterra equation s, Stochastic Process. Appl. 141 (2021), 109–138

    2021

  18. [26]

    Zhang, Euler schemes and large deviations for stochastic Volterra equations with singular kernels , J

    X. Zhang, Euler schemes and large deviations for stochastic Volterra equations with singular kernels , J. Differential Equations 244 (2008), no. 9, 2226–2250. School of Mathematical Science, Nanjing Normal University, N anjing 210023, China Email address : shanqiliumath@126.com...

    2008

Pith tools

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