Cover Image

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Gavin, Chiu, Hong-Ming, Zhang, Richard Y.
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
by: Zhang, Gavin, et al.
Published: (2025)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
by: Zhang, Gavin, et al.
Published: (2022)

Efficient Low-Tubal-Rank Tensor Estimation via Alternating Preconditioned Gradient Descent
by: Liu, Zhiyu, et al.
Published: (2025)

Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent
by: Liu, Zhiyu, et al.
Published: (2025)

Well-conditioned Primal-Dual Interior-point Method for Accurate Low-rank Semidefinite Programming
by: Chiu, Hong-Ming, et al.
Published: (2024)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
by: Bonet, Clément, et al.
Published: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation
by: Zhang, Teng, et al.
Published: (2024)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
by: Köhne, Frederik, et al.
Published: (2023)

Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent
by: Liu, Zhiyu, et al.
Published: (2024)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
by: Zhang, Richard Y.
Published: (2021)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
by: Zheng, Yuping, et al.
Published: (2025)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures
by: De Castro, Yohann, et al.
Published: (2023)

Unraveling the Gradient Descent Dynamics of Transformers
by: Song, Bingqing, et al.
Published: (2024)

On Convergence of the Iteratively Preconditioned Gradient-Descent (IPG) Observer
by: Chakrabarti, Kushal, et al.
Published: (2024)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
by: Zhang, Richard Y.
Published: (2022)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
by: Bian, Fengmiao, et al.
Published: (2025)

Anytime Acceleration of Gradient Descent
by: Zhang, Zihan, et al.
Published: (2024)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

Riemannian Optimization for Hadamard Products of Low-Rank Matrices
by: Jawanpuria, Pratik, et al.
Published: (2026)

Model Predictive Path Integral Control as Preconditioned Gradient Descent
by: Fazlyab, Mahyar, et al.
Published: (2026)

Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization
by: Cai, Yuhang, et al.
Published: (2024)

Locally Regularized Sparse Graph by Fast Proximal Gradient Descent
by: Sun, Dongfang, et al.
Published: (2024)

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
by: Cai, HanQin, et al.
Published: (2022)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

A Single-Mode Quasi Riemannian Gradient Descent Algorithm for Low-Rank Tensor Recovery
by: Zhang, Yuanwei, et al.
Published: (2024)

Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators
by: Li, Tianyou, et al.
Published: (2023)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

Non-Euclidean Gradient Descent Operates at the Edge of Stability
by: Islamov, Rustem, et al.
Published: (2026)

Learning Provably Improves the Convergence of Gradient Descent
by: Song, Qingyu, et al.
Published: (2025)

Stochastic Gradient Descent in Non-Convex Problems: Asymptotic Convergence with Relaxed Step-Size via Stopping Time Methods
by: Jin, Ruinan, et al.
Published: (2025)

LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
by: Mirzabeigi, Elmira, et al.
Published: (2025)

Implicit Bias of Gradient Descent for Non-Homogeneous Deep Networks
by: Cai, Yuhang, et al.
Published: (2025)

Unbiased Gradient Low-Rank Projection
by: Pan, Rui, et al.
Published: (2025)

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent
by: Sun, Yihang, et al.
Published: (2026)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)