Incoherence-Optimal Matrix Completion

1 October 2013

Papers citing "Incoherence-Optimal Matrix Completion"

24 / 24 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 18 9 0 09 Oct 2023
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning Marina Munkhoeva Ivan V. Oseledets SSL 16 2 0 31 May 2023
Matrix Estimation for Individual Fairness Cindy Y. Zhang Sarah H. Cen Devavrat Shah FaML 23 4 0 04 Feb 2023
Learning Transition Operators From Sparse Space-Time Samples C. Kümmerle Mauro Maggioni Sui Tang 23 1 0 01 Dec 2022
Optimal tuning-free convex relaxation for noisy matrix completion Yuepeng Yang Cong Ma 28 8 0 12 Jul 2022
Robust Matrix Completion with Heavy-tailed Noise Bingyan Wang Jianqing Fan 21 3 0 09 Jun 2022
Multi-Tensor Network Representation for High-Order Tensor Completion Chang Nie Huan Wang Zhihui Lai 15 2 0 09 Sep 2021
GNMR: A provable one-line algorithm for low rank matrix recovery Pini Zilber B. Nadler 46 13 0 24 Jun 2021
Time Series Forecasting via Learning Convolutionally Low-Rank Models Guangcan Liu AI4TS 22 12 0 23 Apr 2021
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 24 44 0 21 May 2020
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent Tian Tong Cong Ma Yuejie Chi 19 113 0 18 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 19 85 0 16 May 2020
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 21 50 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 27 26 0 19 Feb 2019
Eigenvectors of Deformed Wigner Random Matrices F. Haddadi Arash A. Amini 19 1 0 13 Aug 2018
Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements Canyi Lu Jiashi Feng Zhouchen Lin Shuicheng Yan 37 102 0 07 Jun 2018
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow Xiao Zhang S. Du Quanquan Gu 18 24 0 03 Mar 2018
Fast Algorithms for Robust PCA via Gradient Descent Xinyang Yi Dohyung Park Yudong Chen C. Caramanis 14 264 0 25 May 2016
Detection of Planted Solutions for Flat Satisfiability Problems Quentin Berthet J. Ellenberg 27 6 0 21 Feb 2015
Non-convex Robust PCA Praneeth Netrapalli U. Niranjan Sujay Sanghavi Anima Anandkumar Prateek Jain 40 283 0 28 Oct 2014
Completing Any Low-rank Matrix, Provably Yudong Chen Srinadh Bhojanapalli Sujay Sanghavi Rachel A. Ward 45 116 0 12 Jun 2013