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. 1605.08370
  4. Cited By
Provable Efficient Online Matrix Completion via Non-convex Stochastic
  Gradient Descent

Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent

26 May 2016
Chi Jin
Sham Kakade
Praneeth Netrapalli
ArXivPDFHTML

Papers citing "Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent"

12 / 12 papers shown
Title
A Novel Stochastic Gradient Descent Algorithm for Learning Principal
  Subspaces
A Novel Stochastic Gradient Descent Algorithm for Learning Principal Subspaces
Charline Le Lan
Joshua Greaves
Jesse Farebrother
Mark Rowland
Fabian Pedregosa
Rishabh Agarwal
Marc G. Bellemare
52
8
0
08 Dec 2022
From Gradient Flow on Population Loss to Learning with Stochastic
  Gradient Descent
From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent
Satyen Kale
Jason D. Lee
Chris De Sa
Ayush Sekhari
Karthik Sridharan
27
4
0
13 Oct 2022
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
24
10
0
24 Aug 2022
SP2: A Second Order Stochastic Polyak Method
SP2: A Second Order Stochastic Polyak Method
Shuang Li
W. Swartworth
Martin Takávc
Deanna Needell
Robert Mansel Gower
23
13
0
17 Jul 2022
Spectral Methods for Data Science: A Statistical Perspective
Spectral Methods for Data Science: A Statistical Perspective
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
40
165
0
15 Dec 2020
Online high rank matrix completion
Online high rank matrix completion
Jicong Fan
Madeleine Udell
OffRL
29
34
0
20 Feb 2020
On the Sample Complexity and Optimization Landscape for Quadratic
  Feasibility Problems
On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems
Parth Thaker
Gautam Dasarathy
Angelia Nedić
21
5
0
04 Feb 2020
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex
  Relaxation via Nonconvex Optimization
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
Yuling Yan
17
128
0
20 Feb 2019
Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex
  Matrix Factorization
Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
Xingguo Li
Junwei Lu
R. Arora
Jarvis Haupt
Han Liu
Zhaoran Wang
T. Zhao
37
52
0
29 Dec 2016
Stochastic Heavy Ball
Stochastic Heavy Ball
S. Gadat
Fabien Panloup
Sofiane Saadane
15
103
0
14 Sep 2016
Non-square matrix sensing without spurious local minima via the
  Burer-Monteiro approach
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
Dohyung Park
Anastasios Kyrillidis
C. Caramanis
Sujay Sanghavi
17
179
0
12 Sep 2016
Median-Truncated Nonconvex Approach for Phase Retrieval with Outliers
Median-Truncated Nonconvex Approach for Phase Retrieval with Outliers
Huishuai Zhang
Yuejie Chi
Yingbin Liang
19
55
0
11 Mar 2016
1