Saved in:
| Main Authors: | Zhang, Yanhao, Zhu, Zhihan, Xia, Yong |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.08518 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Block Sparse Bayesian Learning: A Diversified Scheme
by: Zhang, Yanhao, et al.
Published: (2024)
by: Zhang, Yanhao, et al.
Published: (2024)
From Generality to Specificity: Prior-Driven Optimal Sparse Transformation in Compressed Sensing
by: Zhu, Zhihan, et al.
Published: (2025)
by: Zhu, Zhihan, et al.
Published: (2025)
Efficient Sparse PCA via Block-Diagonalization
by: Del Pia, Alberto, et al.
Published: (2024)
by: Del Pia, Alberto, et al.
Published: (2024)
Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination
by: Zhu, Zhihan, et al.
Published: (2025)
by: Zhu, Zhihan, et al.
Published: (2025)
Subgradient Gliding Method for Nonsmooth Convex Optimization
by: Zhu, Zhihan, et al.
Published: (2026)
by: Zhu, Zhihan, et al.
Published: (2026)
A Recovery Guarantee for Sparse Neural Networks
by: Fridovich-Keil, Sara, et al.
Published: (2025)
by: Fridovich-Keil, Sara, et al.
Published: (2025)
Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
by: Meinhardt, Georg, et al.
Published: (2024)
by: Meinhardt, Georg, et al.
Published: (2024)
Sparse Transformer Architectures via Regularized Wasserstein Proximal Operator with $L_1$ Prior
by: Han, Fuqun, et al.
Published: (2025)
by: Han, Fuqun, et al.
Published: (2025)
Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)
by: Xia, Yong, et al.
Published: (2024)
Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)
by: Zhu, Zhihan, et al.
Published: (2024)
Incremental Learning of Sparse Attention Patterns in Transformers
by: Yüksel, Oğuz Kaan, et al.
Published: (2026)
by: Yüksel, Oğuz Kaan, et al.
Published: (2026)
Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)
by: Bergamaschi, Matteo, et al.
Published: (2024)
Machine Learning Model for Sparse PCM Completion
by: Koyuncu, Selcuk, et al.
Published: (2026)
by: Koyuncu, Selcuk, et al.
Published: (2026)
Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
by: de Vazelhes, William, et al.
Published: (2023)
by: de Vazelhes, William, et al.
Published: (2023)
Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)
by: Mukhopadhyay, Samrat, et al.
Published: (2025)
First-Order Sparse Convex Optimization: Better Rates with Sparse Updates
by: Garber, Dan
Published: (2025)
by: Garber, Dan
Published: (2025)
Sparse Deep Learning Models with the $\ell_1$ Regularization
by: Shen, Lixin, et al.
Published: (2024)
by: Shen, Lixin, et al.
Published: (2024)
Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
by: He, Roy Y., et al.
Published: (2024)
by: He, Roy Y., et al.
Published: (2024)
Straight-Through meets Sparse Recovery: the Support Exploration Algorithm
by: Mohamed, Mimoun, et al.
Published: (2023)
by: Mohamed, Mimoun, et al.
Published: (2023)
One-Sided Matrix Completion from Ultra-Sparse Samples
by: Zhang, Hongyang R., et al.
Published: (2026)
by: Zhang, Hongyang R., et al.
Published: (2026)
Bi-Sparse Unsupervised Feature Selection
by: Xiu, Xianchao, et al.
Published: (2024)
by: Xiu, Xianchao, et al.
Published: (2024)
Differentially Private Optimization with Sparse Gradients
by: Ghazi, Badih, et al.
Published: (2024)
by: Ghazi, Badih, et al.
Published: (2024)
Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
by: Bayramoğlu, Selin, et al.
Published: (2026)
by: Bayramoğlu, Selin, et al.
Published: (2026)
Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
by: Tang, Xun, et al.
Published: (2024)
by: Tang, Xun, et al.
Published: (2024)
Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties
by: Yang, Kai, et al.
Published: (2020)
by: Yang, Kai, et al.
Published: (2020)
Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
by: Feng, Lechen, et al.
Published: (2024)
by: Feng, Lechen, et al.
Published: (2024)
Dynamics of Stochastic Momentum with Sparse Updates in High Dimensions
by: Everett, Katie, et al.
Published: (2026)
by: Everett, Katie, et al.
Published: (2026)
Sparse Graphical Linear Dynamical Systems
by: Chouzenoux, Emilie, et al.
Published: (2023)
by: Chouzenoux, Emilie, et al.
Published: (2023)
A Recovery Theory for Diffusion Priors: Deterministic Analysis of the Implicit Prior Algorithm
by: Leong, Oscar, et al.
Published: (2025)
by: Leong, Oscar, et al.
Published: (2025)
Federated Structured Sparse PCA for Anomaly Detection in IoT Networks
by: Huang, Chenyi, et al.
Published: (2025)
by: Huang, Chenyi, et al.
Published: (2025)
PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)
by: Wu, Di, et al.
Published: (2025)
Solving Sparse \& High-Dimensional-Output Regression via Compression
by: Li, Renyuan, et al.
Published: (2024)
by: Li, Renyuan, et al.
Published: (2024)
Majorization-minimization for Sparse Nonnegative Matrix Factorization with the $β$-divergence
by: Marmin, Arthur, et al.
Published: (2022)
by: Marmin, Arthur, et al.
Published: (2022)
Locally Regularized Sparse Graph by Fast Proximal Gradient Descent
by: Sun, Dongfang, et al.
Published: (2024)
by: Sun, Dongfang, et al.
Published: (2024)
Sparse PCA With Multiple Components
by: Cory-Wright, Ryan, et al.
Published: (2022)
by: Cory-Wright, Ryan, et al.
Published: (2022)
Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)
by: Cory-Wright, Ryan, et al.
Published: (2023)
Multi-Objective Optimization for Sparse Deep Multi-Task Learning
by: Hotegni, S. S., et al.
Published: (2023)
by: Hotegni, S. S., et al.
Published: (2023)
Scalable First-order Method for Certifying Optimal k-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2025)
by: Liu, Jiachang, et al.
Published: (2025)
A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)
by: Del Pia, Alberto, et al.
Published: (2025)
Sparse Polyak with optimal thresholding operators for high-dimensional M-estimation
by: Qiao, Tianqi, et al.
Published: (2025)
by: Qiao, Tianqi, et al.
Published: (2025)
Similar Items
-
Block Sparse Bayesian Learning: A Diversified Scheme
by: Zhang, Yanhao, et al.
Published: (2024) -
From Generality to Specificity: Prior-Driven Optimal Sparse Transformation in Compressed Sensing
by: Zhu, Zhihan, et al.
Published: (2025) -
Efficient Sparse PCA via Block-Diagonalization
by: Del Pia, Alberto, et al.
Published: (2024) -
Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination
by: Zhu, Zhihan, et al.
Published: (2025) -
Subgradient Gliding Method for Nonsmooth Convex Optimization
by: Zhu, Zhihan, et al.
Published: (2026)