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. 2407.19446
  4. Cited By
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

28 July 2024
Tianming Wang
Ke Wei
ArXivPDFHTML

Papers citing "Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions"

15 / 15 papers shown
Title
Bridging Convex and Nonconvex Optimization in Robust PCA: Noise,
  Outliers, and Missing Data
Bridging Convex and Nonconvex Optimization in Robust PCA: Noise, Outliers, and Missing Data
Yuxin Chen
Jianqing Fan
Cong Ma
Yuling Yan
57
52
0
15 Jan 2020
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
90
240
0
28 Nov 2017
Accelerated Alternating Projections for Robust Principal Component
  Analysis
Accelerated Alternating Projections for Robust Principal Component Analysis
HanQin Cai
Jian-Feng Cai
Ke Wei
56
67
0
15 Nov 2017
Model-free Nonconvex Matrix Completion: Local Minima Analysis and
  Applications in Memory-efficient Kernel PCA
Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA
Ji Chen
Xiaodong Li
64
27
0
06 Nov 2017
Entrywise Eigenvector Analysis of Random Matrices with Low Expected Rank
Entrywise Eigenvector Analysis of Random Matrices with Low Expected Rank
Emmanuel Abbe
Jianqing Fan
Kaizheng Wang
Yiqiao Zhong
100
250
0
27 Sep 2017
Nearly-optimal Robust Matrix Completion
Nearly-optimal Robust Matrix Completion
Yeshwanth Cherapanamjeri
Kartik Gupta
Prateek Jain
64
100
0
23 Jun 2016
Fast Algorithms for Robust PCA via Gradient Descent
Fast Algorithms for Robust PCA via Gradient Descent
Xinyang Yi
Dohyung Park
Yudong Chen
Constantine Caramanis
86
267
0
25 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
73
160
0
23 May 2016
De-biasing the Lasso: Optimal Sample Size for Gaussian Designs
De-biasing the Lasso: Optimal Sample Size for Gaussian Designs
Adel Javanmard
Andrea Montanari
104
196
0
11 Aug 2015
Fast Exact Matrix Completion with Finite Samples
Fast Exact Matrix Completion with Finite Samples
Prateek Jain
Praneeth Netrapalli
82
92
0
04 Nov 2014
Fast matrix completion without the condition number
Fast matrix completion without the condition number
Moritz Hardt
Mary Wootters
94
107
0
15 Jul 2014
Incoherence-Optimal Matrix Completion
Incoherence-Optimal Matrix Completion
Yudong Chen
101
205
0
01 Oct 2013
Robust Spectral Compressed Sensing via Structured Matrix Completion
Robust Spectral Compressed Sensing via Structured Matrix Completion
Yuxin Chen
Yuejie Chi
88
269
0
30 Apr 2013
A Riemannian geometry for low-rank matrix completion
A Riemannian geometry for low-rank matrix completion
Bamdev Mishra
K. A. Apuroop
R. Sepulchre
78
68
0
07 Nov 2012
Guaranteed Rank Minimization via Singular Value Projection
Guaranteed Rank Minimization via Singular Value Projection
Raghu Meka
Prateek Jain
Inderjit S. Dhillon
181
553
0
30 Sep 2009
1