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. 1102.2254
  4. Cited By
Matrix completion with column manipulation: Near-optimal
  sample-robustness-rank tradeoffs

Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs

10 February 2011
Yudong Chen
Huan Xu
C. Caramanis
Sujay Sanghavi
ArXivPDFHTML

Papers citing "Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs"

3 / 3 papers shown
Title
Smooth Robust Tensor Completion for Background/Foreground Separation
  with Missing Pixels: Novel Algorithm with Convergence Guarantee
Smooth Robust Tensor Completion for Background/Foreground Separation with Missing Pixels: Novel Algorithm with Convergence Guarantee
Bo Shen
Weijun Xie
Zhen Kong
37
8
0
29 Mar 2022
Non-convex Optimization for Machine Learning
Non-convex Optimization for Machine Learning
Prateek Jain
Purushottam Kar
33
478
0
21 Dec 2017
Thresholding based Efficient Outlier Robust PCA
Thresholding based Efficient Outlier Robust PCA
Yeshwanth Cherapanamjeri
Prateek Jain
Praneeth Netrapalli
22
15
0
18 Feb 2017
1