atlas

Research map / Learning theory and algorithms / Sample complexity

Tight Sample Complexity of Learning One-hidden-layer Convolutional Neural Networks

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory · 13 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 approximate gradient updates instead of Double ConvotronOne-hidden-layer CNN · Synthetic ReLU networks, Gaussian inputsparameter estimation errorMixed
Use approximate gradient updates instead of Double ConvotronOne-hidden-layer CNN · Synthetic sigmoid and hyperbolic tangent networks, Gaussian inputsconvergenceHelped
Use approximate gradient updates with random initializationOne-hidden-layer CNN · One-hidden-layer CNN, standard Gaussian inputs, non-overlapping filterssample complexity: \tilde O ( (k+r)\cdot \epsilon^{-2} ) vs. \tilde O(k^2r\cdot \epsilon^{-2})Helped
Apply approximate gradient descent to all six tested activation and network-size settingsApproximate GD · Synthetic ReLU, sigmoid, and hyperbolic tangent networksconvergenceHelped

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