Walk-on-Interfaces: A Monte Carlo Estimator for an Elliptic Interface Problem with Nonhomogeneous Flux Jump Conditions and a Neumann Boundary Condition
Xinwen Ding, Adam R Stinchcombe

TL;DR
This paper introduces Walk-on-Interfaces, a Monte Carlo method for solving elliptic interface problems with nonhomogeneous flux jumps and Neumann boundary conditions, providing accurate, parallelizable solutions applicable in high dimensions.
Contribution
The paper presents a novel grid-free Monte Carlo estimator for elliptic interface problems with flux jumps, including variance reduction and gradient estimation, applicable in high-dimensional, irregular geometries.
Findings
Estimator maintains accuracy near interfaces.
Method is highly parallelizable with O(1/√W) convergence.
Successfully applied to high-dimensional problems up to six dimensions.
Abstract
Elliptic interface problems arise in numerous scientific and engineering applications, modeling heterogeneous materials in which physical properties change discontinuously across interfaces. In this paper, we present \textit{Walk-on-Interfaces} (WoI), a grid-free Monte Carlo estimator for a class of Neumann elliptic interface problems with nonhomogeneous flux jump conditions. Our Monte Carlo estimators maintain consistent accuracy throughout the domain and, thus, do not suffer from the well-known close-to-source evaluation issue near the interfaces. We also presented a simple modification with reduced variance. Estimation of the gradient of the solution can be performed, with almost no additional cost, by simply computing the gradient of the Green's function in WoI. Taking a scientific machine learning approach, we use our estimators to provide training data for a deep neural network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
