Adaptive Importance Sampling for Deep Ritz
Document Type
Article
Publication Date
6-1-2025
Abstract
We introduce an adaptive sampling method for the Deep Ritz method aimed at solving partial differential equations (PDEs). Two deep neural networks are used. One network is employed to approximate the solution of PDEs, while the other one is a deep generative model used to generate new collocation points to refine the training set. The adaptive sampling procedure consists of two main steps. The first step is solving the PDEs using the Deep Ritz method by minimizing an associated variational loss discretized by the collocation points in the training set. The second step involves generating a new training set, which is then used in subsequent computations to further improve the accuracy of the current approximate solution. We treat the integrand in the variational loss as an unnormalized probability density function (PDF) and approximate it using a deep generative model called bounded KRnet. The new samples and their associated PDF values are obtained from the bounded KRnet. With these new samples and their associated PDF values, the variational loss can be approximated more accurately by importance sampling. Compared to the original Deep Ritz method, the proposed adaptive method improves the accuracy, especially for problems characterized by low regularity and high dimensionality. We demonstrate the effectiveness of our new method through a series of numerical experiments.
Publication Source (Journal or Book title)
Communications on Applied Mathematics and Computation
First Page
929
Last Page
953
Recommended Citation
Wan, X., Zhou, T., & Zhou, Y. (2025). Adaptive Importance Sampling for Deep Ritz. Communications on Applied Mathematics and Computation, 7 (3), 929-953. https://doi.org/10.1007/s42967-024-00422-w