AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networks

Surbhi Goel, Adam Klivans

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory · 13 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Require only a marginal-distribution eigenvalue-decay assumptionAgnostic learning of ReLU networks · Networks of ReLUs on the unit sphereruntime: \mathsf{poly}(n, 1/\epsilon, \log(1/\delta))Improved
Assume polynomial eigenvalue decay i^{-\ell / \epsilon}Compressed Kernel Regression · One-hidden-layer ReLU network on \mathbb{S}^{n-1}learnability: i^{-\ell / \epsilon}Improved
Assume polynomial eigenvalue decay i^{-\sqrt{\ell} \log(\sqrt{\ell}/\epsilon)}Compressed Kernel Regression · One-hidden-layer sigmoid network on \mathbb{S}^{n-1}learnability: i^{-\sqrt{\ell} \log(\sqrt{\ell}/\epsilon)}Improved

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