Image de couverture de livre

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Zhang, Richard Y.
Format:	Preprint
Publié:	2021
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
par: Giampouras, Paris, et autres
Publié: (2024)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
par: Zhang, Gavin, et autres
Publié: (2022)

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

Critical Influence of Overparameterization on Sharpness-aware Minimization
par: Shin, Sungbin, et autres
Publié: (2023)

Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery
par: Qin, Zhen, et autres
Publié: (2024)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
par: Zhou, Yuhao, et autres
Publié: (2025)

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
par: Kornowski, Guy, et autres
Publié: (2024)

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
par: Zhang, Gavin, et autres
Publié: (2025)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
par: Xiao, Nachuan, et autres
Publié: (2023)

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
par: Smith, Chandler, et autres
Publié: (2024)

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
par: Zhang, Gavin, et autres
Publié: (2023)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
par: Zhuang, Yubo, et autres
Publié: (2023)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
par: Jiang, Ruichen, et autres
Publié: (2026)

Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?
par: Ma, Jianhao, et autres
Publié: (2023)

Robust Low-rank Tensor Train Recovery
par: Qin, Zhen, et autres
Publié: (2024)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
par: Xu, Xingyu, et autres
Publié: (2023)

A Recovery Guarantee for Sparse Neural Networks
par: Fridovich-Keil, Sara, et autres
Publié: (2025)

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
par: Luo, Yuetian, et autres
Publié: (2021)

Regularized Gauss-Newton for Optimizing Overparameterized Neural Networks
par: Adeoye, Adeyemi D., et autres
Publié: (2024)

Implicit Regularization Makes Overparameterized Asymmetric Matrix Sensing Robust to Perturbations
par: Wind, Johan S.
Publié: (2023)

On the Benefits of Weight Normalization for Overparameterized Matrix Sensing
par: Wei, Yudong, et autres
Publié: (2025)

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

Federated Dynamical Low-Rank Training with Global Loss Convergence Guarantees
par: Schotthöfer, Steffen, et autres
Publié: (2024)

Deterministic Nonsmooth Nonconvex Optimization
par: Jordan, Michael I., et autres
Publié: (2023)

Decentralized Sum-of-Nonconvex Optimization
par: Liu, Zhuanghua, et autres
Publié: (2024)

More is Less: Inducing Sparsity via Overparameterization
par: Chou, Hung-Hsu, et autres
Publié: (2021)

Learning Neural Contracting Dynamics: Extended Linearization and Global Guarantees
par: Jaffe, Sean, et autres
Publié: (2024)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
par: Agafonov, Artem, et autres
Publié: (2025)

Global Convergence of Iteratively Reweighted Least Squares for Robust Subspace Recovery
par: Lerman, Gilad, et autres
Publié: (2025)

Proximal Operators of Sorted Nonconvex Penalties
par: Gagneux, Anne, et autres
Publié: (2025)

Efficient Duple Perturbation Robustness in Low-rank MDPs
par: Hu, Yang, et autres
Publié: (2024)

Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
par: Chen, Chuyan, et autres
Publié: (2025)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
par: Zhang, Siyuan, et autres
Publié: (2024)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
par: Mafakheri, Behnam, et autres
Publié: (2025)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
par: Zhou, Dongruo, et autres
Publié: (2018)

Online Nonconvex Bilevel Optimization with Bregman Divergences
par: Bohne, Jason, et autres
Publié: (2024)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
par: Yang, Junnan, et autres
Publié: (2024)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
par: Huang, Ruichuan, et autres
Publié: (2025)

Parametric Nonconvex Optimization via Convex Surrogates
par: Wang, Renzi, et autres
Publié: (2026)