arXiv AI

A user's guide to PINNs in geometric analysis: lessons from the asymptotic Plateau problem

arXiv:2607. 28733v1 Announce Type: cross Abstract: This proceedings contribution elaborates on the findings of arXiv:2605.

arXiv Machine Learning
Jun 11

Minimal surfaces, Knots, and Neural Networks

arXiv:2605. 26234v2 Announce Type: replace-cross Abstract: A recent conjecture by Joel Fine posits a relationship between the coefficients of the HOMFLY polynomial of a knot $K$ in the 3-sphere $S^3$, and the signed count of minimal surfaces in hyperbolic 4-space $\mathrm{H}^4$ meeting the sphere at infinity at $K$, with prescribed genus and self-intersection number.

By Tancredi Schettini Gherardini, Marco Usula
arXiv Machine Learning
Sep 22

Learning Physics from an Imperfect Ancestor

arXiv:2609.24947v1 Announce Type: new Abstract: Neural operators evaluate parametric partial differential equations cheaply but degrade sharply outside their training distribution. Physics-informed n...

By S. Mohammad Mousavi, Teeratorn Kadeethum, Nikolaos Bouklas, Somdatta Goswami
arXiv Machine Learning
Jun 4

Loss-Conditional PINNs for Parametric PDE Families

arXiv:2606. 04420v1 Announce Type: new Abstract: Physics-informed neural networks (PINNs) approximate solutions of ODEs and PDEs by minimising a weighted combination of residual, boundary, initial, and data losses.

By Anna Lazareva, Alexander Tarakanov
arXiv Machine Learning
Jun 17

A Convex Quasilinearization Method for Solving Nonlinear PDEs with Physics-Informed Neural Networks

arXiv:2606. 18175v1 Announce Type: cross Abstract: We present a numerical method for the forward solution of nonlinear partial differential equations (PDEs) in which Bellman-Kalaba quasilinearization reduces the nonlinear problem to a sequence of linear subproblems, each discretized by collocation onto a trial space that is linear in its parameters and solved by a single direct linear least-squares QR factorization.

By Gbenga T. Awojinrin, Abdul-Akeem Olawoyin, Rami M. Younis
arXiv Machine Learning
Aug 11

Eikonal Regularisation in Physics-Informed Neural Networks for Three-Dimensional Level-Set Advection: Transferability of Two-Dimensional Design Principles

arXiv:2608. 08322v1 Announce Type: cross Abstract: Physics-informed neural networks applied to the level-set formulation of interface advection commonly augment the residual and initial-condition losses with an eikonal regulariser, penalising the deviation of $\|\nabla\phi\|$ from unity.

By Muhammad Akbar Khan
arXiv Machine Learning
Jun 2

Taming the Loss Landscape of PINNs with Noisy Feynman-Kac Supervision: Operator Preconditioning and Non-Asymptotic Error Bounds

arXiv:2606. 00643v1 Announce Type: cross Abstract: Physics-Informed Neural Networks (PINNs) often train slowly or fail to converge on challenging partial differential equations (PDEs), a behavior recently linked to severely ill-conditioned loss landscapes inherited from the underlying differential operator.

By Nathanael Tepakbong, Hanyu Hu, Chengyu Liu, Xiang Zhou
arXiv Machine Learning
4d ago

Learning Spectrally Optimised Mesh-Free Discretisations

The paper introduces Spectrally Optimised Neural Discretisations (SpeND), a mesh‑free framework that learns discretisation weights from local stencil geometry on unstructured point clouds. By embedding discrete moment conditions into the network architecture, SpeND guarantees polynomial consistency and allows the weights to be optimised for spectral accuracy over a chosen wavenumber band, using an unsupervised Fourier‑mode loss. The resulting operators are PDE‑agnostic, perform well on Poisson, Burgers, and Navier–Stokes equations, and can reduce wall‑clock time by 3–20× compared to existing mesh‑free methods at the same accuracy.

By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
arXiv Machine Learning
Aug 31

Examining the robustness of Physics-Informed Neural Networks to noise for Inverse Problems

The paper evaluates the robustness of Physics‑Informed Neural Networks (PINNs) against noisy data in inverse problems, comparing them to a finite element method (FEM) plus optimizer baseline. Experiments on viscosity identification in 1D Burgers’ equation and 2D/3D Taylor‑Green Vortex with additive Gaussian noise show that PINNs, while requiring less human expertise, are outperformed by the traditional FEM approach in accuracy (e.g., RMSE 0.01 vs. 0.0013 for 2D Taylor‑Green with σ=1). PINNs do, however, exhibit better scaling with problem complexity, and the study highlights specific training failures that must be addressed for PINNs to become more competitive.

By Aleksandra Jekic, Afroditi Natsaridou, Signe Riemer-S{\o}rensen, Helge Langseth, Odd Erik Gundersen