Copertina

The power of small initialization in noisy low-tubal-rank tensor recovery

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, ZHiyu, Geng, Haobo, Wang, Xudong, Tang, Yandong, Han, Zhi, Wang, Yao
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

Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent
di: Liu, Zhiyu, et al.
Pubblicazione: (2025)

Efficient Low-Tubal-Rank Tensor Estimation via Alternating Preconditioned Gradient Descent
di: Liu, Zhiyu, et al.
Pubblicazione: (2025)

Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent
di: Liu, Zhiyu, et al.
Pubblicazione: (2024)

On the convergence rate of noisy Bayesian Optimization with Expected Improvement
di: Wang, Jingyi, et al.
Pubblicazione: (2025)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
di: Wang, Po-Wei, et al.
Pubblicazione: (2017)

A new perspective on low-rank optimization
di: Bertsimas, Dimitris, et al.
Pubblicazione: (2021)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
di: Lee, Ching-pei, et al.
Pubblicazione: (2022)

Sampling from Boltzmann densities with physics informed low-rank formats
di: Hagemann, Paul, et al.
Pubblicazione: (2024)

Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
di: Wang, Hao, et al.
Pubblicazione: (2024)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
di: Carpentier, Alexandra
Pubblicazione: (2024)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
di: Wang, Yi-Han, et al.
Pubblicazione: (2025)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
di: Giampouras, Paris, et al.
Pubblicazione: (2024)

Assured autonomy: How operations research powers and orchestrates generative AI systems
di: Dai, Tinglong, et al.
Pubblicazione: (2025)

On decomposability and subdifferential of the tensor nuclear norm
di: Guan, Jiewen, et al.
Pubblicazione: (2025)

Stability properties of gradient flow dynamics for the symmetric low-rank matrix factorization problem
di: Mohammadi, Hesameddin, et al.
Pubblicazione: (2024)

Nesterov acceleration despite very noisy gradients
di: Gupta, Kanan, et al.
Pubblicazione: (2023)

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

Efficient Duple Perturbation Robustness in Low-rank MDPs
di: Hu, Yang, et al.
Pubblicazione: (2024)

Online Convex Optimization with Memory and Limited Predictions
di: Wang, Zhengmiao, et al.
Pubblicazione: (2024)

Gradient descent in matrix factorization: Understanding large initialization
di: Chen, Hengchao, et al.
Pubblicazione: (2023)

Alternating minimization for generalized rank one matrix sensing: Sharp predictions from a random initialization
di: Chandrasekher, Kabir Aladin, et al.
Pubblicazione: (2022)

In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting
di: Philippenko, Constantin, et al.
Pubblicazione: (2024)

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
di: Huang, Yufan, et al.
Pubblicazione: (2024)

Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
di: Ma, Ziye, et al.
Pubblicazione: (2024)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
di: Zhang, Richard Y.
Pubblicazione: (2021)

Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?
di: Ma, Jianhao, et al.
Pubblicazione: (2023)

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

Learning to Sparsify Stochastic Linear Bandits
di: Wang, Zhengmiao, et al.
Pubblicazione: (2026)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
di: Wang, Jie, et al.
Pubblicazione: (2024)

Regularization for Adversarial Robust Learning
di: Wang, Jie, et al.
Pubblicazione: (2024)

Sinkhorn Distributionally Robust Optimization
di: Wang, Jie, et al.
Pubblicazione: (2021)

Multi-Agent Reinforcement Learning for Joint Police Patrol and Dispatch
di: Repasky, Matthew, et al.
Pubblicazione: (2024)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
di: Zhuang, Yubo, et al.
Pubblicazione: (2023)

Neural Collapse versus Low-rank Bias: Is Deep Neural Collapse Really Optimal?
di: Súkeník, Peter, et al.
Pubblicazione: (2024)

Provable Adaptivity of Adam under Non-uniform Smoothness
di: Wang, Bohan, et al.
Pubblicazione: (2022)

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

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
di: Zhang, Weitong, et al.
Pubblicazione: (2021)

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
di: Li, Bingheng, et al.
Pubblicazione: (2024)

Muon in Associative Memory Learning: Training Dynamics and Scaling Laws
di: Li, Binghui, et al.
Pubblicazione: (2026)

$\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points
di: Guan, Jiewen, et al.
Pubblicazione: (2024)