A claimed tensor NIHT algorithm is in practice a hard-thresholded SVRG method whose promised convergence theorem is not actually proved.
Multichannel sparse recovery of complex-valued signals using Huber's criterion
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known elementary vectors. This requires careful characterization of robust complex-valued loss functions as well as Huber's criterion function for the multivariate sparse regression problem. We devise a greedy algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Unlike the conventional SNIHT method, our algorithm, referred to as HUB-SNIHT, is robust under heavy-tailed non-Gaussian noise conditions, yet has a negligible performance loss compared to SNIHT under Gaussian noise. Usefulness of the method is illustrated in source localization application with sensor arrays.
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.