Gradient Alignment in Physics-informed Neural Networks: A Second-Order Optimization Perspective
Sifan Wang, Ananyae Kumar Bhartari, Bowen Li, Paris Perdikaris
TL;DR
This paper exposes directional conflicts among loss terms in physics-informed neural networks and introduces gradient-alignment metrics to quantify them. It shows that quasi-second-order optimization, especially SOAP, implicitly preconditions the loss landscape and dramatically improves gradient alignment, effectively connecting SOAP to Newton’s method. Across 10 PDE benchmarks, including turbulent flows at Reynolds numbers up to $10^4$, SOAP achieves state-of-the-art accuracy with 2–10× improvements over strong baselines, albeit with modestly increased training time. The results argue for wider adoption of gradient-alignment-aware, second-order preconditioning in multi-objective neural PDE solvers and suggest directions for scalable, robust optimizers in physics-informed machine learning.
Abstract
Multi-task learning through composite loss functions is fundamental to modern deep learning, yet optimizing competing objectives remains challenging. We present new theoretical and practical approaches for addressing directional conflicts between loss terms, demonstrating their effectiveness in physics-informed neural networks (PINNs) where such conflicts are particularly challenging to resolve. Through theoretical analysis, we demonstrate how these conflicts limit first-order methods and show that second-order optimization naturally resolves them through implicit gradient alignment. We prove that SOAP, a recently proposed quasi-Newton method, efficiently approximates the Hessian preconditioner, enabling breakthrough performance in PINNs: state-of-the-art results on 10 challenging PDE benchmarks, including the first successful application to turbulent flows with Reynolds numbers up to 10,000, with 2-10x accuracy improvements over existing methods. We also introduce a novel gradient alignment score that generalizes cosine similarity to multiple gradients, providing a practical tool for analyzing optimization dynamics. Our findings establish frameworks for understanding and resolving gradient conflicts, with broad implications for optimization beyond scientific computing.
