Search arXivSearch

arXiv · 2607.29470

iSMART: An Iterative Sampling-and-Regression Technique for Solving Martingale-Based PDEs

Abstract

We propose the {\bf i}terative {\bf S}a{\bf M}pling-{\bf A}nd-{\bf R}egression {\bf T}echnique (iSMART) for high-dimensional martingale-based partial differential equations (PDEs) in this paper. By leveraging the $L^2$-projection property of conditional expectation and adopting the stop-gradient technique, iSMART reformulates the continuous martingale condition derived from PDEs into a sequence of tractable sampling-regression problems within an iterative framework. This approach relies solely on standard SDE path simulation and plain squared-error loss minimization, completely bypassing the need for adversarial optimization or nested expectation estimation in previous methods. iSMART accommodates linear, semi-linear, and fully nonlinear martingale-based PDEs within a unified iterative procedure. In particular, for fully nonlinear Hamilton-Jacobi-Bellman (HJB) equations, a freezing-and-compensating technique is introduced to strategically shift a portion of the nonlinearity into the SDE drift, thereby improving the convergence behavior of the iterations. Numerous numerical experiments on linear reaction-diffusion equations with sharp gradients, semilinear Burgers-type equations, and fully nonlinear HJB equations demonstrate the accuracy, efficiency, and robustness of the proposed approach in various high dimensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tiejun Li, Xiaoguang Li, Fugui Ma. 2026-07-31. iSMART: An Iterative Sampling-and-Regression Technique for Solving Martingale-Based PDEs. https://arxiv.org/abs/2607.29470

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Secant Method on Riemannian Manifolds

In this work, by using techniques and results of differential geometry, we propose a new numerical method on complete Riemannian manifolds to find zeros of vector fields. Our algorithm generalizes the classical secant method

math.NA

A Regularized Finite-Difference Approximation of Surface-restricted Emission and Reception Process in Acoustics with Application to Inverse Problems

The acoustic wave equation governs wave propagation induced by either volumetric radiation sources, or by surface sources of monopole or dipole type. For surface sources, boundary value problems yield wavefield representations via the Kirchhoff-Helmholtz or Rayleigh-Sommerfeld integrals. This study begins by examining the equivalence between the analytic expressions of the associated monopole and dipole integral formulations and their regularized approximations. Leveraging these regularized formulations, we introduce reception operators that map free space pressure wavefields--obtained by solving the wave equation--onto measured fields restricted to the boundary. Building on this trace mapping, we derive the adjoint of the forward operator. We show that, under the common practical assumption of Dirichlet-type boundary data, the adjoint operator coincides--up to a constant factor--with the time-reversed form of the dipole integral formula, evaluated on the receiver surfaces. This study aims to advance the numerical approximation of forward problems and the solution of inverse problems in acoustics, with a particular focus on applications that require accurate amplitude modeling, including attenuation reconstruction and photoacoustic tomography.

math.NA

Fast-Decaying Polynomial Reproduction

Polynomial reproduction plays a crucial role in deriving error estimates for various approximation schemes. In particular, local polynomial reproduction is a key ingredient in both error estimation and stability analysis. However, for certain computationally relevant methods, such as Rescaled Localized Radial Basis Functions (RL-RBF), this requirement constitutes a limitation. To enable the analysis of a broader class of approximation methods in a unified and efficient manner, the present work introduces a framework based on fast-decaying polynomial reproduction. In this approach, we do not restrict ourselves to compactly supported basis functions. Instead, we allow the basis functions to decay to zero at infinity, with the decay rate controlled as a function of the separation distance. The adoption of fast-decaying polynomial reproduction yields stable and convergent approximation schemes. These methods can achieve smoothness when used in conjunction with moving least squares. All theoretical results presented in this paper regarding the rate of convergence, the Lebesgue constant and the smoothness of the approximant have been numerically validated, including in the multivariate setting.

math.NA