arXiv:2605. 03542v2 Announce Type: replace-cross Abstract: The dual norm characterisation of weak solutions of second-order linear elliptic partial differential equations is mathematically natural but computationally intractable: evaluating the $H^{-1}$ norm of the residual requires a supremum over an infinite-dimensional test space.
arXiv:2508. 21571v2 Announce Type: replace Abstract: Physics informed neural networks (PINNs) represent a very popular class of neural solvers for partial differential equations.
arXiv:2607. 19167v1 Announce Type: cross Abstract: Motivated by the numerical computation of the Mean Escape Time (MET) $\tau:\Omega\to\mathbb{R}$ of a stochastic process from a bounded domain $\Omega\subseteq\mathbb{R}^d$, we study elliptic Dirichlet boundary value problems (BVPs) using boundary-enforced Physics-Informed Neural Networks (PINNs), in which the Dirichlet condition is imposed exactly by multiplying the network output with a predefined distance-to-boundary approximation $\rho$.
arXiv:2608. 09494v1 Announce Type: cross Abstract: In this paper we provide Monte Carlo and deep neural network approximations for stochastic representations of solutions to linear elliptic partial differential equations with constant diffusion, drift and killing.
arXiv:2609. 16406v1 Announce Type: cross Abstract: Machine learning-based partial differential equations (PDEs) solvers have attracted significant attention in recent years.
arXiv:2607. 24726v1 Announce Type: new Abstract: The Deep Galerkin Method (DGM) and Physics Informed Neural Networks (PINNs) have become widely-used methods for solving partial differential equations (PDEs) in the rapidly growing field of scientific machine learning.
arXiv:2606. 24999v1 Announce Type: new Abstract: High-dimensional partial differential equations (PDEs) with unknown coefficients arise widely in scientific machine learning, including continuous-time reinforcement learning, yet solving them efficiently in a data-driven way remains challenging.
arXiv:2112. 08125v3 Announce Type: replace-cross Abstract: We construct and analyze approximation rates of deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order partial differential equations.
arXiv:2607. 02003v1 Announce Type: cross Abstract: Although neural networks are remarkably effective, their underlying optimization principles remain theoretically elusive, often characterized by non-convex landscapes and stochastic heuristics.
arXiv:2406. 14340v2 Announce Type: replace-cross Abstract: The standard stochastic gradient descent (SGD) optimization method, as well as adaptive methods such as the Adam optimizer fail to converge if the learning rates do not converge to zero (particularly, in the situation of constant learning rates).
The paper proposes a unified framework that combines physics‑informed neural networks (PINNs) and finite element methods (FEM) by discretizing functional Gauss–Newton problems using finite families of linear measurements. By interpreting these measurements as test functions, the resulting Gauss–Newton system becomes a Petrov–Galerkin discretization of the linearized functional problem, thereby encompassing pointwise collocation and natural‑gradient approaches as special cases. The framework is specialized to elliptic partial differential equations, yielding weak residual formulations and a hybrid finite‑element–neural architecture that operates on complementary approximation spaces, with numerical experiments confirming its effectiveness.
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.
The paper introduces a two‑step debiased estimation method for PDE‑constrained inverse problems where the PDE solution is approximated by Physics‑Informed Neural Networks (PINNs). By combining neural‑network‑based nonparametric estimation with an influence‑function bias correction, the authors achieve a √{n}-consistent, asymptotically normal estimator without undersmoothing the neural network. The approach is extended to Bayesian inference, yielding a posterior that contracts at the √{n}-rate with asymptotic covariance matching the frequentist estimator, and the analysis also provides near‑minimax rates for estimating nonparametric regression functions and their derivatives in Sobolev spaces.