atlas

Research map / Optimization / Nonconvex and smooth optimization

Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic Frank-Wolfe methods · 34 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
Replace Frank-Wolfe's rank-1 update with a rank-k updateTrace-norm-ball optimization with smooth, strongly convex objectives and rank(X*) ≤ k · Trace-norm balliterations to ε-approximation: O(β/ε) -> O(β/α log 1/ε)Helped
Use k-SVD instead of 1-SVD in the updateblockFW · Trace-norm ball; rank(X*) ≤ k1-SVD computations to ε-approximation: O(β/ε) -> O(kβ/α log 1/ε)Helped
Apply blockFW when the trace-norm bound is small and the optimum is low-rankMatrix completion and polynomial neural-network experiments · MOVIELENS1M matrix completion; MNIST polynomial neural networknumber of 1-SVD computationsHelped
Apply blockFW when the trace-norm bound is large and the optimum has higher rankMatrix completion and polynomial neural-network experiments · MOVIELENS and MNISTnumber of 1-SVD computationsNo clear effect

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