atlas

Research map / Optimization / Implicit bias and generalization

Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs

ICML 2017 · Optimization › Implicit bias and generalization · approach: Shallow ReLU network convergence · 71 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
Assume standard independent Gaussian inputs instead of an unconstrained input distributionGradient descent for no-overlap ReLU ConvNets · No-overlap ConvNet population riskcomputational tractability: NP-complete -> polynomial timeHelped
Allow overlap between convolutional filtersGradient descent for ReLU ConvNets · Gaussian inputs, two-dimensional filter exampleprobability of getting stuck in a sub-optimal region: ≥ 1/4Hurt
Use multiple random initializationsGradient descent for overlapping ConvNets · Gaussian inputs, empirical studybasin of attraction of the global optimum: at least 1/17Helped
Train on Gaussian rather than reduction-constructed non-Gaussian dataAdaGrad for no-overlap ConvNets · Empirical illustration, datasets of size 800training loss: 0.06Helped

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