arXiv Machine Learning

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.

arXiv Machine Learning
Oct 16

Adaptive Randomized Neural Networks for PDEs: Structure-Aware Feature Redistribution and Residual-Driven Block Enrichment

The paper introduces SFRBE–RaNN, a two‑stage adaptive randomized neural network framework for solving partial differential equations. It first redistributes a fixed feature budget based on regional indicator masses and optimizes regional weight scales using low‑dimensional residuals, then enriches the trial space by selecting nonredundant activation families through residual verification. The authors provide theoretical guarantees for linear problems, including a discrete residual‑reduction identity, error bounds, and a probabilistic success bound, and validate the approach with numerical experiments on localized, multiscale, and nonlinear space–time PDEs.

By You Yang, Fei Wang
arXiv Machine Learning
Aug 27

Loop Corrections in Random Feature Models: Training Error and Generalization Gap

The paper investigates fixed‑design random feature ridge regression beyond the mean‑kernel approximation, focusing on how the predictor’s nonlinear dependence on the empirical kernel affects training error, test error, and the conditional generalization gap. By deriving covariance‑level (one‑loop) corrections via a finite resolvent identity, the authors avoid an almost‑sure Neumann‑series assumption and provide explicit remainder bounds for training error. Numerical experiments demonstrate that including mixed train–test covariance tensors is essential for accurate test error predictions and reveal a width–regularization boundary where second‑order truncation becomes unreliable.

By Taeyoung Kim
arXiv Machine Learning
Jun 29

Mosaic: A Benchmark Suite for Differentiable Physics Solvers

arXiv:2606. 27895v1 Announce Type: cross Abstract: Differentiable partial differential equation (PDE) solvers underpin solver-in-the-loop ML training, gradient-based optimal control, and inverse problems, yet the practical cost of obtaining correct, usable gradients from a given solver on a given problem is largely undocumented.

By Andrin Rehmann, Heiko Zimmermann, Dion H\"afner