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

v1v2v3 (latest)

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

6 November 2017

ArXiv (abs)PDF HTML

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

9 / 9 papers shown

Title
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent Yicheng Li Xinghua Sun 77 0 0 28 Apr 2025
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions Tianming Wang Ke Wei 66 1 0 28 Jul 2024
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective Yuetian Luo Nicolas García Trillos 52 7 0 29 Sep 2022
Synthetically Controlled Bandits Vivek Farias C. Moallemi Tianyi Peng Andrew Zheng 95 13 0 14 Feb 2022
Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization Yuetian Luo Xudong Li Anru R. Zhang 85 11 0 03 Aug 2021
Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements Tian Tong Cong Ma Ashley Prater-Bennette Erin E. Tripp Yuejie Chi 110 33 0 29 Apr 2021
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent Tian Tong Cong Ma Yuejie Chi 110 120 0 18 May 2020
Nonconvex Matrix Completion with Linearly Parameterized Factors Ji Chen Xiaodong Li Zongming Ma 52 3 0 29 Mar 2020
Non-Convex Matrix Completion Against a Semi-Random Adversary Yu Cheng Rong Ge AAML 61 25 0 28 Mar 2018