Metraipolis › archive › dc_3e783c59ecbf
LPINNs: First-Layer Gated Localization for Physics-Informed Neural Networks — arXiv:2609.22984
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22984
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:06:57.477Z
- SHA-256 of the archived text
72a65f850b5a5c9ee33a7f479bb7d6c6138ab022ea8546a5d141e058f8e8aadd- Stable URL of this page
https://metraipolis.com/documento/dc_3e783c59ecbf
How to cite
LPINNs: First-Layer Gated Localization for Physics-Informed Neural Networks — arXiv:2609.22984 — arXiv (en), https://arxiv.org/abs/2609.22984 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3e783c59ecbf (Metraipolis archive dc_3e783c59ecbf, sha256 72a65f850b5a5c9ee33a7f479bb7d6c6138ab022ea8546a5d141e058f8e8aadd)
BibTeX
@misc{dc3e783c59ecbf,
title = {LPINNs: First-Layer Gated Localization for Physics-Informed Neural Networks — arXiv:2609.22984},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22984},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3e783c59ecbf; sha256 72a65f850b5a5c9ee33a7f479bb7d6c6138ab022ea8546a5d141e058f8e8aadd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22984. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Physics-informed neural networks (PINNs) use one shared representation over the computational domain, which can become difficult to optimize on long domains and for high-order operators. We study a minimal alternative: multiply the first hidden activation of an otherwise unchanged dense PINN by input-dependent localization functions, giving first-layer units receptive fields without partitioning the domain or adding interface losses. We screen 13 families of localization functions, in up to three parameterizations each, on a nonlinear harmonic oscillator (HO), a heat equation on a long spatial interval, and a manufactured four-dimensional (4D) fourth-order problem, with ten paired seeds throughout. Three configurations give large reductions in solution error at matched budgets: (i) Fixed Gaussian localization functions on the $2\pi$ HO domain cut mean solution RMSE from $4.8369\times10^{-1}$ to $8.83\times10^{-3}$ at 3k epochs. (ii) The inverse-quadratic family with learnable centers and widths cuts it from $2.896\times10^{-1}$ to $3.06\times10^{-2}$ on the $8\pi$ heat domain at 10k epochs. (iii) Fixed bump localization functions cut it from $1.75947\times10^{1}$ to $2.260\times10^{-1}$ on the $4\pi$ 4D domain at 10k epochs. Every paired seed improves in these three comparisons. The screen also shows that the mechanism is not a free win: on HO only 2 of 13 families beat the baseline, and 10 of the remaining 11 are 9 to 23 times worse; on 4D four families are non-finite and five are more than three orders of magnitude worse than the baseline. The inverse-quadratic family is the only one that beats the baseline on all three equations. Overall, these results show that first-layer localization can provide measurable improvements to baseline PINNs on long-domain and high-order problems.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Computational Engineering, Finance, and Science (cs.CE); Neural and Evolutionary Computing (cs.NE).
Pagina del lavoro: https://arxiv.org/abs/2609.22984 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T06:58:09.249Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).