AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Compact Convex Projections

Steffen Grünewälder

JMLR 2018 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 0 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
increase CCP radius r with threshold 0.1 (ablation)CCP regressor · Million Songs subsetleast-squares error: 0.53 -> 0.17Improved
tighten CCP stopping threshold from 0.1 to 0.01 (ablation)CCP regressor · Million Songs subsetleast-squares error: 0.17 -> 0.13Improved
tighten CCP stopping threshold from 0.1 to 0.01 (ablation)CCP regressor · Million Songs subsetrun time (s): 8.89 -> 93.13Hurt
increase CCP radius r (ablation)CCP regressor · Million Songs subsetrun time (s): 1.03 -> 8.89Hurt
use CCP with r=5000 instead of GP regressorCCP-0.1 · Million Songs subsetleast-squares error: 0.121 -> 0.124No clear effect
vary GP regularization parameter (ablation)GP regressor · Million Songs subsetleast-squares error: 0.121No clear effect
use CCP regressor instead of Fast-KRR with long run timeCCP regressor · Million Songs (full)least-squares errorMixed
use CCP projection instead of cvx general solver (n=5000)CCP projection · Gaussian process synthetic datarun time (s)Improved

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