analiza aiqbench
Composing insight from the full article — this may take a moment.
Derivative Computation in PINNs: Automatic Differentiation, Finite Differences and Beyond
arXiv:2608.11020v2 Announce Type: replace Abstract: We systematically investigate finite-difference (FD) derivative computation in Physics-Informed Neural Networks (PINNs) as an alternative to automatic differentiation (AD). On three benchmark PDEs we show that, with a properly calibrated step size, FD matches AD in accuracy on every problem while running faster across the full tested batch-size range and using substantially less GPU memory, and that a stochastic variant we propose outperforms AD on a stationary problem. We further show that for neural architectures with inter-sample dependencies (e.g. BatchNorm, self-attention) the standard PyTorch autograd idiom is silently incorrect; the correct per-sample alternative is computationally infeasible at PINN-relevant batch sizes, while FD provides a forward-only approximation that is empirically an order of magnitude closer to the true per-sample derivative.
Abstract:We systematically investigate finite-difference (FD) derivative computation in Physics-Informed Neural Networks (PINNs) as an alternative to automatic differentiation (AD). On three benchmark PDEs we show that, with a properly calibrated step size, FD matches AD in accuracy on every problem while running faster across the full tested batch-size range and using substantially less GPU memory, and that a stochastic variant we propose outperforms AD on a stationary problem. We further show that for neural architectures with inter-sample dependencies (e.g. BatchNorm, self-attention) the standard PyTorch autograd idiom is silently incorrect; the correct per-sample alternative is computationally infeasible at PINN-relevant batch sizes, while FD provides a forward-only approximation that is empirically an order of magnitude closer to the true per-sample derivative.
Machine Learning (cs.LG); Numerical Analysis (math.NA); Computational Physics (physics.comp-ph)
I.2.6; G.1.4; G.1.8
arXiv:2608.11020 [cs.LG]
(or arXiv:2608.11020v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.11020 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 220 cuvinte
Subiecte conexe

Tu Delft Team Introduces Reduced Basis Algorithm for Polynomial Nonlinear Equations
Quantum Zeitgeist · 15 iun. 2026
Modern analog computing for solving differential and matrix equations
arXiv · 12 iun. 2026
Reduced basis algorithm for solving nonlinear differential equations on quantum computers
arXiv · 12 iun. 2026
The Elements of Differentiable Programming
arXiv · 5 aug. 2026