Computer Science > Information Theory
[Submitted on 23 Apr 2018 (v1), last revised 14 Aug 2020 (this version, v2)]
Title:Deterministic and Randomized Diffusion based Iterative Generalized Hard Thresholding (DiFIGHT) for Distributed Sparse Signal Recovery
View PDFAbstract:In this paper we propose a distributed iterated hard thresholding algorithm termed DiFIGHT over a network that is built on the diffusion mechanism and also propose a modification of the proposed algorithm, termed MoDiFIGHT, that has low complexity in terms of communication in the network. We additionally propose four different strategies termed RP, RNP, RGP$_r$, and RGNP$_r$ that are used to randomly select a subset of nodes that are subsequently activated to take part in the distributed algorithm, so as to reduce the mean number of communications during the run of the distributed algorithm. We present theoretical estimates of the long run communication per unit time for these different strategies, when used by the two proposed algorithms. Also, we present analysis of the two proposed algorithms and provide provable bounds on their recovery performance with or without using the random node selection strategies. Finally we use numerical studies to show that both when the random strategies are used as well as when they are not used, the proposed algorithms display performances far superior to distributed IHT algorithm using consensus mechanism .
Submission history
From: Samrat Mukhopadhyay [view email][v1] Mon, 23 Apr 2018 07:13:47 UTC (284 KB)
[v2] Fri, 14 Aug 2020 16:37:20 UTC (287 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.