AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A closer look at the approximation capabilities of neural networks

ICLR 2020 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory · 8 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
Use a continuous non-polynomial activationOne-hidden-layer networks · Continuous functions on compact Xhidden units sufficient: N ∈ O(ε^{-n})Helped
Use a single hidden layer with \binom{n+d}{d} unitsApproximation of degree-at-most-d polynomials · Polynomial functions on compact Xuniform approximation: \binom{n+d}{d}Helped
Restrict output-layer non-bias weights to |w| < δOne-hidden-layer networks · Continuous functions on compact Xuniform approximation: |w| < δNo clear effect
Require first-layer non-bias weights to have magnitude above λOne-hidden-layer networks · Continuous functions on compact Xuniform approximation: |w|>λNo clear effect
Fix first-layer non-bias weights to random draws from a suitable rangeOne-hidden-layer networks with trainable biases and output weights · Continuous functions on compact Xprobability of uniform approximation: with probability 1Helped

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