atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Alternating minimization for dictionary learning with random initialization

NeurIPS 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization

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
Replace operator-norm bound on the true dictionary A* with an infinity-norm (max-entry) bound ||A*||_inf <= C_b/salternating minimization for dictionary learning · theoretical analysis, sparse dictionary learningallowed dictionary scale / convergence guaranteeHelped
Restrict sparsity to s = O(sqrt(d)) instead of s = O(d^{1/6}) (Agarwal et al.) or s = O(sqrt(d)/log d) (Arora et al.)alternating minimization with l1 MU-selector and gradient step · overcomplete dictionary learning, theorymaximum tolerable sparsity levelHelped
Use {l1,l2,linf}-MU Selector sparse estimator instead of standard LASSO/Dantzig selector in the sparse-coding stepalternating minimization for dictionary learning · theory, dictionary corruptionradius of convergence / error guaranteeHelped
Random initialization replaced by requiring initial dictionary within inf-norm C_b/(2s) of A* (Assumption B1), after an erratumalternating minimization with random initialization · theory, erratumconvergence guaranteeNo 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