arXiv Machine Learning

Quantitative Sobolev Approximation Bounds for Neural Operators with Empirical Validation on Burgers Equation

arXiv:2605. 08170v2 Announce Type: replace Abstract: Neural operators have emerged as a powerful tool for learning mappings between infinite-dimensional function spaces.

arXiv Machine Learning
4d ago

Exponential Convergence of Deep Operator Networks for Elliptic Partial Differential Equations

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.

By Carlo Marcati, Christoph Schwab
arXiv Machine Learning
Sep 17

Fast Learning Rates for Physics-Informed Kernel Methods

arXiv:2609. 18901v1 Announce Type: cross Abstract: In physics-informed machine learning, a target function $u^*$ is learned from noisy value observations $y_i=u^*(x_i)+ \varepsilon_i$, together with differential information, given either by noisy observations $d_j=(Du^*)(z_j)+\xi_j$ or by a known physical constraint $Du^*=v$.

By Luc Brogat-Motte, Joachim Bona-Pellissier, Giacomo Meanti, Lorenzo Rosasco
arXiv Machine Learning
Jul 22

Boundary-Adapted PINNs for Elliptic Dirichlet Problems: $H^2(\Omega)$ A Priori Error Bounds with Application to Mean Escape Time Computation

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$.

By Nathanael Tepakbong, Jun Fan, Xiang Zhou, Ding-Xuan Zhou
arXiv Machine Learning
Aug 28

High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercube

The paper establishes high‑probability bounds on mixed input derivatives for wide random neural networks whose activation derivatives grow factorially, with a focus on anh networks initialized with Xavier weights. For scalar‑output anh networks with Gaussian weights, the authors prove that when the hidden width exceeds a depth‑dependent threshold, the derivative of any order satisfies a bound that is independent of depth for first‑order derivatives and grows at most polynomially with depth for higher‑order mixed derivatives. These results yield high‑probability estimates for the Euclidean Lipschitz constant and weighted Sobolev norms, linking the regularity of network realizations to quasi‑Monte Carlo integration and its potential impact on QMC‑based training.

By Josef Dick, Michael Feischl, Fabian Zehetgruber
arXiv Machine Learning
Aug 10

Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples

arXiv:2608. 06687v1 Announce Type: cross Abstract: We develop a rigorous theory of discrete residual least-squares approximation for elliptic spectral equations $\mathfrak L_\beta u=f$ using linearized ReLU$^k$ neural networks on the sphere, where $\mathfrak L_\beta$ is a positive elliptic spectral multiplier of order $\beta$.

By Xinliang Liu, Tong Mao, Jinchao Xu
arXiv Machine Learning
Sep 4

A Closed-Form Formula for Consistent Lipschitz Regression on Metric Spaces with Sparse Neural Network Realizations

arXiv:2609. 03129v1 Announce Type: cross Abstract: Several classical machine-learning methods, such as KRRs and SVRs, are both computationally and analytically tractable since their estimators either admit closed-form expressions or are obtained by minimizing convex training objectives; neither feature is generally available for deep neural networks.

By Ruiyang Hong, Hrad Ghoukasian, Anastasis Kratsios
arXiv Machine Learning
Jun 26

Random test functions, $H^{-1}$ norm equivalence, and stochastic variational physics-informed neural networks

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.

By Diego Marcondes