Image de couverture de livre

One-Sided Matrix Completion from Ultra-Sparse Samples

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Hongyang R., Zhang, Zhenshuo, Nguyen, Huy L., Lan, Guanghui
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
par: Ji, Yao, et autres
Publié: (2026)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
par: Lan, Guanghui, et autres
Publié: (2024)

A simple uniformly optimal method without line search for convex optimization
par: Li, Tianjiao, et autres
Publié: (2023)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
par: Cai, HanQin, et autres
Publié: (2024)

WinQ: Accelerating Quantization-Aware Training of Language Models Around Saddle Points
par: Li, Dongyue, et autres
Publié: (2026)

Value Mirror Descent for Reinforcement Learning
par: Jia, Zhichao, et autres
Publié: (2026)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
par: Lan, Guanghui, et autres
Publié: (2024)

Can SGD Handle Heavy-Tailed Noise?
par: Fatkhullin, Ilyas, et autres
Publié: (2025)

Stochastic first-order methods for average-reward Markov decision processes
par: Li, Tianjiao, et autres
Publié: (2022)

Machine Learning Model for Sparse PCM Completion
par: Koyuncu, Selcuk, et autres
Publié: (2026)

Convergence Rate Analysis of the AdamW-Style Shampoo: Unifying One-Sided and Two-Sided Preconditioning
par: Li, Huan, et autres
Publié: (2026)

Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion
par: Ma, Jianhao, et autres
Publié: (2024)

Majorization-minimization for Sparse Nonnegative Matrix Factorization with the $β$-divergence
par: Marmin, Arthur, et autres
Publié: (2022)

Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
par: Wang, Yao, et autres
Publié: (2025)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
par: Bertsimas, Dimitris, et autres
Publié: (2023)

Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control
par: Cheng, Yi, et autres
Publié: (2022)

Stochastic Constrained Decentralized Optimization for Machine Learning with Fewer Data Oracles: a Gradient Sliding Approach
par: Nguyen, Hoang Huy, et autres
Publié: (2024)

Learning Large Causal Structures from Inverse Covariance Matrix via Sparse Matrix Decomposition
par: Dong, Shuyu, et autres
Publié: (2022)

Accelerated stochastic approximation with state-dependent noise
par: Ilandarideva, Sasila, et autres
Publié: (2023)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
par: Selicato, Laura, et autres
Publié: (2025)

SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery
par: Zhang, Yanhao, et autres
Publié: (2025)

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

DNNLasso: Scalable Graph Learning for Matrix-Variate Data
par: Lin, Meixia, et autres
Publié: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

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

Block Sparse Bayesian Learning: A Diversified Scheme
par: Zhang, Yanhao, et autres
Publié: (2024)

A Global Optimization Algorithm for K-Center Clustering of One Billion Samples
par: Ren, Jiayang, et autres
Publié: (2022)

Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees
par: Nguyen, Thien Hang, et autres
Publié: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
par: Gu, Yuzhou, et autres
Publié: (2023)

Fast and Effective Computation of Generalized Symmetric Matrix Factorization
par: Yang, Lei, et autres
Publié: (2026)

Controllable Expensive Multi-objective Learning with Warm-starting Bayesian Optimization
par: Nguyen, Quang-Huy, et autres
Publié: (2023)

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

Enhancing Accuracy in Deep Learning Using Random Matrix Theory
par: Berlyand, Leonid, et autres
Publié: (2023)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
par: Meinhardt, Georg, et autres
Publié: (2024)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
par: Li, Muheng, et autres
Publié: (2025)

Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
par: Feng, Lechen, et autres
Publié: (2024)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
par: Smith, Chandler, et autres
Publié: (2025)

Epsilon-Greedy Thompson Sampling to Bayesian Optimization
par: Do, Bach, et autres
Publié: (2024)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
par: Zhang, Hongyang R., et autres
Publié: (2023)

Gaussian Process Thompson Sampling via Rootfinding
par: Adebiyi, Taiwo A., et autres
Publié: (2024)