atlas

Research map / Optimization / Nonconvex and smooth optimization

Efficient Dictionary Learning with Gradient Descent

ICML 2019 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 5 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
Negative curvature normal to stable manifolds of saddle points (vs. positive curvature in the same direction)randomly initialized gradient descent on complete orthogonal dictionary learning · theoretical analysis (separable and dictionary learning objectives)iterations to reach neighborhood of global minimumHelped
Logarithmic dependence of iteration bound on the initialization-volume parameter zeta0 (vs. linear failure-probability dependence)gradient descent convergence bound for separable objective · theoretical bound (Theorem 1)iteration bound T and failure probability 1-PHelped
Sample size p scaling for concentration of dictionary learning resultsdictionary learning gradient descent analysis · theoretical analysisrequired sample complexity pNo clear effect

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