No article text was recorded for this version.
iterative hard thresholding (sparsity-constrained projection)
Version 1 of 127 papers29 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Hard-Thresholding Meets Evolution Strategies in Reinforcement Learning
- Blog: Gradient Hard Thresholding Pursuit
- Blog: Stability and Risk Bounds of Iterative Hard Thresholding
- Blog: Smoothing Proximal Gradient Methods for Nonsmooth Sparsity Constrained Optimization: Optimality Conditions and Global Convergence
- Blog: Sparse Regression with $\ell_0$ Constraints for $\alpha$-Mixing Time Series: Algorithms and Guarantees
- Blog: New Insight of Variance reduce in Zero-Order Hard-Thresholding: Mitigating Gradient Error and Expansivity Contradictions
- Blog: Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
- Blog: σ-zero: Gradient-based Optimization of ℓ0-norm Adversarial Examples
- Blog: Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
- Blog: AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks
- Blog: On The Projection Operator to A Three-view Cardinality Constrained Set
- Blog: Online Wideband Spectrum Sensing Using Sparsity
- Blog: <formula formulatype="inline"><tex Notation="TeX">$l_{0}$</tex></formula> Sparse Inverse Covariance Estimation
- Blog: Coherence Analysis of Iterative Thresholding Algorithms
- Blog: On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit
- Blog: Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration
- Blog: Accelerated Stochastic Block Coordinate Gradient Descent for Sparsity Constrained Nonconvex Optimization
- Blog: Demixing sparse signals from nonlinear observations
- Blog: Stochastic Variance Reduced Optimization for Nonconvex Sparse Learning
- Blog: Sparse and Low-Rank Tensor Estimation via Cubic Sketchings
- Blog: Stochastic Second-Order Method for Large-Scale Nonconvex Sparse Learning Models
- Blog: A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
- Blog: ISTA-NAS: Efficient and Consistent Neural Architecture Search by Sparse Coding
- Blog: Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
- Blog: On Benefits of Selection Diversity via Bilevel Exclusive Sparsity
- Blog: High-Dimensional Variance-Reduced Stochastic Gradient Expectation-Maximization Algorithm
- Blog: Sparse GCA and Thresholded Gradient Descent
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_iterative_hard_thresholding_sparsity_con_f504a364,
title = {iterative hard thresholding (sparsity-constrained projection)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/iterative-hard-thresholding-sparsity-constrained-projection/rdr_f504a364b0b5470aa3ce8dda7584cc40},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_iterative_hard_thresholding_sparsity_con_f504a364_v1,
title = {iterative hard thresholding (sparsity-constrained projection)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/iterative-hard-thresholding-sparsity-constrained-projection/rdr_f504a364b0b5470aa3ce8dda7584cc40/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}