A Structure-Adaptive Random Feature Method for High-Dimensional Elliptic PDEs
Not on the map. Why?
Abstract (arXiv)
Random-feature methods reduce high-dimensional elliptic PDE collocation to linear coefficient problems, but full-dimensional trial spaces overlook lower-dimensional structure. We introduce the Hierarchical Analysis-of-Variance Random Feature Method (HA-RFM), which selects coordinate blocks using closed Sobol indices of the PDE residual, identifies oblique low-rank features from fitted-predictor gradients, and couples all retained features in one regularized least-squares solve. Under structural and stability hypotheses, we establish an L2 error bound that links solution and residual truncation to finite-width approximation and regularized finite-sample fitting, and we derive guarantees for width and structure recovery. The resulting width is polynomial in the dimension at fixed interaction order, with dimension-independent higher-order contributions under uniform structural control. Residual screening achieves exact recovery of the prescribed three-pair support, while fitted-predictor gradients recover oblique directions through dimension 50. In random-ridge tests, less than 1% additional width reduces errors by factors of 14-39 over coordinate blocks and 34-100 over equal-width full-dimensional RFM. Semilinear computations extend HA-RFM through dimension 100, while dense and distributed interactions delineate the coordinate families required for broader structure.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 36 references that are in the map. First posted on arXiv 22 Jul 2026.
Builds on
9 of 36 references.
References · 9
- 2020When and why PINNs fail to train: A neural tangent kernel perspectivecited by 629
- 2017The Deep Ritz method: A deep learning-based numerical algorithm for solving variational problemscited by 581
- 2017Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equationscited by 188
- 2016Generalization Properties of Learning with Random Featurescited by 163
- 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
- 2018A Priori Estimates of the Population Risk for Two-layer Neural Networkscited by 76
- 2019Adaptive Deep Learning for High-Dimensional Hamilton-Jacobi-Bellman Equationscited by 40
- 2016Algorithms for Overcoming the Curse of Dimensionality for Certain Hamilton-Jacobi Equations Arising in Control Theory and Elsewherecited by 21
- 2023An Extreme Learning Machine-Based Method for Computational PDEs in Higher Dimensionscited by 21
Built on by
Citing papers per year: 2026: 1.
1 paper.