Residual-Christoffel Sampling for Random Feature Collocation of Linear PDEs
arXiv:2607.13382
2026
Training
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides an operator-aware way to stabilize fixed-feature PDE solvers: sample points according to leverage in the space of operator-applied features rather than according to the physical domain measure. The key transferable asset is that residual-space whitening makes the expected collocation Gram approximately isotropic, while inverse-density weights prevent high-leverage regions from dominating the least-squares system. This can be brought directly into random-feature MLPs, physics-informed extreme learning machines, or linearized neural PDE solvers without changing the forward architecture. The most informative first test is whether residual-Christoffel sampling reduces condition numbers and reaches a target PDE error with fewer collocation points than uniform sampling or standard residual-adaptive sampling.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace uniform collocation for a fixed random-feature neural PDE solver with sampling from the leverage-score density of the operator-applied features. Whiten the retained residual feature space before solving for output coefficients, so the sampled least-squares matrix has an identity-like expected Gram rather than inheriting severe anisotropy from the differential operator. The same construction can be used for a linearized neural network by treating Jacobian features as the trial functions.
Useful8/10
Difficulty5/10
Novelty7/10