Learning Geometric-Aware Quadrature Rules for Functional Minimization
Not on the map. Why?
Abstract (arXiv)
Accurate numerical integration over non-uniform point clouds is a challenge for modern mesh-free machine learning solvers for partial differential equations (PDEs) using variational principles. While standard Monte Carlo (MC) methods are not capable of handling a non-uniform point cloud, modern neural network architectures can deal with permutation-invariant inputs, creating quadrature rules for any point cloud. In this work, we introduce QuadrANN, a Graph Neural Network (GNN) architecture designed to learn optimal quadrature weights directly from the underlying geometry of point clouds. The design of the model exploits a deep message-passing scheme where the initial layer encodes rich local geometric features from absolute and relative positions as well as an explicit local density measure. In contrast, the following layers incorporate a global context vector. These architectural choices allow the QuadrANN to generate a data-driven quadrature rule that is permutation-invariant and adaptive to both local point density and the overall domain shape. We test our methodology on a series of challenging test cases, including integration on convex and non-convex domains and estimating the solution of the Heat and Fokker-Planck equations. Across all the tests, QuadrANN reduces the variance of the integral estimation compared to standard Quasi-Monte Carlo methods by warping the point clouds to be more dense in critical areas where the integrands present certain singularities. This enhanced stability in critical areas of the domain at hand is critical for the optimization of energy functionals, leading to improved deep learning-based variational solvers.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 39 references that are in the map. First posted on arXiv 7 Aug 2025.
Builds on
16 of 39 references.
References · 16
- 2017Attention Is All You Needcited by 60,361
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2017DGM: A deep learning algorithm for solving partial differential equationscited by 678
- 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 583
- 2019Kernel quadrature with DPPscited by 27
- 2019A Modern Retrospective on Probabilistic Numericscited by 18
4 more
- 2023Transporting Higher-Order Quadrature Rules: Quasi-Monte Carlo Points and Sparse Grids for Mixture Distributionscited by 6
- 2024A deep implicit-explicit minimizing movement method for option pricing in jump-diffusion modelscited by 5
- 2024Improving Efficiency of Sampling-based Motion Planning via Message-Passing Monte Carlocited by 5
- 2025Low Stein Discrepancy via Message-Passing Monte Carlocited by 2
Built on by
Not cited yet.