ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.01849
  4. Cited By
Rank $2r$ iterative least squares: efficient recovery of ill-conditioned
  low rank matrices from few entries
v1v2 (latest)

Rank 2r2r2r iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries

SIAM Journal on Mathematics of Data Science (SIMODS), 2020
5 February 2020
Jonathan Bauch
B. Nadler
Pini Zilber
ArXiv (abs)PDFHTML

Papers citing "Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries"

12 / 12 papers shown
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
Eilon Vaknin Laufer
Boaz Nadler
341
1
0
19 May 2025
Truncated Matrix Completion - An Empirical Study
Truncated Matrix Completion - An Empirical StudyEuropean Signal Processing Conference (EUSIPCO), 2022
Rishhabh Naik
Nisarg Trivedi
Davoud Ataee Tarzanagh
Laura Balzano
381
3
0
14 Apr 2025
Sample-Efficient Geometry Reconstruction from Euclidean Distances using
  Non-Convex Optimization
Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex OptimizationNeural Information Processing Systems (NeurIPS), 2024
Ipsita Ghosh
Abiy Tasissa
Christian Kümmerle
238
4
0
22 Oct 2024
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix
  Completion
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix CompletionJournal of Computational And Graphical Statistics (JCGS), 2023
Xiaoqian Liu
Xu Han
Eric C. Chi
B. Nadler
261
0
0
27 Apr 2023
Learning Transition Operators From Sparse Space-Time Samples
Learning Transition Operators From Sparse Space-Time SamplesIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2022
C. Kümmerle
Mauro Maggioni
Sui Tang
155
1
0
01 Dec 2022
Over-Parametrized Matrix Factorization in the Presence of Spurious
  Stationary Points
Over-Parametrized Matrix Factorization in the Presence of Spurious Stationary PointsIEEE Transactions on Signal Processing (IEEE TSP), 2021
Armin Eftekhari
154
1
0
25 Dec 2021
Nonconvex Factorization and Manifold Formulations are Almost Equivalent
  in Low-rank Matrix Optimization
Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
Yuetian Luo
Xudong Li
Anru R. Zhang
324
11
0
03 Aug 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
607
19
0
24 Jun 2021
A Scalable Second Order Method for Ill-Conditioned Matrix Completion
  from Few Samples
A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few SamplesInternational Conference on Machine Learning (ICML), 2021
C. Kümmerle
C. M. Verdun
202
25
0
03 Jun 2021
Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical
  Optimality and Second-Order Convergence
Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order ConvergenceJournal of machine learning research (JMLR), 2021
Yuetian Luo
Anru R. Zhang
458
25
0
24 Apr 2021
Recursive Importance Sketching for Rank Constrained Least Squares:
  Algorithms and High-order Convergence
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order ConvergenceOperational Research (OR), 2020
Yuetian Luo
Wen Huang
Xudong Li
Anru R. Zhang
494
17
0
17 Nov 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
213
6
0
07 Sep 2020
1
Page 1 of 1