AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Why Deep Neural Networks for Function Approximation?

ICLR 2017 · Learning theory and algorithms › Sample complexity · approach: Hardness of learning neural networks · 146 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Increase depth to Θ(log(1/ε)) instead of restricting it to o(log(1/ε))ReLU/BSU networks approximating sufficiently smooth univariate functions · Univariate function approximation on [0,1]network size for ε-approximation: Ω(poly(1/ε)) neurons -> polylog(1/ε) neuronsHelped
Use a deep architecture with Θ(log(1/ε)) layersReLU/BSU networks approximating differentiable strongly convex functions · Strongly convex function approximationminimum network sizeHelped
Use depth growing with polynomial degree rather than a three-layer networkNetworks approximating univariate polynomials · Univariate polynomial approximationnetwork size growth with degree: exponentially with respect to p -> p log pHelped
Use a deep network rather than a three-layer networkNetworks approximating multivariate polynomials · Multivariate polynomial approximationnetwork size growth with degree at fixed input dimension: O(exp(p)) -> O(poly(p))Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy