Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Giampouras, Paris, Cai, HanQin, Vidal, Rene
Format:	Preprint
Published:	2024
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

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
by: Smith, Chandler, et al.
Published: (2024)

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

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

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations
by: Wind, Johan S.
Published: (2023)

Structured Sampling for Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2024)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2025)

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

Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?
by: Ma, Jianhao, et al.
Published: (2023)

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
by: Zhang, Richard Y.
Published: (2025)

Robust Low-rank Tensor Train Recovery
by: Qin, Zhen, et al.
Published: (2024)

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

The Stochastic Conjugate Subgradient Algorithm For Kernel Support Vector Machines
by: Zhang, Di, et al.
Published: (2024)

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

On the Benefits of Weight Normalization for Overparameterized Matrix Sensing
by: Wei, Yudong, et al.
Published: (2025)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2023)

In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting
by: Philippenko, Constantin, et al.
Published: (2024)

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

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

On the Complexity of Finding Small Subgradients in Nonsmooth Optimization
by: Kornowski, Guy, et al.
Published: (2022)

A Recovery Guarantee for Sparse Neural Networks
by: Fridovich-Keil, Sara, et al.
Published: (2025)

Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery
by: Qin, Zhen, et al.
Published: (2024)

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

Critical Influence of Overparameterization on Sharpness-aware Minimization
by: Shin, Sungbin, et al.
Published: (2023)

Untangling Lariats: Subgradient Following of Variationally Penalized Objectives
by: Mo, Kai-Chia, et al.
Published: (2024)

PolarGrad: A Class of Matrix-Gradient Optimizers from a Unifying Preconditioning Perspective
by: Lau, Tim Tsz-Kit, et al.
Published: (2025)

Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks
by: Adeoye, Adeyemi D., et al.
Published: (2024)

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
by: Li, Xiao, et al.
Published: (2023)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
by: Zhang, Siyuan, et al.
Published: (2024)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
by: Cai, HanQin, et al.
Published: (2024)

Non-Asymptotic Optimization and Generalization Bounds for Stochastic Gauss-Newton in Overparameterized Models
by: Cayci, Semih
Published: (2025)

Modified K-means Algorithm with Local Optimality Guarantees
by: Li, Mingyi, et al.
Published: (2025)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)

De-singularity Subgradient for the $q$-th-Powered $\ell_p$-Norm Weber Location Problem
by: Lai, Zhao-Rong, et al.
Published: (2024)

A Smoothing Newton Method for Rank-one Matrix Recovery
by: Maunu, Tyler, et al.
Published: (2025)

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

More is Less: Inducing Sparsity via Overparameterization
by: Chou, Hung-Hsu, et al.
Published: (2021)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)