pith. sign in

arxiv: 1509.07385 · v3 · pith:VDZPARCXnew · submitted 2015-09-24 · 📊 stat.ML · cs.LG· cs.NE

Provable approximation properties for deep neural networks

classification 📊 stat.ML cs.LGcs.NE
keywords networkneuralapproximationdeepdimensionfunctionsgammamanifold
0
0 comments X
read the original abstract

We discuss approximation of functions using deep neural nets. Given a function $f$ on a $d$-dimensional manifold $\Gamma \subset \mathbb{R}^m$, we construct a sparsely-connected depth-4 neural network and bound its error in approximating $f$. The size of the network depends on dimension and curvature of the manifold $\Gamma$, the complexity of $f$, in terms of its wavelet description, and only weakly on the ambient dimension $m$. Essentially, our network computes wavelet functions, which are computed from Rectified Linear Units (ReLU)

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robust and Resource Efficient Identification of Two Hidden Layer Neural Networks

    cs.LG 2019-06 unverdicted novelty 6.0

    Presents an active-sampling method that approximates the weight subspace from Hessian finite differences, recovers the rank-1 tensors by robust nonlinear programming, and attributes layers with gradient descent, yield...