Pith. sign in

REVIEW 1 cited by

Multilevel Importance Sampling for Rare Events Associated With the McKean--Vlasov Equation

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 2208.03225 v4 pith:CYY2QFWA submitted 2022-08-05 math.NA cs.NAstat.CO

classification math.NAcs.NAstat.CO
keywords dlmcestimatormultilevelmathrmimportancesamplingcomplexityestimate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

This work combines multilevel Monte Carlo (MLMC) with importance sampling to estimate rare-event quantities that can be expressed as the expectation of a Lipschitz observable of the solution to a broad class of McKean--Vlasov stochastic differential equations. We extend the double loop Monte Carlo (DLMC) estimator introduced in this context in (Ben Rached et al., 2023) to the multilevel setting. We formulate a novel multilevel DLMC estimator and perform a comprehensive cost-error analysis yielding new and improved complexity results. Crucially, we devise an antithetic sampler to estimate level differences guaranteeing reduced computational complexity for the multilevel DLMC estimator compared with the single-level DLMC estimator. To address rare events, we apply the importance sampling scheme, obtained via stochastic optimal control in (Ben Rached et al., 2023), over all levels of the multilevel DLMC estimator. Combining importance sampling and multilevel DLMC reduces computational complexity by one order and drastically reduces the associated constant compared to the single-level DLMC estimator without importance sampling. We illustrate the effectiveness of the proposed multilevel DLMC estimator on the Kuramoto model from statistical physics with Lipschitz observables, confirming the reduced complexity from $\mathcal{O}(\mathrm{TOL}_{\mathrm{r}}^{-4})$ for the single-level DLMC estimator to $\mathcal{O}(\mathrm{TOL}_{\mathrm{r}}^{-3})$ while providing a feasible estimate of rare-event quantities up to prescribed relative error tolerance $\mathrm{TOL}_{\mathrm{r}}$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Solving McKean-Vlasov Equation by deep learning particle method

    math.NA 2025-01 reject novelty 6.0 of 10

    A deep learning particle method is proposed that represents McKean-Vlasov SDE solutions as neural functions of Brownian motion and minimizes coefficient residuals, but representation is not proved to be expressive enough.

Pith tools