Copertina

One-Sided Matrix Completion from Ultra-Sparse Samples

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhang, Hongyang R., Zhang, Zhenshuo, Nguyen, Huy L., Lan, Guanghui
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
di: Ji, Yao, et al.
Pubblicazione: (2026)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
di: Lan, Guanghui, et al.
Pubblicazione: (2024)

A simple uniformly optimal method without line search for convex optimization
di: Li, Tianjiao, et al.
Pubblicazione: (2023)

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

WinQ: Accelerating Quantization-Aware Training of Language Models Around Saddle Points
di: Li, Dongyue, et al.
Pubblicazione: (2026)

Value Mirror Descent for Reinforcement Learning
di: Jia, Zhichao, et al.
Pubblicazione: (2026)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
di: Lan, Guanghui, et al.
Pubblicazione: (2024)

Can SGD Handle Heavy-Tailed Noise?
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Stochastic first-order methods for average-reward Markov decision processes
di: Li, Tianjiao, et al.
Pubblicazione: (2022)

Machine Learning Model for Sparse PCM Completion
di: Koyuncu, Selcuk, et al.
Pubblicazione: (2026)

Convergence Rate Analysis of the AdamW-Style Shampoo: Unifying One-Sided and Two-Sided Preconditioning
di: Li, Huan, et al.
Pubblicazione: (2026)

Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion
di: Ma, Jianhao, et al.
Pubblicazione: (2024)

Majorization-minimization for Sparse Nonnegative Matrix Factorization with the $β$-divergence
di: Marmin, Arthur, et al.
Pubblicazione: (2022)

Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
di: Wang, Yao, et al.
Pubblicazione: (2025)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
di: Bertsimas, Dimitris, et al.
Pubblicazione: (2023)

Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control
di: Cheng, Yi, et al.
Pubblicazione: (2022)

Stochastic Constrained Decentralized Optimization for Machine Learning with Fewer Data Oracles: a Gradient Sliding Approach
di: Nguyen, Hoang Huy, et al.
Pubblicazione: (2024)

Learning Large Causal Structures from Inverse Covariance Matrix via Sparse Matrix Decomposition
di: Dong, Shuyu, et al.
Pubblicazione: (2022)

Accelerated stochastic approximation with state-dependent noise
di: Ilandarideva, Sasila, et al.
Pubblicazione: (2023)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
di: Selicato, Laura, et al.
Pubblicazione: (2025)

SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery
di: Zhang, Yanhao, et al.
Pubblicazione: (2025)

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

DNNLasso: Scalable Graph Learning for Matrix-Variate Data
di: Lin, Meixia, et al.
Pubblicazione: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
di: Zhang, Lijun, et al.
Pubblicazione: (2021)

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

Block Sparse Bayesian Learning: A Diversified Scheme
di: Zhang, Yanhao, et al.
Pubblicazione: (2024)

A Global Optimization Algorithm for K-Center Clustering of One Billion Samples
di: Ren, Jiayang, et al.
Pubblicazione: (2022)

Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees
di: Nguyen, Thien Hang, et al.
Pubblicazione: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
di: Gu, Yuzhou, et al.
Pubblicazione: (2023)

Fast and Effective Computation of Generalized Symmetric Matrix Factorization
di: Yang, Lei, et al.
Pubblicazione: (2026)

Controllable Expensive Multi-objective Learning with Warm-starting Bayesian Optimization
di: Nguyen, Quang-Huy, et al.
Pubblicazione: (2023)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
di: Yang, Junnan, et al.
Pubblicazione: (2024)

Enhancing Accuracy in Deep Learning Using Random Matrix Theory
di: Berlyand, Leonid, et al.
Pubblicazione: (2023)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
di: Meinhardt, Georg, et al.
Pubblicazione: (2024)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
di: Li, Muheng, et al.
Pubblicazione: (2025)

Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
di: Feng, Lechen, et al.
Pubblicazione: (2024)

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

Epsilon-Greedy Thompson Sampling to Bayesian Optimization
di: Do, Bach, et al.
Pubblicazione: (2024)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
di: Zhang, Hongyang R., et al.
Pubblicazione: (2023)

Gaussian Process Thompson Sampling via Rootfinding
di: Adebiyi, Taiwo A., et al.
Pubblicazione: (2024)