arXiv:2209. 01432v4 Announce Type: replace-cross Abstract: In this paper we study probabilistic and neural network approximations for solutions to Poisson equation subject to Holder data in general bounded domains of $\mathbb{R}^d$.
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.
The paper explores neural network solvers for infinity and p‑Laplace problems, employing Physics‑Informed Neural Networks (PINNs) and Deep Operator Networks (DeepONets). It addresses computational challenges for large p values (2 to 1000) across 2D and 3D domains, showing advantages over traditional mesh‑based solvers, especially in three dimensions. The authors provide conditional convergence results for PINNs, a universal approximation theorem for DeepONet on the parametric p‑Poisson problem, and validate their methods with numerical experiments comparing performance to conventional approaches.
arXiv:2508. 21571v2 Announce Type: replace Abstract: Physics informed neural networks (PINNs) represent a very popular class of neural solvers for partial differential equations.
The paper presents a theoretical framework for certifying the accuracy of physics‑informed neural networks (PINNs) used to solve partial differential equations. It derives generalization bounds that link the residual loss minimized during training to the actual error in the solution space, showing that if the neural approximation stays within a compact subset, a vanishing residual guarantees convergence to the true solution. Deterministic and probabilistic convergence results are provided, offering explicit error guarantees based on residual, boundary, and initial condition errors.
arXiv:2604. 09361v3 Announce Type: replace Abstract: This paper introduces the Stochastic-Dimension Frozen Sampled Neural Network (SD-FSNN), a novel computational framework for solving high-dimensional Gross-Pitaevskii equation (GPE) on unbounded domain.
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:2609. 16406v1 Announce Type: cross Abstract: Machine learning-based partial differential equations (PDEs) solvers have attracted significant attention in recent years.
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.
The paper introduces a neural operator architecture that inherently satisfies homogeneous Dirichlet boundary conditions by constraining each layer’s output to lie within the span of selected Dirichlet eigenfunctions of the Laplacian. This design works for any bounded domain with a Lipschitz boundary and any discretization, avoiding the restrictions of previous methods. The authors prove universal approximation for their architecture and demonstrate its effectiveness on Darcy flow and Helmholtz equation problems.
arXiv:2609.14841v1 Announce Type: new Abstract: Scientific machine learning methods such as physics-informed neural networks (PINNs) increasingly rely on domain decomposition for better scalability w...
The paper introduces Hessian-free high-resolution (HFHR) dynamics, an extension of underdamped Langevin dynamics that incorporates reversible position diffusion for sampling in machine learning. It provides an explicit quantitative contraction rate under a position Poincaré inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, even when the potential is non‑convex. For the HFHR Monte Carlo algorithm, a path‑space Girsanov argument yields a non‑asymptotic convergence bound and an explicit iteration complexity in total variation distance, improving on previous HFHR results and demonstrating benefits of a positive diffusion parameter through numerical experiments.
arXiv:2609.37509v1 Announce Type: new Abstract: The boundary element method (BEM) provides an efficient numerical framework for solving multiple scattering problems in unbounded homogeneous domains....