Expressive Power of Deep Networks on Manifolds: Simultaneous Approximation

A key challenge in scientific machine learning is solving partial differential equations (PDEs) on complex domains, where the curved geometry complicates the approximation of functions and their derivatives required by differential operators. This paper establishes the first simultaneous approximation theory for deep neural networks on manifolds. We prove that a constant-depth ReLUk-1 network with bounded weights--a property that plays a crucial role in controlling generalization error--can approximate any function in the Sobolev space Wpk(Md) to an error of varepsilon in the Wps(Md) norm, for k≥ 3 and s<k, using O(varepsilon-d/(k-s)) nonzero parameters, a rate that overcomes the curse of dimensionality by depending only on the intrinsic dimension d. These results readily extend to functions in H"older-Zygmund spaces. We complement this result with a matching lower bound, proving our construction is nearly optimal by showing the required number of parameters matches up to a logarithmic factor. Our proof of the lower bound introduces novel estimates for the Vapnik-Chervonenkis dimension and pseudo-dimension of the network's high-order derivative classes. These complexity bounds provide a theoretical cornerstone for learning PDEs on manifolds involving derivatives. Our analysis reveals that the network architecture leverages a sparse structure to efficiently exploit the manifold's low-dimensional geometry. Finally, we corroborate our theoretical findings with numerical experiments.