Hermite-NGP: Gradient-Augmented Hash Encoding for Learning PDEs
About
We propose Hermite-NGP, a gradient-augmented multi-resolution hash encoding designed to enable fast and accurate computation of spatial derivatives for neural PDE solvers. Unlike existing NGP-based approaches that rely on automatic differentiation or finite differences and suffer from instability or high cost, Hermite-NGP explicitly stores function values and mixed partial derivatives at hash grid vertices, allowing fully analytic evaluation of gradients, Jacobians, and Hessians via Hermite interpolation. This design preserves the efficiency and spatial adaptivity of NGP while supporting analytic differential operators up to second order. We further introduce a multi-resolution curriculum training strategy analogous to multigrid V-cycles to enable coarse-to-fine optimization. Across a range of 2D and 3D PDE benchmarks, Hermite-NGP achieves up to approximately 20 times lower error than prior neural PDE methods, and reduces wall-clock convergence time by 2 to 10 times compared to other solvers, with per-epoch training times as low as 3.5 ms for models with up to 17M parameters.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Solving PDE | Flow-Mixing | Relative Error0.0235 | 17 | |
| Learning PDEs | Helmholtz 2D a=10 | Relative L2 Error1.81e-5 | 15 | |
| SDF learning | Stanford Meshes | Grad MAE0.0416 | 12 | |
| 3D Poisson solving | Stanford Meshes | L2 Error0.0031 | 8 | |
| Learning PDEs | Helmholtz 2D a=20 | Relative L2 Error0.0079 | 7 | |
| Learning PDEs | Convection c=30 | Relative L2 Error8.49e-5 | 7 | |
| Image reconstruction from gradient supervision | CAMERA (test) | PSNR32.56 | 6 | |
| Learning PDEs | Helmholtz 3D a=3 | Relative L2 Error6.09e-5 | 6 | |
| Learning PDEs | Taylor-Green Vortex nu=0.01 | Relative L2 Error7.71e-5 | 5 | |
| Learning PDEs | Helmholtz 3D a=10 | Relative L2 Error0.006 | 4 |