atlas

Research map / Optimization / Nonconvex and smooth optimization

Over-parametrization via Lifting for Low-rank Matrix Sensing: Conversion of Spurious Solutions to Strict Saddle Points

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 0 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
Lift the decision variable from l=1 to l=3 (ablation)Matrix sensing · Matrix sensing, n=3success rate: 0.575 -> 0.62Helped
Lift the decision variable from l=1 to l=3 (ablation)Matrix sensing · Matrix sensing, n=4success rate: 0.575 -> 0.68Helped
Lift the decision variable from l=1 to l=3 (ablation)Matrix sensing · Matrix sensing, n=5success rate: 0.475 -> 0.75Helped
Increase tensor order from l=1 to l=4 (ablation)Lifted matrix sensing · Matrix sensing, n=3smallest Hessian eigenvalue at spurious solution: 2.67 -> -0.17Mixed
Increase tensor order from l=1 to l=2 (ablation)Lifted matrix sensing · Matrix sensing, n=5smallest Hessian eigenvalue at spurious solution: 1.87 -> -0.81Mixed
Increase tensor order from l=1 to l=2 (ablation)Lifted matrix sensing · Matrix sensing, n=7smallest Hessian eigenvalue at spurious solution: 1.89 -> -1.64Mixed

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