Error-Conditioned Neural Solvers
Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task: once trained, they struggle to correct their own constraint violations and extrapolate beyond the training distribution. Recent hybrid methods promote physical correctness by targeting the PDE residual via gradient descent or Gauss--Newton steps, but inherit the compute cost and instability of the underlying classical optimizers. We show, theoretically and empirically, that numerically minimizing the PDE residual can be an unreliable proxy for
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 56%SciML/NeuralPDE.jl →
- PossiblePossibly related (embedding) · 52%Principled approaches for extending neural architectures to function spaces for operator learning →
- PossiblePossibly related (embedding) · 49%google-research/hyperbo →
- PossiblePossibly related (embedding) · 51%SimonBlanke/Gradient-Free-Optimizers →
