AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 3 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
Use repeated block updates (T_k>2) instead of cyclic updates (T_k=2) (ablation)IBPG for NMF · Low-rank synthetic NMFmean E(k): $1.672 \, 10^{-3} \pm 7.313 \, 10^{-4}$ -> $\mathbf{1.081 \, 10^{-3}} \pm 6.012 \, 10^{-4}$Helped
Use repeated block updates (T_k>2) instead of cyclic updates (T_k=2) (ablation)IBPG for NMF · Urban and San Diego hyperspectral NMFmean E(k)Helped
Use two different extrapolation points for gradient evaluation and inertial forceIBPG · NMFconvergence speedHelped
Use APGC's single extrapolation-point parameterization instead of the proposed IBPG configurationIBPG · Low-rank synthetic NMFmean E(k): $1.672 \, 10^{-3} \pm 7.313 \, 10^{-4}$ -> $1.729 \, 10^{-3} \pm 7.452 \, 10^{-4}$Hurt

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