Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 37 min ago
PreprintarXiv licencearXiv

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

Abstract

Randomized neural networks retain an output-linear least-squares solve, but globally sampled random features may fail to capture the spatial and scale structure of PDE solutions. We propose SFRBE--RaNN, a two-stage adaptive trial-space construction. SFR redistributes a fixed feature budget according to regional indicator masses and adapts regional weight scales through low-dimensional residual-based optimization. RBE constructs nonredundant enrichments by screening multiple activation families, removing represented response directions, and selecting the smallest admissible prefix. For solution-dependent operators, candidates are screened with a frozen operator and accepted only after nonlinear residual verification. For fixed linear problems, we establish an exact discrete residual-reduction identity and a conditional solution-error estimate. Building on this identity, we combine safeguarded SFR with RBE capture factors to derive a finite-horizon error bound involving baseline best approximation and empirical consistency, together with a conditional random-search success-probability bound. Numerical experiments on localized, multiscale, and nonlinear space--time problems demonstrate the method's effectiveness.

Related

  1. Adaptive Conformal Redistribution for Inter-class Transitional Uncertainty in Medical Image Classification
    Saibal Ghosh, Samarup Bhattacharya, Sanjoy Kumar Saha +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Characterizing Estimator-Regime Transitions in Adaptive Enrichment Trials
    Xin Luo, Maria Kudela, Margaret Gamalo
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  3. BOP2-ENR: a Bayesian optimal phase II design for adaptive enrichment with family-wise error rate control and a bound on joint-claim power
    Kentaro Takeda, Belay B. Yimer, Masahiro Kojima
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Sharp bounds for non-adaptive randomized approximation of high-dimensional vectors
    Robert J. Kunsch, Marcin Wnuk
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  5. A GPU-Accelerated Blocked Adaptive Randomized Range Finder Based on an Implicit Householder QR Decomposition
    Carolin Penke, Andreas Herten
    arXivPreprintCC BY-SA 4.0Full textNumerical analysis & scientific computingarXiv
BibTeX
@misc{yang2026adaptive,
  title = {{Adaptive Randomized Neural Networks for PDEs: Structure-Aware Feature Redistribution and Residual-Driven Block Enrichment}},
  author = {You Yang and Fei Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21077},
  eprint = {2610.21077},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21077},
}
RIS
TY  - UNPB
TI  - Adaptive Randomized Neural Networks for PDEs: Structure-Aware Feature Redistribution and Residual-Driven Block Enrichment
AU  - You Yang
AU  - Fei Wang
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21077
UR  - https://arxiv.org/abs/2610.21077
AB  - Randomized neural networks retain an output-linear least-squares solve, but globally sampled random features may fail to capture the spatial and scale structure of PDE solutions. We propose SFRBE--RaNN, a two-stage adaptive trial-space construction. SFR redistributes a fixed feature budget according to regional indicator masses and adapts regional weight scales through low-dimensional residual-based optimization. RBE constructs nonredundant enrichments by screening multiple activation families, removing represented response directions, and selecting the smallest admissible prefix. For solution-dependent operators, candidates are screened with a frozen operator and accepted only after nonlinear residual verification. For fixed linear problems, we establish an exact discrete residual-reduction identity and a conditional solution-error estimate. Building on this identity, we combine safeguarded SFR with RBE capture factors to derive a finite-horizon error bound involving baseline best approximation and empirical consistency, together with a conditional random-search success-probability bound. Numerical experiments on localized, multiscale, and nonlinear space--time problems demonstrate the method's effectiveness.
ER  -