Joost A. A. Opschoor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Joost A. A. Opschoor has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Schwab
Seminar for Applied Mathematics, ETH Zurich, Zurich, Switzerland
9 shared publications - Jakob Zech
Interdisziplinäres Zentrum für Wissenschaftliches Rechnen, Universität Heidelberg, Heidelberg, Germany
3 shared publications - Philipp Petersen
Faculty of Mathematics and Research Network Data Science Uni Vienna University of Vienna Austria
3 shared publications - Carlo Marcati
Dipartimento di Matematica “F. Casorati”, Università di Pavia, I-27100 Pavia, Italy
2 shared publications - Christos Xenophontos
Department of Mathematics and Statistics, University of Cyprus, Nicosia, Cyprus
2 shared publications - Marcello Longo
Seminar for Applied Mathematics ETH Zürich Rämistrasse 101 CH-8092 Zürich Switzerland
2 shared publications
Latest Publications
- Open Access
- 26 September 2025
- Published by Springer Nature in Numerische Mathematik
- Vol. 157 (5) , 1897-1936
Neural networks for singular perturbations
We prove deep neural network (DNN for short) expressivity rate bounds for solution sets of a model class of singularly perturbed, elliptic two-point boundary value problems, in Sobolev norms, on the bounded interval $$(-1,1)$$ . We assume that the given source term and reaction coefficient are analytic in $$[-1,1]$$ . The expression rate bounds in Sobolev norms in terms of the NN size are robust, i.e. uniform with respect to the singular perturbation parameter $$\varepsilon \in (0,1]$$ for several classes of DNN architectures. In particular, ReLU NNs, spiking NNs, and $$\tanh $$ - and sigmoid-activated NNs. The latter activations can represent “exponential boundary layer solution features” explicitly, in the last hidden layer of the DNN, i.e. in a shallow subnetwork, and afford improved robust expression rate bounds in terms of the NN size. All DNN architectures allow robust exponential solution expression in so-called ‘energy’ as well as in ‘balanced’ Sobolev norms, for analytic input data.- 26 September 2025
- Published by Springer Nature in Numerische Mathematik
- Vol. 157 (5) , 1897-1936
Open AccessNeural networks for singular perturbations
We prove deep neural network (DNN for short) expressivity rate bounds for solution sets of a model class of singularly perturbed, elliptic two-point boundary value problems, in Sobolev norms, on the bounded interval $$(-1,1)$$ . We assume that the given source term and reaction coefficient are analytic in $$[-1,1]$$ . The expression rate bounds in Sobolev norms in terms of the NN size are robust, i.e. uniform with respect to the singular perturbation parameter $$\varepsilon \in (0,1]$$ for several classes of DNN architectures. In particular, ReLU NNs, spiking NNs, and $$\tanh $$ - and sigmoid-activated NNs. The latter activations can represent “exponential boundary layer solution features” explicitly, in the last hidden layer of the DNN, i.e. in a shallow subnetwork, and afford improved robust expression rate bounds in terms of the NN size. All DNN architectures allow robust exponential solution expression in so-called ‘energy’ as well as in ‘balanced’ Sobolev norms, for analytic input data. - Open Access
First Order System Least Squares Neural Networks
We introduce a conceptual framework for numerically solving linear elliptic, parabolic, and hyperbolic PDEs on bounded, polytopal domains in euclidean spaces by deep neural networks. The PDEs are recast as minimization of a least-squares (LSQ for short) residual of an equivalent, well-posed first-order system, over parametric families of deep neural networks. The associated LSQ residual is a) equal or proportional to a weak residual of the PDE, b) additive in terms of contributions from localized subnetworks, indicating locally ``out-of-equilibrium'' of neural networks with respect to the PDE residual, c) serves as numerical loss function for neural network training, and d) constitutes, even with incomplete training, a computable, (quasi-)optimal numerical error estimator in the context of adaptive LSQ finite element methods. In addition, an adaptive neural network growth strategy is proposed which, assuming exact numerical minimization of the LSQ loss functional, yields sequences of neural networks with realizations that converge rate-optimally to the exact solution of the first order system LSQ formulation.
Open AccessFirst Order System Least Squares Neural Networks
We introduce a conceptual framework for numerically solving linear elliptic, parabolic, and hyperbolic PDEs on bounded, polytopal domains in euclidean spaces by deep neural networks. The PDEs are recast as minimization of a least-squares (LSQ for short) residual of an equivalent, well-posed first-order system, over parametric families of deep neural networks. The associated LSQ residual is a) equal or proportional to a weak residual of the PDE, b) additive in terms of contributions from localized subnetworks, indicating locally ``out-of-equilibrium'' of neural networks with respect to the PDE residual, c) serves as numerical loss function for neural network training, and d) constitutes, even with incomplete training, a computable, (quasi-)optimal numerical error estimator in the context of adaptive LSQ finite element methods. In addition, an adaptive neural network growth strategy is proposed which, assuming exact numerical minimization of the LSQ loss functional, yields sequences of neural networks with realizations that converge rate-optimally to the exact solution of the first order system LSQ formulation.
- 27 August 2024
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 69 (5) , 1-30
Exponential expressivity of ${\rm ReLU}^k$ neural networks on Gevrey classes with point singularitiesInstitute of Mathematics of the Czech Academy of Sciences
- 27 August 2024
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 69 (5) , 1-30
Exponential expressivity of ${\rm ReLU}^k$ neural networks on Gevrey classes with point singularitiesInstitute of Mathematics of the Czech Academy of Sciences
- Open Access
- 4 July 2024
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 169, 142-162
Deep ReLU networks and high-order finite element methods II: Chebyšev emulation
- 4 July 2024
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 169, 142-162
Open AccessDeep ReLU networks and high-order finite element methods II: Chebyšev emulation
- Open Access
Neural Networks for Singular Perturbations
We prove deep neural network (DNN for short) expressivity rate bounds for solution sets of a model class of singularly perturbed, elliptic two-point boundary value problems, in Sobolev norms, on the bounded interval $(-1,1)$. We assume that the given source term and reaction coefficient are analytic in $[-1,1]$. We establish expression rate bounds in Sobolev norms in terms of the NN size which are uniform with respect to the singular perturbation parameter for several classes of DNN architectures. In particular, ReLU NNs, spiking NNs, and $\tanh$- and sigmoid-activated NNs. The latter activations can represent ``exponential boundary layer solution features'' explicitly, in the last hidden layer of the DNN, i.e. in a shallow subnetwork, and afford improved robust expression rate bounds in terms of the NN size. We prove that all DNN architectures allow robust exponential solution expression in so-called `energy' as well as in `balanced' Sobolev norms, for analytic input data.Open AccessNeural Networks for Singular Perturbations
We prove deep neural network (DNN for short) expressivity rate bounds for solution sets of a model class of singularly perturbed, elliptic two-point boundary value problems, in Sobolev norms, on the bounded interval $(-1,1)$. We assume that the given source term and reaction coefficient are analytic in $[-1,1]$. We establish expression rate bounds in Sobolev norms in terms of the NN size which are uniform with respect to the singular perturbation parameter for several classes of DNN architectures. In particular, ReLU NNs, spiking NNs, and $\tanh$- and sigmoid-activated NNs. The latter activations can represent ``exponential boundary layer solution features'' explicitly, in the last hidden layer of the DNN, i.e. in a shallow subnetwork, and afford improved robust expression rate bounds in terms of the NN size. We prove that all DNN architectures allow robust exponential solution expression in so-called `energy' as well as in `balanced' Sobolev norms, for analytic input data. - Open Access
- 9 June 2023
- Published by Elsevier in Neural Networks
- Vol. 165, 721-739
De Rham compatible Deep Neural Network FEM
- 9 June 2023
- Published by Elsevier in Neural Networks
- Vol. 165, 721-739
Open AccessDe Rham compatible Deep Neural Network FEM
- Open Access
De Rham compatible Deep Neural Network FEM
On general regular simplicial partitions $\mathcal{T}$ of bounded polytopal domains $\Omega \subset \mathbb{R}^d$, $d\in\{2,3\}$, we construct \emph{exact neural network (NN) emulations} of all lowest order finite element spaces in the discrete de Rham complex. These include the spaces of piecewise constant functions, continuous piecewise linear (CPwL) functions, the classical ``Raviart-Thomas element'', and the ``N\'{e}d\'{e}lec edge element''. For all but the CPwL case, our network architectures employ both ReLU (rectified linear unit) and BiSU (binary step unit) activations to capture discontinuities. In the important case of CPwL functions, we prove that it suffices to work with pure ReLU nets. Our construction and DNN architecture generalizes previous results in that no geometric restrictions on the regular simplicial partitions $\mathcal{T}$ of $\Omega$ are required for DNN emulation. In addition, for CPwL functions our DNN construction is valid in any dimension $d\geq 2$. Our ``FE-Nets'' are required in the variationally correct, structure-preserving approximation of boundary value problems of electromagnetism in nonconvex polyhedra $\Omega \subset \mathbb{R}^3$. They are thus an essential ingredient in the application of e.g., the methodology of ``physics-informed NNs'' or ``deep Ritz methods'' to electromagnetic field simulation via deep learning techniques. We indicate generalizations of our constructions to higher-order compatible spaces and other, non-compatible classes of discretizations, in particular the ``Crouzeix-Raviart'' elements and Hybridized, Higher Order (HHO) methods.Open AccessDe Rham compatible Deep Neural Network FEM
On general regular simplicial partitions $\mathcal{T}$ of bounded polytopal domains $\Omega \subset \mathbb{R}^d$, $d\in\{2,3\}$, we construct \emph{exact neural network (NN) emulations} of all lowest order finite element spaces in the discrete de Rham complex. These include the spaces of piecewise constant functions, continuous piecewise linear (CPwL) functions, the classical ``Raviart-Thomas element'', and the ``N\'{e}d\'{e}lec edge element''. For all but the CPwL case, our network architectures employ both ReLU (rectified linear unit) and BiSU (binary step unit) activations to capture discontinuities. In the important case of CPwL functions, we prove that it suffices to work with pure ReLU nets. Our construction and DNN architecture generalizes previous results in that no geometric restrictions on the regular simplicial partitions $\mathcal{T}$ of $\Omega$ are required for DNN emulation. In addition, for CPwL functions our DNN construction is valid in any dimension $d\geq 2$. Our ``FE-Nets'' are required in the variationally correct, structure-preserving approximation of boundary value problems of electromagnetism in nonconvex polyhedra $\Omega \subset \mathbb{R}^3$. They are thus an essential ingredient in the application of e.g., the methodology of ``physics-informed NNs'' or ``deep Ritz methods'' to electromagnetic field simulation via deep learning techniques. We indicate generalizations of our constructions to higher-order compatible spaces and other, non-compatible classes of discretizations, in particular the ``Crouzeix-Raviart'' elements and Hybridized, Higher Order (HHO) methods. - Open Access
- 14 June 2022
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 23 (3) , 1043-1127
Exponential ReLU Neural Network Approximation Rates for Point and Edge Singularities
In certain polytopal domains $$\varOmega $$ , in space dimension $$d=2,3$$ , we prove exponential expressivity with stable ReLU Neural Networks (ReLU NNs) in $$H^1(\varOmega )$$ for weighted analytic function classes. These classes comprise in particular solution sets of source and eigenvalue problems for elliptic PDEs with analytic data. Functions in these classes are locally analytic on open subdomains $$D\subset \varOmega $$ , but may exhibit isolated point singularities in the interior of $$\varOmega $$ or corner and edge singularities at the boundary $$\partial \varOmega $$ . The exponential approximation rates are shown to hold in space dimension $$d = 2$$ on Lipschitz polygons with straight sides, and in space dimension $$d=3$$ on Fichera-type polyhedral domains with plane faces. The constructive proofs indicate that NN depth and size increase poly-logarithmically with respect to the target NN approximation accuracy $$\varepsilon >0$$ in $$H^1(\varOmega )$$ . The results cover solution sets of linear, second-order elliptic PDEs with analytic data and certain nonlinear elliptic eigenvalue problems with analytic nonlinearities and singular, weighted analytic potentials as arise in electron structure models. Here, the functions correspond to electron densities that exhibit isolated point singularities at the nuclei.- 14 June 2022
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 23 (3) , 1043-1127
Open AccessExponential ReLU Neural Network Approximation Rates for Point and Edge Singularities
In certain polytopal domains $$\varOmega $$ , in space dimension $$d=2,3$$ , we prove exponential expressivity with stable ReLU Neural Networks (ReLU NNs) in $$H^1(\varOmega )$$ for weighted analytic function classes. These classes comprise in particular solution sets of source and eigenvalue problems for elliptic PDEs with analytic data. Functions in these classes are locally analytic on open subdomains $$D\subset \varOmega $$ , but may exhibit isolated point singularities in the interior of $$\varOmega $$ or corner and edge singularities at the boundary $$\partial \varOmega $$ . The exponential approximation rates are shown to hold in space dimension $$d = 2$$ on Lipschitz polygons with straight sides, and in space dimension $$d=3$$ on Fichera-type polyhedral domains with plane faces. The constructive proofs indicate that NN depth and size increase poly-logarithmically with respect to the target NN approximation accuracy $$\varepsilon >0$$ in $$H^1(\varOmega )$$ . The results cover solution sets of linear, second-order elliptic PDEs with analytic data and certain nonlinear elliptic eigenvalue problems with analytic nonlinearities and singular, weighted analytic potentials as arise in electron structure models. Here, the functions correspond to electron densities that exhibit isolated point singularities at the nuclei. - Top Cited Papers
- 6 January 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (2) , 1-37
Constructive Deep ReLU Neural Network Approximation
- 6 January 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (2) , 1-37
Top Cited PapersConstructive Deep ReLU Neural Network Approximation
- Top Cited PapersOpen Access
- 23 April 2021
- Published by Springer Nature in Constructive Approximation
- Vol. 55 (1) , 537-582
Exponential ReLU DNN Expression of Holomorphic Maps in High Dimension
For a parameter dimension $$d\in {\mathbb {N}}$$ , we consider the approximation of many-parametric maps $$u: [-\,1,1]^d\rightarrow {\mathbb R}$$ by deep ReLU neural networks. The input dimension d may possibly be large, and we assume quantitative control of the domain of holomorphy of u: i.e., u admits a holomorphic extension to a Bernstein polyellipse $${{\mathcal {E}}}_{\rho _1}\times \cdots \times {{\mathcal {E}}}_{\rho _d} \subset {\mathbb {C}}^d$$ of semiaxis sums $$\rho _i>1$$ containing $$[-\,1,1]^{d}$$ . We establish the exponential rate $$O(\exp (-\,bN^{1/(d+1)}))$$ of expressive power in terms of the total NN size N and of the input dimension d of the ReLU NN in $$W^{1,\infty }([-\,1,1]^d)$$ . The constant $$b>0$$ depends on $$(\rho _j)_{j=1}^d$$ which characterizes the coordinate-wise sizes of the Bernstein-ellipses for u. We also prove exponential convergence in stronger norms for the approximation by DNNs with more regular, so-called “rectified power unit” activations. Finally, we extend DNN expression rate bounds also to two classes of non-holomorphic functions, in particular to d-variate, Gevrey-regular functions, and, by composition, to certain multivariate probability distribution functions with Lipschitz marginals.- 23 April 2021
- Published by Springer Nature in Constructive Approximation
- Vol. 55 (1) , 537-582
Top Cited PapersOpen AccessExponential ReLU DNN Expression of Holomorphic Maps in High Dimension
For a parameter dimension $$d\in {\mathbb {N}}$$ , we consider the approximation of many-parametric maps $$u: [-\,1,1]^d\rightarrow {\mathbb R}$$ by deep ReLU neural networks. The input dimension d may possibly be large, and we assume quantitative control of the domain of holomorphy of u: i.e., u admits a holomorphic extension to a Bernstein polyellipse $${{\mathcal {E}}}_{\rho _1}\times \cdots \times {{\mathcal {E}}}_{\rho _d} \subset {\mathbb {C}}^d$$ of semiaxis sums $$\rho _i>1$$ containing $$[-\,1,1]^{d}$$ . We establish the exponential rate $$O(\exp (-\,bN^{1/(d+1)}))$$ of expressive power in terms of the total NN size N and of the input dimension d of the ReLU NN in $$W^{1,\infty }([-\,1,1]^d)$$ . The constant $$b>0$$ depends on $$(\rho _j)_{j=1}^d$$ which characterizes the coordinate-wise sizes of the Bernstein-ellipses for u. We also prove exponential convergence in stronger norms for the approximation by DNNs with more regular, so-called “rectified power unit” activations. Finally, we extend DNN expression rate bounds also to two classes of non-holomorphic functions, in particular to d-variate, Gevrey-regular functions, and, by composition, to certain multivariate probability distribution functions with Lipschitz marginals.