CORTEXA
← Browse
arxivmath.NAcs.LG2026-07-22

A Structure-Adaptive Random Feature Method for High-Dimensional Elliptic PDEs

Jiale Linghu, Hao Dong, Yangshuai Wang

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.

View free PDFSource page

Related papers

arxivmath.NAcs.AIcs.CEcs.LG2026-07-15

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs

Tianchi Yu, Ivan Oseledets

For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy. For middle-dimensional problems ($4 \leq d \lesssim 10$), spectral methods remain feasible through specific techniques such as sparse grids or hyperbolic cross. However, for high-di…

View free PDFSource page
arxivcs.LGmath.NA2026-07-31

Freeze, Then Select: Structured Field Adapters and Stability-Validated Weak Selection for PDE Discovery from Sparse Observations

Juncheng Zhong, Chenghuang Shen, Jianfeng Liu, Zhengdong Xiao, Longjiu Luo, Qianrong Wang, et al.

PDE discovery from sparse observations requires reconstructing a continuous field and selecting the correct differential terms. Our analysis of optimization paths in coupled neural PDE discovery reveals three behaviors: the exact support can persist to the end of training, appear…

View free PDFSource page
arxivcs.LGmath.NAmath.ST2026-07-09

Group Invariant Spectral Embedding

Yeari Vigder, Paulina Hoyos, David Thong, Joakim andén, Joe Kileel, Amit Moscovich

Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures. Although many datasets of practical interest exhibit invariance under symmetries such as rotations, standard spectral emb…

View free PDFSource page
arxivcs.LGmath.NA2026-06-28

Randomized neural operator for parametric PDEs with fast training and conformal uncertainty quantification

Zirui Deng, Jingbo Sun, Deyu Meng, Fei Wang

Repeatedly solving parametric PDEs is essential for uncertainty quantification, design optimization and inverse problems, but conventional neural operators require expensive non-convex training. We introduce PCA--RaNN, a randomized latent neural operator that combines PCA-based d…

View free PDFSource page
arxivmath.NAcs.LGmath.STstat.ML2026-07-21

Boundary-Adapted PINNs for Elliptic Dirichlet Problems: $H^2(Ω)$ A Priori Error Bounds with Application to Mean Escape Time Computation

Nathanael Tepakbong, Jun Fan, Xiang Zhou, Ding-Xuan Zhou

Motivated by the numerical computation of the Mean Escape Time (MET) $τ:Ω\to\mathbb{R}$ of a stochastic process from a bounded domain $Ω\subseteq\mathbb{R}^d$, we study elliptic Dirichlet boundary value problems (BVPs) using boundary-enforced Physics-Informed Neural Networks (PIN…

View free PDFSource page
arxivcs.LGmath.NAphysics.comp-ph2026-07-03

CSympNet-ID: conformal-symplectic map learning for linearly damped Hamiltonian systems

Jiale Gong, Pengzhan Jin, Dongyang Kuang, Lu Li, Yifa Tang

Learning dissipative dynamics from discrete observations is essential for reliable long-horizon prediction and physically meaningful parameter identification. For linearly damped Hamiltonian systems, the exact flow is generally not symplectic but conformally symplectic, contracti…

View free PDFSource page