IHT dies hard: Provable accelerated Iterative Hard Thresholding
arXiv:1712.09379
Abstract
We study --both in theory and practice-- the use of momentum motions in classic iterative hard thresholding (IHT) methods. By simply modifying plain IHT, we investigate its convergence behavior on convex optimization criteria with non-convex constraints, under standard assumptions. In diverse scenaria, we observe that acceleration in IHT leads to significant improvements, compared to state of the art projected gradient descent and Frank-Wolfe variants. As a byproduct of our inspection, we study the impact of selecting the momentum parameter: similar to convex settings, two modes of behavior are observed --"rippling" and linear-- depending on the level of momentum.
accepted to AISTATS 2018
Cited by in corpus (6)
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- OPENMENDEL: A Cooperative Programming Project for Statistical Genetics
- Between hard and soft thresholding: optimal iterative thresholding algorithms
- Analysis of Optimal Thresholding Algorithms for Compressed Sensing
- Bayesian Coresets: Revisiting the Nonconvex Optimization Perspective
- Implicit regularization and solution uniqueness in over-parameterized matrix sensing