ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1407.4070
  4. Cited By
Fast matrix completion without the condition number

Fast matrix completion without the condition number

15 July 2014
Moritz Hardt
Mary Wootters
ArXivPDFHTML

Papers citing "Fast matrix completion without the condition number"

50 / 60 papers shown
Title
Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
G. Zhang
S. Fattahi
Richard Y. Zhang
45
36
0
13 Apr 2025
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions
Tianming Wang
Ke Wei
33
1
0
28 Jul 2024
Online Learning and Information Exponents: On The Importance of Batch
  size, and Time/Complexity Tradeoffs
Online Learning and Information Exponents: On The Importance of Batch size, and Time/Complexity Tradeoffs
Luca Arnaboldi
Yatin Dandi
Florent Krzakala
Bruno Loureiro
Luca Pesce
Ludovic Stephan
47
1
0
04 Jun 2024
Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled
  Gradient Descent, Even with Overparameterization
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
Matrix Completion in Almost-Verification Time
Matrix Completion in Almost-Verification Time
Jonathan A. Kelner
Jungshian Li
Allen Liu
Aaron Sidford
Kevin Tian
19
4
0
07 Aug 2023
Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing
Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing
Nived Rajaraman
Devvrit
Aryan Mokhtari
Kannan Ramchandran
25
0
0
20 Mar 2023
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly
  Linear Time
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
Yuzhou Gu
Zhao Song
Junze Yin
Licheng Zhang
16
26
0
21 Feb 2023
Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix
  Completion
Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion
G. Zhang
Hong-Ming Chiu
Richard Y. Zhang
27
10
0
24 Aug 2022
Robust Matrix Completion with Heavy-tailed Noise
Robust Matrix Completion with Heavy-tailed Noise
Bingyan Wang
Jianqing Fan
21
4
0
09 Jun 2022
Randomly Initialized Alternating Least Squares: Fast Convergence for
  Matrix Sensing
Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing
Kiryung Lee
Dominik Stöger
31
11
0
25 Apr 2022
Private Alternating Least Squares: Practical Private Matrix Completion
  with Tighter Rates
Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates
Steve Chien
Prateek Jain
Walid Krichene
Steffen Rendle
Shuang Song
Abhradeep Thakurta
Li Zhang
25
19
0
20 Jul 2021
GNMR: A provable one-line algorithm for low rank matrix recovery
GNMR: A provable one-line algorithm for low rank matrix recovery
Pini Zilber
B. Nadler
48
14
0
24 Jun 2021
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix
  Completion via Gradient Descent
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent
Trung Vu
Raviv Raich
40
10
0
04 Feb 2021
Riemannian Perspective on Matrix Factorization
Riemannian Perspective on Matrix Factorization
Kwangjun Ahn
Felipe Suarez
16
13
0
01 Feb 2021
Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and
  Robust Convergence Without the Condition Number
Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
Tian Tong
Cong Ma
Yuejie Chi
21
55
0
26 Oct 2020
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a
  Scalable Second Order Method
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order Method
C. Kümmerle
C. M. Verdun
19
6
0
07 Sep 2020
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled
  Gradient Descent
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent
Tian Tong
Cong Ma
Yuejie Chi
27
115
0
18 May 2020
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank
  Matrix Completion
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion
Abdallah A. Chehade
Zunya Shi
19
0
0
04 Oct 2019
A Survey of Optimization Methods from a Machine Learning Perspective
A Survey of Optimization Methods from a Machine Learning Perspective
Shiliang Sun
Zehui Cao
Han Zhu
Jing Zhao
22
548
0
17 Jun 2019
Nonconvex Rectangular Matrix Completion via Gradient Descent without
  $\ell_{2,\infty}$ Regularization
Nonconvex Rectangular Matrix Completion via Gradient Descent without ℓ2,∞\ell_{2,\infty}ℓ2,∞​ Regularization
Ji Chen
Dekai Liu
Xiaodong Li
13
11
0
18 Jan 2019
Provable Subspace Tracking from Missing Data and Matrix Completion
Provable Subspace Tracking from Missing Data and Matrix Completion
Praneeth Narayanamurthy
Vahid Daneshpajooh
Namrata Vaswani
19
22
0
06 Oct 2018
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Yuejie Chi
Yue M. Lu
Yuxin Chen
39
416
0
25 Sep 2018
Modeling longitudinal data using matrix completion
Modeling longitudinal data using matrix completion
Lukasz Kidzinski
Trevor Hastie
14
1
0
24 Sep 2018
Non-Convex Matrix Completion Against a Semi-Random Adversary
Non-Convex Matrix Completion Against a Semi-Random Adversary
Yu Cheng
Rong Ge
AAML
36
24
0
28 Mar 2018
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase
  Procrustes Flow
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow
Xiao Zhang
S. Du
Quanquan Gu
26
24
0
03 Mar 2018
Static and Dynamic Robust PCA and Matrix Completion: A Review
Static and Dynamic Robust PCA and Matrix Completion: A Review
Namrata Vaswani
Praneeth Narayanamurthy
22
73
0
01 Mar 2018
Recovery of simultaneous low rank and two-way sparse coefficient
  matrices, a nonconvex approach
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
Ming Yu
Varun Gupta
Mladen Kolar
29
21
0
20 Feb 2018
Matrix Completion with Nonconvex Regularization: Spectral Operators and
  Scalable Algorithms
