Reference-free logged energy-oracle recovery for neural approximations of symmetric coercive variational problems: conforming Riesz reconstruction and archive-level selection
arXiv:2608.16473
2026
Training
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper gives a reference-free method for selecting neural PDE checkpoints without knowing the exact solution. Its central construction is a conforming Riesz reconstruction of each candidate's variational residual, whose energy norm equals the true energy error in the full test space and is a monotone lower bound in nested finite-dimensional spaces. This can replace unreliable training-loss selection for PINNs and neural Galerkin solvers. Hierarchical enrichment can additionally provide practical error intervals and ranking certificates under saturation.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Replace raw neural PDE training-loss checkpoint selection with a residual monitor measured in the variational energy geometry. For every archived network, solve an auxiliary conforming Riesz problem and select the checkpoint with the smallest reconstructed residual norm; nested auxiliary spaces make this score converge monotonically to the inaccessible energy error.
Useful7/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use two nested Riesz reconstruction spaces to estimate unresolved residual energy for every checkpoint. Under a measurable saturation assumption, convert the coarse and enriched monitors into lower and upper error bounds, and certify a unique checkpoint whenever its upper bound lies below every competitor's lower bound.
Useful6/10
Difficulty5/10
Novelty8/10