atlas

Research map / Optimization / Nonconvex and smooth optimization

A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 13 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
geometrically diminishing step size instead of constant, O(1/k) or O(1/sqrt k) step size (ablation)projected Riemannian subgradient method · DPCP synthetic (D=100, c=10, 70% outliers)convergence rateHelped
geometrically diminishing step size instead of O(1/k^(3/8)) step size (ablation)projected Riemannian subgradient method · orthogonal dictionary learning (D=70, rho=0.3)convergence rateHelped
decay factor beta of 0.5 or 0.6 versus 0.7 and above (ablation)geometric step size mu_k=0.01*beta^k · DPCP syntheticconvergenceMixed

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