AI Paper Atlas

Research map / Optimization / Optimizers

Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices

John C. Duchi, Oliver Hinder, Andrew Naber, Yinyu Ye

NeurIPS 2020 · Optimization › Optimizers · approach: Differentiating through embedded optimization · 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 conic descent instead of conditional gradient (CG) with overestimate R = 1^T b of the trace boundphase retrieval on grayscale CIFAR-10 · CIFAR-10 images, SNR 20 dBmatrix multiplications to reach CG objective after 500 iterationsImproved
use tighter trace overestimate R = 2/k 1^T b for CG (ablation)conditional gradient baseline · phase retrieval, CIFAR-10iterations to desired objectiveHurt
add greedy step every 100 iterations to CD (ablation)conic descent · PSD matrix completionobjective f(Xk)-p*Improved
greedy step rank r = 2 or 3 vs r = 4 or 5 compared with pure Burer-Monteiro (PBM)CD without greedy step · PSD matrix completionobjective at equal matrix multiplicationsMixed

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