A claimed tensor NIHT algorithm is in practice a hard-thresholded SVRG method whose promised convergence theorem is not actually proved.
Knowledge-Aided Normalized Iterative Hard Thresholding Algorithms and Applications to Sparse Reconstruction
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper deals with the problem of sparse recovery often found in compressive sensing applications exploiting a priori knowledge. In particular, we present a knowledge-aided normalized iterative hard thresholding (KA-NIHT) algorithm that exploits information about the probabilities of nonzero entries. We also develop a strategy to update the probabilities using a recursive KA-NIHT (RKA-NIHT) algorithm, which results in improved recovery. Simulation results illustrate and compare the performance of the proposed and existing algorithms.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Normalized Iterative Hard Thresholding for Tensor Recovery
A claimed tensor NIHT algorithm is in practice a hard-thresholded SVRG method whose promised convergence theorem is not actually proved.