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. 2008.04988
  4. Cited By
Asymptotic Convergence Rate of Alternating Minimization for Rank One
  Matrix Completion

Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion

11 August 2020
Rui Liu
Alexander Olshevsky
ArXivPDFHTML

Papers citing "Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion"

5 / 5 papers shown
Title
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced
  Aggregation of Sparsely Interacting Workers
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers
Yao Ma
Alexander Olshevsky
Venkatesh Saligrama
Csaba Szepesvári
32
25
0
25 Apr 2019
Exact Guarantees on the Absence of Spurious Local Minima for
  Non-negative Rank-1 Robust Principal Component Analysis
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis
Salar Fattahi
Somayeh Sojoudi
36
38
0
30 Dec 2018
A Note on Alternating Minimization Algorithm for the Matrix Completion
  Problem
A Note on Alternating Minimization Algorithm for the Matrix Completion Problem
D. Gamarnik
Sidhant Misra
36
18
0
05 Feb 2016
Low-rank Matrix Completion using Alternating Minimization
Low-rank Matrix Completion using Alternating Minimization
Prateek Jain
Praneeth Netrapalli
Sujay Sanghavi
114
1,066
0
03 Dec 2012
Matrix Completion from a Few Entries
Matrix Completion from a Few Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
164
1,242
0
20 Jan 2009
1