AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Parameter-Free Conditional Gradient Method for Composite Minimization under Hölder Condition

Masaru Ito, Zhaosong Lu, Chuan He

JMLR 2023 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 parameter-free adaptive line-search step (Algorithm 2) instead of 2/(t+2) stepconditional gradient method · lp-norm over lq ball (n=5000, q=3, p=1.3)avg CPU time (s): 37.3 -> 28.4Improved
use parameter-free step (Algorithm 2) instead of parameter-dependent Algorithm 1conditional gradient method · lp-norm over lq ball (n=5000, q=3, p=1.3)avg CPU time (s): 161.2 -> 28.4Improved
use parameter-free step (Algorithm 2) instead of Algorithm 1 at p=2conditional gradient method · lp-norm over lq ball (n=5000, q=3, p=2)avg CPU time (s): 0.084 -> 0.083No clear effect
use Algorithm 2 instead of Nesterov step rule (25)conditional gradient method · Entropy-regularized lp-norm (m=5000, lambda=10, p=1.5)avg CPU time (s): 1.77 -> 0.33Improved
use Algorithm 2 instead of Algorithm 1conditional gradient method · Entropy-regularized lp-norm (m=5000, lambda=10, p=1.5)avg iterations: 107117.5 -> 16.3Improved
use Algorithm 2 instead of Algorithm 1 at p=2, lambda=10conditional gradient method · Entropy-regularized lp-norm (m=5000, lambda=10, p=2)avg CPU time (s): 0.78 -> 0.33No clear effect
use Algorithm 2 instead of CGM-LSconditional gradient method · Simplex-constrained NMF (m=n=500, k=5)avg CPU time (s): 179.24 -> 14.74Improved
use Algorithm 2 instead of CGM-LSconditional gradient method · Simplex-constrained NMF (m=n=500, k=5)avg iterations: 7131.6 -> 904.3Improved
increase k from 5 to 10Algorithm 2 · Simplex-constrained NMF (m=n=500)avg CPU time (s): 14.74 -> 6.35Improved

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