PINNMorph: Evolving Online Adaptation Policies for Physics-Informed Neural Networks
Organizations: East China Normal University · Nankai University · Hanyang University
Abstract
Physics-informed neural networks (PINNs) provide a learning-based framework for solving partial differential equations (PDEs), yet their training behavior can change substantially throughout optimization. Residual distributions, gradient interactions, regional learning difficulty, and model-capacity requirements may evolve over time, while the network architecture and major training mechanisms are typically determined before training. We propose PINNMorph, an online PINN adaptation framework based on large language model (LLM)-guided policy evolution. PINNMorph maintains a population of state-conditioned adaptation policies that map execution diagnostics to controlled interventions over topology modification, additive representation augmentation, objective balancing, gradient handling, adaptive sampling, and optimizer-phase control. At each intervention opportunity, candidate programs are instantiated from the current policy population, selected according to the observed training state, and applied directly to the PINN under training. The resulting model inherits its existing parameters and training state and continues optimization along the same trajectory. Execution outcomes are subsequently used to evaluate interventions and evolve the policy population. Unlike pre-training architecture search or fixed adaptation rules, PINNMorph jointly adapts the current PINN and the policies governing its interventions using feedback from actual training. Experiments on 13 PDE benchmarks show that PINNMorph achieves lower solution errors than SA-PINN, ConFIG, RoPINN, HARMONIC, and PINNsAgent across all evaluated problems. Ablation studies further examine the effects of online adaptation, state-conditioned intervention selection, and execution-feedback-driven policy evolution.
Figures & tables
| PDE | SA-PINN | ConFIG | RoPINN | HARMONIC | PINNsAgent | PINNMorph |
|---|---|---|---|---|---|---|
| KS 1D | 6.40E+0 4.63E-2 | 1.47E+1 4.60E-1 | 6.37E+0 5.01E-1 | 5.55E+1 5.88E+0 | 1.12E+0 3.27E-2 | 1.05E+0 3.44E-1 |
| Burgers 1D | 4.77E-4 3.08E-5 | 2.47E-4 1.27E-4 | 6.31E-4 6.35E-5 | 1.32E-4 2.13E-5 | 7.24E-5 1.49E-5 | 6.48E-5 3.29E-5 |
| NS 2D CG | 7.10E-3 3.11E-4 | 2.46E-2 7.81E-3 | 9.91E-3 5.27E-3 | 5.34E-3 4.84E-4 | 4.44E-3 1.30E-3 | 1.47E-3 4.13E-4 |
| Heat 2D CG | 3.41E-3 6.07E-5 | 1.60E-2 3.96E-3 | 4.92E-3 8.93E-4 | 2.87E-2 4.96E-4 | 3.61E-3 8.71E-4 | 1.81E-3 4.48E-4 |
| Heat 2D MS | 3.03E-4 2.25E-5 | 3.18E-4 2.99E-5 | 3.95E-4 8.06E-6 | 4.20E-4 6.47E-5 | 3.13E-4 2.59E-5 | 2.34E-4 2.21E-5 |
| Heat 2D VC | 1.45E-2 5.17E-3 | 3.52E-2 4.91E-3 | 4.70E-1 4.86E-3 | 9.95E-2 3.86E-2 | 5.62E-3 3.33E-3 | 1.82E-3 2.54E-4 |
| Variant | Online Adaptation | State-Conditioned Selection | Policy Evolution | Feedback Evolution |
| No Morph | ||||
| Random Selection | ✓ | ✓ | ✓ | |
| Random Evolution | ✓ | ✓ | ✓ | |
| PINNMorph | ✓ | ✓ | ✓ | ✓ |
| PDE | No Morph | Random Selection | Random Evolution | PINNMorph |
|---|---|---|---|---|
| KS 1D | 5.21E+0 1.76E+0 | 6.24E+0 1.87E+0 | 5.03E+0 5.74E-1 | 1.05E+0 3.44E-1 |
| Burgers 1D | 6.82E-4 5.05E-4 | 3.62E-4 1.35E-4 | 7.92E-4 4.96E-4 | 6.48E-5 3.29E-5 |
| NS 2D CG | 8.72E-3 3.38E-3 | 9.46E-2 1.10E-2 | 4.39E-3 1.86E-3 | 1.47E-3 4.13E-4 |
| Heat 2D CG | 5.17E-3 6.43E-4 | 1.95E-2 4.83E-3 | 4.01E-2 5.46E-3 | 1.81E-3 4.48E-4 |
| Heat 2D MS | 4.26E-3 3.91E-4 | 3.89E-3 2.72E-4 | 4.43E-3 8.00E-5 | 2.34E-4 2.21E-5 |
| Heat 2D VC | 3.43E-2 1.67E-2 | 4.20E-2 1.46E-2 | 4.94E-3 2.07E-3 | 1.82E-3 2.54E-4 |
| Training state | Diagnostic signal | Action | Before After |
|---|---|---|---|
| Localized error | Shock-localized residual | Localized Expert | |
| Representation limit | Non-local residual | Fourier Branch | |
| Spatial imbalance | Residual imbalance | Adaptive Sampling | |
| Gradient conflict | Inter-equation conflict | Topology Split | |
| Spatial imbalance | High-D residual imbalance | Adaptive Sampling | |
| Optimization plateau | Stable gradients | Correction Branch |
| Variant | LLM Calls | LLM Tokens | Wall Time (s) | Median MSE Ratio |
|---|---|---|---|---|
| No Morph | 0 | 0 | 1250 | 12.65 |
| Random Selection | 30 | 1273 | 10.77 | |
| Random Evolution | 33 | 1286 | 10.30 | |
| PINNMorph | 38 | 1308 | 1.00 |
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
| Group | Mechanism | Target and execution rule | Parameters |
|---|---|---|---|
| Topology | Widen | Replicate units in selected hidden layers and divide outgoing weights by replication count (Net2Wider map). | Width fraction; layers. |
| Topology | Regrow | Expand selected hidden layers through the same function-preserving duplication map. | Width fraction; layers. |
| Topology | Add layer | Insert a new hidden layer after a selected layer; initialize its weights and continue the live model. | Layer index. |
| Topology | Prune | Remove low-utility hidden units while respecting a minimum width. | Width fraction; minimum width; layers. |
| Topology | Redistribute | Remove donor units and add capacity elsewhere in the hidden stack. | Move fraction; minimum width; layers. |
| Topology | Local reinitialization | Reinitialize a bounded fraction of units in selected hidden layers. | Reset fraction; layers. |
Neural PDE Solvers
Neural PDE solvers use trainable models to approximate solutions or solution operators for partial differential equations, often with physical constraints.
See all 269 papers