Image de couverture de livre

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	He, Roy Y., Liu, Haixia, Liu, Hao
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Convergence Analysis of Muon
par: Shen, Wei, et autres
Publié: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
par: Liu, Yujie, et autres
Publié: (2025)

Convergence of linear programming hierarchies for Gibbs states of spin systems
par: Fawzi, Hamza, et autres
Publié: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
par: Zurek, Matthew, et autres
Publié: (2024)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
par: Aolaritei, Liviu, et autres
Publié: (2022)

Accelerating Convergence of Score-Based Diffusion Models, Provably
par: Li, Gen, et autres
Publié: (2024)

Subspace Optimization for Large Language Models with Convergence Guarantees
par: He, Yutong, et autres
Publié: (2024)

Demystifying Why Local Aggregation Helps: Convergence Analysis of Hierarchical SGD
par: Wang, Jiayi, et autres
Publié: (2020)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
par: Li, Gen, et autres
Publié: (2021)

Linear Convergence in Hilbert's Projective Metric for Computing Augustin Information and a Rényi Information Measure
par: Tsai, Chung-En, et autres
Publié: (2024)

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

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2024)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
par: Yu, Qian, et autres
Publié: (2024)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
par: Beyler, Eliot, et autres
Publié: (2024)

Structured Sampling for Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2024)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
par: Cui, Chengyu, et autres
Publié: (2026)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
par: Matt, Hannes, et autres
Publié: (2025)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
par: Kümmerle, Christian, et autres
Publié: (2023)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
par: Ling, Shuyang
Publié: (2021)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
par: Foss, Mikil, et autres
Publié: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
par: Shen, Wei, et autres
Publié: (2023)

Tight Regret Bounds for Bayesian Optimization in One Dimension
par: Scarlett, Jonathan
Publié: (2018)

Span-Based Optimal Sample Complexity for Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2023)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
par: Kundu, Chandra, et autres
Publié: (2025)

The augmented NLP bound for maximum-entropy remote sampling
par: Ponte, Gabriel, et autres
Publié: (2026)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
par: Shen, Wei, et autres
Publié: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
par: Zurek, Matthew, et autres
Publié: (2025)

More is Less: Inducing Sparsity via Overparameterization
par: Chou, Hung-Hsu, et autres
Publié: (2021)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
par: Tong, Xindi, et autres
Publié: (2026)

Geometry, Computation, and Optimality in Stochastic Optimization
par: Cheng, Chen, et autres
Publié: (2019)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
par: Zurek, Matthew, et autres
Publié: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
par: Shen, Wei, et autres
Publié: (2025)

Decentralized Sparse Linear Regression via Gradient-Tracking: Linear Convergence and Statistical Guarantees
par: Maros, Marie, et autres
Publié: (2022)

ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations
par: Gao, Yihang, et autres
Publié: (2026)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
par: Gao, Yihang, et autres
Publié: (2025)

Capabilities and Fundamental Limits of Latent Chain-of-Thought
par: Zou, Jiaxuan, et autres
Publié: (2026)

Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces
par: Duan, Yaqi, et autres
Publié: (2024)

On Unbiased Parameter Estimation and Signal Reconstruction
par: Lahtinen, Joonas
Publié: (2026)

Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics
par: Ang, Andersen, et autres
Publié: (2021)