Matrix Completion with Nonconvex Regularization: Spectral Operators and Scalable Algorithms
Rahul Mazumder
Diego Saldana
Haolei Weng
25
13
0
24 Jan 2018
Differentially Private Matrix Completion Revisited
Differentially Private Matrix Completion Revisited
Prateek Jain
Om Thakkar
Abhradeep Thakurta
FedML
26
34
0
28 Dec 2017
Non-convex Optimization for Machine Learning
Non-convex Optimization for Machine Learning
Prateek Jain
Purushottam Kar
33
479
0
21 Dec 2017
Convolutional Phase Retrieval via Gradient Descent
Convolutional Phase Retrieval via Gradient Descent
Qing Qu
Yuqian Zhang
Yonina C. Eldar
John N. Wright
38
29
0
03 Dec 2017
Implicit Regularization in Nonconvex Statistical Estimation: Gradient
  Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind
  Deconvolution
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
Cong Ma
Kaizheng Wang
Yuejie Chi
Yuxin Chen
29
240
0
28 Nov 2017
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified
  Geometric Analysis
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
Rong Ge
Chi Jin
Yi Zheng
41
433
0
03 Apr 2017
On the Power of Truncated SVD for General High-rank Matrix Estimation
  Problems
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems
S. Du
Yining Wang
Aarti Singh
27
16
0
22 Feb 2017
A Unified Framework for Low-Rank plus Sparse Matrix Recovery
A Unified Framework for Low-Rank plus Sparse Matrix Recovery
Xiao Zhang
Lingxiao Wang
Quanquan Gu
22
10
0
21 Feb 2017
Exact tensor completion with sum-of-squares
Exact tensor completion with sum-of-squares
Aaron Potechin
David Steurer
19
80
0
21 Feb 2017
A Universal Variance Reduction-Based Catalyst for Nonconvex Low-Rank
  Matrix Recovery
A Universal Variance Reduction-Based Catalyst for Nonconvex Low-Rank Matrix Recovery
Lingxiao Wang
Xiao Zhang
Quanquan Gu
29
11
0
09 Jan 2017
Dynamic matrix recovery from incomplete observations under an exact
  low-rank constraint
Dynamic matrix recovery from incomplete observations under an exact low-rank constraint
Liangbei Xu
Mark A. Davenport
15
26
0
28 Oct 2016
Low-tubal-rank Tensor Completion using Alternating Minimization
Low-tubal-rank Tensor Completion using Alternating Minimization
Xiao-Yang Liu
Shuchin Aeron
Vaneet Aggarwal
Xiaodong Wang
22
119
0
05 Oct 2016
Tensor Graphical Model: Non-convex Optimization and Statistical
  Inference
Tensor Graphical Model: Non-convex Optimization and Statistical Inference
Xiang Lyu
W. Sun
Zhaoran Wang
Han Liu
Jian Yang
Guang Cheng
CML
18
0
0
15 Sep 2016
A Non-convex One-Pass Framework for Generalized Factorization Machine
  and Rank-One Matrix Sensing
A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing
Ming Lin
Jieping Ye
37
21
0
21 Aug 2016
Nearly-optimal Robust Matrix Completion
Nearly-optimal Robust Matrix Completion
Yeshwanth Cherapanamjeri
Kartik Gupta
Prateek Jain
41
100
0
23 Jun 2016
Finding Low-Rank Solutions via Non-Convex Matrix Factorization,
  Efficiently and Provably
Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably
Dohyung Park
Anastasios Kyrillidis
C. Caramanis
Sujay Sanghavi
17
55
0
10 Jun 2016
Provable Burer-Monteiro factorization for a class of norm-constrained
  matrix problems
Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems
Dohyung Park
Anastasios Kyrillidis
Srinadh Bhojanapalli
C. Caramanis
Sujay Sanghavi
15
22
0
04 Jun 2016
Contextual Bandits with Latent Confounders: An NMF Approach
Contextual Bandits with Latent Confounders: An NMF Approach
Rajat Sen
Karthikeyan Shanmugam
Murat Kocaoglu
A. Dimakis
Sanjay Shakkottai
13
4
0
01 Jun 2016
Matrix Completion has No Spurious Local Minimum
Matrix Completion has No Spurious Local Minimum
Rong Ge
J. Lee
Tengyu Ma
25
596
0
24 May 2016
Convergence Analysis for Rectangular Matrix Completion Using
  Burer-Monteiro Factorization and Gradient Descent
Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent
Qinqing Zheng
John D. Lafferty
34
160
0
23 May 2016
A Geometric Analysis of Phase Retrieval
A Geometric Analysis of Phase Retrieval
Ju Sun
Qing Qu
John N. Wright
34
522
0
22 Feb 2016
Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian
  Trust-region Method
Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method
Ju Sun
Qing Qu
John N. Wright
16
146
0
15 Nov 2015
Complete Dictionary Recovery over the Sphere I: Overview and the
  Geometric Picture
Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture
Ju Sun
Qing Qu
John N. Wright
32
157
0
11 Nov 2015
12
Next