aiqbench analysis
This paper introduces HA-RFM, a novel algorithm that adapts random feature methods to high-dimensional elliptic PDEs by leveraging Sobol indices and gradient analysis. The approach achieves polynomial scaling in dimension while significantly reducing approximation errors compared to standard full-dimensional techniques. By effectively identifying low-rank structures even up to 100 dimensions, this work advances the frontiers of scalable numerical solvers for complex physical systems.
A Structure-Adaptive Random Feature Method for High-Dimensional Elliptic PDEs
arXiv:2607.19786v1 Announce Type: cross Abstract: 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 $L^2$ 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.
Abstract: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 $L^2$ 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.
Numerical Analysis (math.NA); Machine Learning (cs.LG)
arXiv:2607.19786 [math.NA]
(or arXiv:2607.19786v1 [math.NA] for this version)
https://doi.org/10.48550/arXiv.2607.19786 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
HARFM_supplement.pdf
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 269 words
Related coverage

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

Evaluating task vectors, unlearning and inoculation
LessWrong · Sep 20, 2026

AI and Quantum Computing Briefing
livetradingnews.com · Aug 4, 2026