Stabilized Adaptive Loss and Residual-Based Collocation for Physics-Informed Neural Networks

Physics-Informed Neural Networks (PINNs) provide a meshless approach for solving partial differential equations (PDEs), but suffer severe degradation in stiff and shock-dominated problems, where small PDE residuals can correspond to globally inaccurate solutions. We show these failures are multi-causal, arising from the concurrent interplay of (i) spectral bias against sharp features, (ii) imbalanced multi-term optimization and loss-weight collapse, (iii) violation of temporal causality, and (iv) under-resolved collocation. We present SPARC-Net, a unified architecture and training framework that jointly addresses all four pathologies. SPARC-Net leverages an adaptive multi-scale spectral encoder with a learnable spectral gate, a gated residual backbone, adaptive activations, and a hard-constraint output ansatz that exactly enforces initial and boundary conditions, structurally eliminating loss-weight collapse. Training employs stabilized gradient-norm loss balancing, floored causality-respecting residual weighting, and residual-based adaptive collocation (RAD). Validated against exact analytic and high-order spectral reference solutions across four canonical benchmarks -- viscous Burgers', Allen-Cahn, convection (beta=30), and reaction -- SPARC-Net yields substantial improvements over vanilla PINNs: relative L2 error drops from 1.47e-1 to 1.14e-1 on Burgers' (22% reduction), 9.93e-1 to 5.78e-2 on Allen-Cahn (94% reduction), and 9.82e-1 to 3.54e-3 on reaction (100% reduction). A characteristic-coordinate encoder for hyperbolic transport further reduces convection error from 5.14e-1 to 9.88e-5 (100% reduction). We report five-seed mean +/- standard deviation errors, Wilcoxon significance tests, full ablation studies, hyperparameter sensitivities, an extension to the 2D heat equation, and comparisons against parameter-matched baselines.

Physics-informed neural networks (PINNs) provide a mesh-free approach for solving differential equations, but their performance can depend strongly on loss weighting, collocation placement, and optimization strategy. This study develops an adaptive PINN framework for the Blasius boundary-layer equation using gradient-norm-based adaptive loss weighting, nonuniform and residual-based collocation, and sequential Adam--L-BFGS optimization. In the representative run using the architecture $[1,100,100,1]$, the model predicts $f''(0)=0.3320762918$, compared with the high-accuracy benchmark $0.332057336215$, giving an absolute error of $1.896\times10^{-5}$. The final weighted loss is $6.789\times10^{-8}$, and the predicted stream-function, velocity, and shear profiles agree closely with an independent numerical boundary-value solution. A separate full-training architecture study shows that the two-hidden-layer model achieves the smallest wall-shear error among the four tested architectures, $1.629\times10^{-6}$, whereas the deepest network attains the smallest weighted objective but a substantially larger wall-shear error. Compared with the previously reported PINN value $f''(0)=0.33165$, the representative run reduces the wall-shear error by approximately a factor of $21.5$. The results show that the combined adaptive training framework can achieve high accuracy for the Blasius problem and that weighted loss alone is insufficient for identifying the most physically accurate PINN. Because the adaptive components are applied jointly, their individual contributions cannot be isolated from the present results and would require a controlled ablation study for separate assessment.

For systems with steep gradients, sharp interfaces, or severe spatio-temporal coupling, Physics-informed neural networks (PINNs) suffer from spectral bias, geometric inflexibility, and boundary constraint conflicts, which undermine accuracy and convergence. To overcome these issues, we propose a geometry-adaptive and constraint-enhanced PINN (GAC-PINN). The framework comprises four components: a gradient-driven adaptive grid mapping (AGM) for diffeomorphic point concentration with Jacobian regularization, an adaptive bandwidth hard-constraint ansatz with spatially-varying boundary transition widths, a Gaussian Fourier feature mapping as a spectral preconditioner to further enhance high-wavenumber representation, and an operator-aware router that automatically selects the appropriate hard-constraint construction based on whether the governing PDE contains temporal derivatives. An AGM callback mechanism and a three-stage training strategy ensure stable coordination. Benchmarks including the viscous Burgers equation, a sharp-peaked 2D Poisson problem, and the Allen-Cahn phase-transition equation show that GAC-PINN attains relative (L^2) errors of ((1.747\pm 0.450)\times 10^{-4}), ((2.868\pm 0.947)\times 10^{-5}), and ((1.756 \pm 0.712)\times 10^{-3}), respectively, consistently outperforming the baselines. Ablation studies further reveal that AGM alone yields a substantially lower error than residual-based adaptive refinement (RAR), while RAR becomes beneficial only when combined with FFM, demonstrating a context-dependent module interaction. 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.