Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery

Documenti analoghi

• Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
  di: Smith, Chandler, et al.
  Pubblicazione: (2024)
• Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
  di: Zhang, Richard Y.
  Pubblicazione: (2021)
• The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
  di: Xu, Xingyu, et al.
  Pubblicazione: (2023)
• Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
  di: Smith, Chandler, et al.
  Pubblicazione: (2025)
• On the Robustness of Cross-Concentrated Sampling for Matrix Completion
  di: Cai, HanQin, et al.
  Pubblicazione: (2024)