Cover Image

Scaled Gradient Descent for Ill-Conditioned Low-Rank Matrix Recovery with Optimal Sampling Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Zhenxuan, Huang, Meng
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Guaranteed Nonconvex Low-Rank Tensor Estimation via Scaled Gradient Descent
by: Wu, Tong
Published: (2025)

Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
by: Kim, Daesung, et al.
Published: (2022)

Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion
by: Zhang, Xu, et al.
Published: (2025)

How Transformers Learn Causal Structure with Gradient Descent
by: Nichani, Eshaan, et al.
Published: (2024)

On the Theory of Continual Learning with Gradient Descent for Neural Networks
by: Taheri, Hossein, et al.
Published: (2025)

Gradient Descent Finds Over-Parameterized Neural Networks with Sharp Generalization for Nonparametric Regression
by: Yang, Yingzhen, et al.
Published: (2024)

Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix
by: Huang, Gao, et al.
Published: (2024)

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

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
by: Wang, Shuche, et al.
Published: (2024)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

Efficient Wireless Federated Learning via Low-Rank Gradient Factorization
by: Guo, Mingzhao, et al.
Published: (2024)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Order-Optimal Sample Complexity of Rectified Flows
by: Sahoo, Hari Krishna, et al.
Published: (2026)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Non-Coherent Over-the-Air Decentralized Gradient Descent
by: Michelusi, Nicolo'
Published: (2022)

Why Does Stochastic Gradient Descent Slow Down in Low-Precision Training?
by: Yun, Vincent-Daniel
Published: (2025)

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

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

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
by: Aiyer, Shashaank, et al.
Published: (2026)

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
by: Chaabouni, Youssef, et al.
Published: (2026)

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
by: Chaabouni, Youssef, et al.
Published: (2025)

Theoretical Guarantees for Low-Rank Compression of Deep Neural Networks
by: Zhang, Shihao, et al.
Published: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

Byzantine-Resilient Federated PCA and Low Rank Column-wise Sensing
by: Singh, Ankit Pratap, et al.
Published: (2023)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

Information-Theoretic Guarantees for Recovering Low-Rank Tensors from Symmetric Rank-One Measurements
by: Kızıldağ, Eren C.
Published: (2025)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
by: Yang, Tong, et al.
Published: (2025)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
by: Chen, Haohua, et al.
Published: (2025)

Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery
by: Kovačević, Filip, et al.
Published: (2025)

Age Optimal Sampling for Unreliable Channels under Unknown Channel Statistics
by: He, Hongyi, et al.
Published: (2024)

Unified Error Correction Code Transformer with Low Complexity
by: Yan, Yongli, et al.
Published: (2024)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

On the Performance of Amplitude-Based Models for Low-Rank Matrix Recovery
by: Ge, Huanmin, et al.
Published: (2025)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)