Copertina

On the Robustness of Cross-Concentrated Sampling for Matrix Completion

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cai, HanQin, Huang, Longxiu, Kundu, Chandra, Su, Bowen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Information Theory Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

Property Inheritance for Subtensors in Tensor Train Decompositions
di: Cai, HanQin, et al.
Pubblicazione: (2025)

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

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

Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
di: Cai, HanQin, et al.
Pubblicazione: (2022)

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

Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion
di: Su, Bowen, et al.
Pubblicazione: (2024)

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
di: Smith, Chandler, et al.
Pubblicazione: (2024)

Robust Spectral Recovery for Dynamical Sampling
di: Cai, HanQin, et al.
Pubblicazione: (2026)

Randomized Space-Time Sampling for Affine Graph Dynamical Systems
di: Gong, Le, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

On the Convergence Analysis of Muon
di: Shen, Wei, et al.
Pubblicazione: (2025)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
di: Li, Gen, et al.
Pubblicazione: (2020)

Long-time dynamics and universality of nonconvex gradient descent
di: Han, Qiyang
Pubblicazione: (2025)

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

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

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

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

One-Sided Matrix Completion from Ultra-Sparse Samples
di: Zhang, Hongyang R., et al.
Pubblicazione: (2026)

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

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
di: He, Roy Y., et al.
Pubblicazione: (2024)

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

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

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
di: Ling, Shuyang
Pubblicazione: (2021)

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

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

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

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

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

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