Cover Image

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cui, Chengyu, Xu, Gongjun
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Information Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
by: Luo, Yuetian, et al.
Published: (2021)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
by: Gao, Yihang, et al.
Published: (2025)

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

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
by: Kümmerle, Christian, et al.
Published: (2023)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations
by: Gao, Yihang, et al.
Published: (2026)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
by: Shen, Wei, et al.
Published: (2025)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
by: Foss, Mikil, et al.
Published: (2025)

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

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

Multidimensional Gradient-MUSIC: A Global Nonconvex Optimization Framework for Optimal Resolution
by: Fannjiang, Albert, et al.
Published: (2026)

Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation
by: Sokolov, Igor, et al.
Published: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Sets
by: Xu, Haonan, et al.
Published: (2024)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Symmetric Rank-One Quasi-Newton Methods for Deep Learning Using Cubic Regularization
by: Ranganath, Aditya, et al.
Published: (2025)

Comparing Few to Rank Many: Active Human Preference Learning using Randomized Frank-Wolfe
by: Thekumparampil, Kiran Koshy, et al.
Published: (2024)

Heaviside Low-Rank Support Matrix Machine
by: Xiu, Xianchao, et al.
Published: (2026)

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

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

On Convex Data-Driven Inverse Optimal Control for Nonlinear, Non-stationary and Stochastic Systems
by: Garrabe, Emiland, et al.
Published: (2023)

Dynamic Topic Analysis in Academic Journals using Convex Non-negative Matrix Factorization Method
by: Yang, Yang, et al.
Published: (2025)

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
by: Agterberg, Joshua, et al.
Published: (2025)

Low-Rank Thinning
by: Carrell, Annabelle Michael, et al.
Published: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

The augmented NLP bound for maximum-entropy remote sampling
by: Ponte, Gabriel, et al.
Published: (2026)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
by: Tong, Xindi, et al.
Published: (2026)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
by: Matt, Hannes, et al.
Published: (2025)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

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

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

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

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

Variational Inference on the Boolean Hypercube with the Quantum Entropy
by: Beyler, Eliot, et al.
Published: (2024)

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

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

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

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