This work shows that standard gradient-norm balancing fails, and introduces SDF-Aware Weighting (SAW), which combines a residual-quantile gate with a gradient-norm ratio so that points exhibiting legitimate departure are excluded before the surviving term is scaled.
Abstract
Adaptive loss-balancing schemes for physics-informed neural networks rest on a premise that every residual should be driven to zero. For level-set advection with an eikonal regulariser that premise fails: the eikonal term penalises deviation of $\lVert\nabla\phi\rVert$ from unity, a property transport preserves only under rigid motion; where the exact solution departs from a signed-distance function the eikonal residual of the correct answer is nonzero, and driving it to zero moves the network away from that answer. We show that standard gradient-norm balancing fails in exactly this way, its weight remaining near its initial value throughout training on benchmarks where the property is violated, and we introduce SDF-Aware Weighting (SAW), which combines a residual-quantile gate with a gradient-norm ratio so that points exhibiting legitimate departure are excluded before the surviving term is scaled. Across four three-dimensional benchmarks SAW selects an eikonal weight within an order of magnitude of the value located by an eighteen-run manual sweep, spanning four decades from $10^{-1}$ to $10^{-5}$ with a single fixed configuration. On the slotted sphere, where the initial field is non-differentiable at reentrant edges, SAW attains a lower error than any weight in that sweep. Two smooth rigid benchmarks serve as controls: SAW is worse there, as expected when its premise does not hold. An ablation with the gate disabled shows the slot is nearly entirely filled while the relative $L_2$ error reads $1.06\%$, indistinguishable from a field that never represented the slot. We give a feature-restricted measure that separates the two cases.
Physics-informed neural networks (PINNs) can attain small residuals for partial differential equations while drifting from global invariants. We separate residual-based training from invariant enforcement: a standard PINN is trained first, and its output is then projected onto a selected invariant manifold at inference...
Convergence analysis verifies rapid error reduction and saturation with increasing resolution, establishing a practical adaptive framework for high-fidelity simulation of problems with localized sharp features in applied mechanics and computational physics.
We present a physics--informed neural solver for the generalized Falkner--Skan boundary-value problem that combines an exact boundary--admissible trial representation with adaptive regional residual balancing (ARRB). The three prescribed boundary conditions are embedded analytically, eliminating boundary-condition pena...
Residual-adaptive collocation is commonly compared at equal optimizer steps, although maintaining its sampling proposal requires PDE-residual evaluations in addition to those used for training. Such comparisons can obscure whether an apparent gain comes from point placement or from additional information work. We intro...
Method is introduced, which augments SOAP-style preconditioning with a scalar secant-energy correction adapted to Kronecker geometry and an adaptive basis update followed by variance-state downscaling, and is positioned as a scalable option for stiff, high-accuracy physics-informed training, rather than a uniform repla...
Guang-Yuan Wang, Mads Toftrup, Sebastian Loeschcke et al.· 0 citations
In comparison experiments designed for two transfer tasks and matched for main PINN training budgets, STCAS achieves the lowest aggregate mean reported error among the compared methods for both a steady convection–diffusion equation and a nonlinear time-dependent Burgers equation.
Ju-Zheng Zhang, Shi-Yang Li, Tao Zhu et al.· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.