Projected gradient descent for one-hidden-layer PINNs solving the Poisson equation is claimed to converge with average loss O(1/sqrt(T) + 1/sqrt(m)) plus an approximation error, with a generalization bound via Rademacher complexity of the Laplacian.
Feature Mapping in Physics-Informed Neural Networks (PINNs)
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, the training dynamics of PINNs with a feature mapping layer via the limiting Conjugate Kernel and Neural Tangent Kernel is investigated, shedding light on the convergence of PINNs; Although the commonly used Fourier-based feature mapping has achieved great success, we show its inadequacy in some physics scenarios. Via these two scopes, we propose conditionally positive definite Radial Basis Function as a better alternative. Lastly, we explore the feature mapping numerically in wide neural networks. Our empirical results reveal the efficacy of our method in diverse forward and inverse problem sets. Composing feature functions is found to be a practical way to address the expressivity and generalisability trade-off, viz., tuning the bandwidth of the kernels and the surjectivity of the feature mapping function. This simple technique can be implemented for coordinate inputs and benefits the broader PINNs research.
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Non-Asymptotic Analysis of Projected Gradient Descent for Physics-Informed Neural Networks
Projected gradient descent for one-hidden-layer PINNs solving the Poisson equation is claimed to converge with average loss O(1/sqrt(T) + 1/sqrt(m)) plus an approximation error, with a generalization bound via Rademacher complexity of the Laplacian.