atlas

Research map / Optimization / Implicit bias and generalization

Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent

ICML 2020 · Optimization › Implicit bias and generalization · approach: Low-rank and single-index recovery · 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
Train a classifier with gradient descent on square lossPolynomial-size classifiers learning one-layer ReLU or sigmoid networks · Standard Gaussian N(0, I_n), regressiontest square-lossHurt
Use a general statistical-query algorithm for classificationOne-layer ReLU or sigmoid networks · Standard Gaussian N(0, I_n), classificationclassification errorHurt
Construct networks by alternating parity-signed activations over coordinate masksOne-layer neural networks with an odd outer activation · Sign-symmetric distributionspairwise correlation: 0Helped
Train an overparameterized network with gradient descent on the constructed targetsTanh and ReLU networks · Gaussian regression and classification experimentstest errorHurt

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