The accurate approximation of scalar-valued functions from sample points is a key task in mathematical modeling and computational science. Recently, machine learning techniques based on Deep Neural Networks (DNNs) have begun to emerge as promising tools for function approximation in scientific computingproblems , with impressive results achieved on problems where the dimension of the underlying data or problem domain is large. In this work , we broaden this perspectiveby focusing on approximation of functions that are Hilbert-valued, i.e. they take values in a separable, but typically infinite-dimensional, Hilbert space. This problem arises in many science and engineering problems, in particular those involving the solution of parametric Partial Differential Equations (PDEs). Such problems are challenging for three reasons. First, pointwise samples are expensive to acquire . Second, the domain of the function is usually high dimensional, and third, the range lies in a Hilbert space. Our contributions are twofold. First, we present a novel result on DNN training for holomorphic functions with so-called hidden anisotropy. This result introduces a DNN training procedure and a full theoretical analysis with explicit guarantees on the error and sample complexity. This error bound is explicit in the three key errors occurred in the approximation procedure: best approximation error, measurementerror and physical discretization error . Our result shows that there is a procedure for learning Hilbert-valued functions via DNNs that performs as well as  current best-in-class schemes.  Second, we  provide preliminary numerical results illustrating the practical performance of DNNs on Hilbert-valued functions arising as solutions to parametric PDEs. We consider different parameters, modify the DNN architecture to achieve better and competitive results and compare these to current best-in-class schemes.
Accurate approximation of scalar-valued functions from sample points is a key task in computational science. Recently, machine learning with Deep Neural Networks (DNNs) has emerged as a promising tool for scientific computing , with impressive results achieved on problems where the dimension of the data or problem domain is large. This work broadens this perspective, focusing on approximating functions that are Hilbert-valued, i.e. take values in a separable, but typically infinite-dimensional, Hilbert space. This arises in science and engineering problems, in particular those involving solution of parametric Partial Differential Equations (PDEs). Such problems are challenging : 1) pointwise samples are expensive to acquire , 2) the function domain is high dimensional, and 3) the range lies in a Hilbert space. Our contributions are twofold. First, we present a novel result on DNN training for holomorphic functions with so-called hidden anisotropy. This result introduces a DNN training procedure and full theoretical analysis with explicit guarantees on error and sample complexity. The error bound is explicit in three key errors occurring in the approximation procedure: the best approximation, measurement, and physical discretization errors . Our result shows that there exists a procedure (albeit non-standard) for learning Hilbert-valued functions via DNNs that performs as well as , but no better than current best-in-class schemes. It gives a benchmark lower bound for how well DNNs can perform on such problems. Second, we examine whether better performance can be achieved in practice through different types of architectures and training. We provide preliminary numerical results illustrating practical performance of DNNs on parametric PDEs. We consider different parameters, modifying the DNN architecture to achieve better and competitive results , comparing these to current best-in-class schemes.
R
The accurate
Accurate
D
mathematical modeling and
R
techniques based on
with
R
have begun to emerge as promising tools for function approximation in scientific computingproblems
has emerged as a promising tool for scientific computing
D
underlying
R
In this work , we broaden this perspectiveby focusing on approximation of
This work broadens this perspective, focusing on approximating
D
they
R
problem arises in many
arises in
D
the
R
for three reasons. First,
: 1)
R
. Second, the domain of the function is usually
, 2) the function domain is
R
third,
3)
D
a
D
the
R
This
The
D
the
R
occurred
occurring
R
best approximation error, measurementerror
the best approximation, measurement,
R
error
errors
R
is a procedure
exists a procedure (albeit non-standard)
A
, but no better than
A
It gives a benchmark lower bound for how well DNNs can perform on such problems.
A
examine whether better performance can be achieved in practice through different types of architectures and training. We
D
the
D
Hilbert-valued functions arising as solutions to
R
modify
modifying
R
and compare
, comparing