Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA

6 November 2017

Papers citing "Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA"

8 / 8 papers shown

Title
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent Yicheng Li Xinghua Sun 39 0 0 28 Apr 2025
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach Yao Wang Yiyang Yang Kaidong Wang Shanxing Gao Xiuwu Liao 63 0 0 12 Feb 2025
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions Tianming Wang Ke Wei 33 0 0 28 Jul 2024
Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization Cong Ma Xingyu Xu Tian Tong Yuejie Chi 16 9 0 09 Oct 2023
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective Yuetian Luo Nicolas García Trillos 17 6 0 29 Sep 2022
Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization Yuetian Luo Xudong Li Anru R. Zhang 23 9 0 03 Aug 2021
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent Tian Tong Cong Ma Yuejie Chi 14 113 0 18 May 2020
First-order Methods Almost Always Avoid Saddle Points J. Lee Ioannis Panageas Georgios Piliouras Max Simchowitz Michael I. Jordan Benjamin Recht ODL 85 82 0 20 Oct 2017