Distributed gradient descent algorithm robust to an arbitrary number of byzantine attackers

X Cao, L Lai - IEEE Transactions on Signal Processing, 2019 - ieeexplore.ieee.org
Due to the growth of modern dataset size and the desire to harness computing power of
multiple machines, there is a recent surge of interest in the design of distributed machine …

Robust distributed optimization with randomly corrupted gradients

B Turan, CA Uribe, HT Wai… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
In this paper, we propose a first-order distributed optimization algorithm that is provably
robust to Byzantine failures–arbitrary and potentially adversarial behavior, where all the …

Distributed approximate Newton's method robust to byzantine attackers

X Cao, L Lai - IEEE Transactions on Signal Processing, 2020 - ieeexplore.ieee.org
There is a recent surge of interest in the design of the first-order and the second-order
distributed machine learning algorithms. However, distributed algorithms are sensitive to …

Design and analysis of a greedy pursuit for distributed compressed sensing

D Sundman, S Chatterjee… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We consider a distributed compressed sensing scenario where many sensors measure
correlated sparse signals and the sensors are connected through a network. Correlation …

Recovery Guarantees for Distributed-OMP

C Amiraz, R Krauthgamer… - … Conference on Artificial …, 2024 - proceedings.mlr.press
We study distributed schemes for high-dimensional sparse linear regression, based on
orthogonal matching pursuit (OMP). Such schemes are particularly suited for settings where …

Diffusion-based Kalman iterative thresholding for compressed sampling recovery over network

F Ansari-Ram, A Ebrahimi-Moghadam, M Khademi… - Signal Processing, 2023 - Elsevier
Network-based CS recovery is used for faster processing of large-scale data, as well as for
sensor networks where the observation vector and sampling matrix are distributed. In this …

Greedy sparse learning over network

A Zaki, A Venkitaraman, S Chatterjee… - … on Signal and …, 2017 - ieeexplore.ieee.org
In this paper, we develop a greedy algorithm for solving the problem of sparse learning over
a right stochastic network in a distributed manner. The nodes iteratively estimate the sparse …

Deterministic and randomized diffusion based iterative generalized hard thresholding (DiFIGHT) for distributed recovery of sparse signals

S Mukhopadhyay, M Chakraborty - IEEE Transactions on Signal …, 2021 - ieeexplore.ieee.org
In this paper, we propose a distributed iterative hard thresholding algorithm, namely,
DiFIGHT, for a network that uses diffusion as the means of intra-network collaboration …

Estimate exchange over network is good for distributed hard thresholding pursuit

A Zaki, PP Mitra, LK Rasmussen, S Chatterjee - Signal Processing, 2019 - Elsevier
We investigate an existing distributed algorithm for learning sparse signals or data over
networks. The algorithm is iterative and exchanges intermediate estimates of a sparse signal …

Distributed Compressive Spectrum Sensing Using Robust Power Estimation Techniques Under Non-Gaussian Noise

B Bhavana, SL Sabat, S Namburu… - … Systems & NETworkS …, 2024 - ieeexplore.ieee.org
Compressive wideband spectrum sensing in a cooperative cognitive radio network requires
each secondary user to reconstruct the original signal from the compressed measurement …