Hierarchical importance sampling for estimating occupation time for SDE solutions

Abstract This study considers the estimation of the complementary cumulative distribution function of the occupation time (i.e., the time spent below a threshold) for a process governed by a stochastic differential equation. The focus is on the right tail, where the underlying event becomes rare, and using variance reduction techniques is essential to obtain computationally efficient estimates. Building on recent developments that relate importance sampling (IS) to stochastic optimal control, this work develops an optimal single-level IS (SLIS) estimator based on the solution of an auxiliary Hamilton–Jacobi–Bellman (HJB) partial differential equation (PDE). The cost of solving the HJB-PDE is incorporated into the total computational work, and an optimized trade-off between preprocessing and sampling is proposed to minimize the overall cost. The SLIS approach is extended to the multilevel setting to enhance efficiency, yielding a multilevel IS (MLIS) estimator. Motivated by the zero-variance property of the ideal full-state continuous-time control, we study regimes in which the single-level variance decreases with refinement; this decay is assessed numerically for the implemented approximate control. This observation leads to the formulation of a necessary condition and a sufficient condition under which MLIS outperforms SLIS. To promote satisfaction of the sufficient condition, we introduce a smoothing of both the drift and the observable to enhance the variance decay rate, together with a novel common-likelihood MLIS formulation that is observed numerically to preserve this decay under IS. The classical multilevel Monte Carlo complexity theory can be extended to accommodate settings in which the variance on coarse levels depends on the target accuracy, a phenomenon for which the variance-decay behavior in the IS setting is a key example. Notably, the sampling work complexity of MLIS can be better than quadratic. Numerical experiments on fade-duration estimation demonstrate the effectiveness of the proposed approach and validate the theoretical analysis. In particular, the smoothing bias is estimated to be negligible relative to the prescribed tolerances, while the common-likelihood MLIS estimator achieves a substantial reduction in computational cost compared with SLIS.

Authors

Institutions

Publication Details

Journal
Statistics and Computing
Published
2026-11-14
DOI
https://doi.org/10.1007/s11222-026-10995-6
Citations
1
Primary Topic
Stochastic processes and financial applications
Type
article
Field-Weighted Citation Impact
3.61

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Hierarchical importance sampling for estimating occupation time for SDE solutions

Raul F. Tempone, Nadhir Ben Rached, Eya Ben Amar
1 citations
Statistics and Computing
Stochastic processes and financial applications
3.61
article

Hierarchical importance sampling for estimating occupation time for SDE solutions

Raul F. Tempone, Nadhir Ben Rached, Eya Ben Amar
article en
1 citations

Abstract

Abstract This study considers the estimation of the complementary cumulative distribution function of the occupation time (i.e., the time spent below a threshold) for a process governed by a stochastic differential equation. The focus is on the right tail, where the underlying event becomes rare, and using variance reduction techniques is essential to obtain computationally efficient estimates. Building on recent developments that relate importance sampling (IS) to stochastic optimal control, this work develops an optimal single-level IS (SLIS) estimator based on the solution of an auxiliary Hamilton–Jacobi–Bellman (HJB) partial differential equation (PDE). The cost of solving the HJB-PDE is incorporated into the total computational work, and an optimized trade-off between preprocessing and sampling is proposed to minimize the overall cost. The SLIS approach is extended to the multilevel setting to enhance efficiency, yielding a multilevel IS (MLIS) estimator. Motivated by the zero-variance property of the ideal full-state continuous-time control, we study regimes in which the single-level variance decreases with refinement; this decay is assessed numerically for the implemented approximate control. This observation leads to the formulation of a necessary condition and a sufficient condition under which MLIS outperforms SLIS. To promote satisfaction of the sufficient condition, we introduce a smoothing of both the drift and the observable to enhance the variance decay rate, together with a novel common-likelihood MLIS formulation that is observed numerically to preserve this decay under IS. The classical multilevel Monte Carlo complexity theory can be extended to accommodate settings in which the variance on coarse levels depends on the target accuracy, a phenomenon for which the variance-decay behavior in the IS setting is a key example. Notably, the sampling work complexity of MLIS can be better than quadratic. Numerical experiments on fade-duration estimation demonstrate the effectiveness of the proposed approach and validate the theoretical analysis. In particular, the smoothing bias is estimated to be negligible relative to the prescribed tolerances, while the common-likelihood MLIS estimator achieves a substantial reduction in computational cost compared with SLIS.

Statistics and ComputingVol. 36(6)
University of Leeds (GB), King Abdullah University of Science and Technology (SA), RWTH Aachen University (DE)
Alexander von Humboldt-Stiftung, King Abdullah University of Science and Technology
Openalex Percentile: Top 13%
Stochastic processes and financial applications
3.61
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon