activity
20192022
most citedByzantine Resilient Non-Convex SVRG with Distributed Batch Gradient Computations

10 citations · 12 across the 3 of their papers we have counts for

collaborators

5 papers

eess.SP20221 cited

Ordered Transmission-based Detection in Distributed Networks in the Presence of Byzantines

Chen Quan, Saikiran Bulusu, Baocheng Geng +1

The ordered transmission (OT) scheme reduces the number of transmissions needed in the network to make the final decision, while it maintains the same probability of error as the s…

math.OC20201 cited

Distributed Stochastic Non-Convex Optimization: Momentum-Based Variance Reduction

Prashant Khanduri, Pranay Sharma, Swatantra Kafle +3

In this work, we propose a distributed algorithm for stochastic non-convex optimization. We consider a worker-server architecture where a set of worker nodes (WNs) in collabora…

cs.LG2020

Anomalous Example Detection in Deep Learning: A Survey

Saikiran Bulusu, Bhavya Kailkhura, Bo Li +2

Deep Learning (DL) is vulnerable to out-of-distribution and adversarial examples resulting in incorrect outputs. To make DL more robust, several posthoc (or runtime) anomaly detect…

math.OC201910 cited

Byzantine Resilient Non-Convex SVRG with Distributed Batch Gradient Computations

Prashant Khanduri, Saikiran Bulusu, Pranay Sharma +1

In this work, we consider the distributed stochastic optimization problem of minimizing a non-convex function in an adversarial sett…

math.OC2019

Parallel Restarted SPIDER -- Communication Efficient Distributed Nonconvex Optimization with Optimal Computation Complexity

Pranay Sharma, Swatantra Kafle, Prashant Khanduri +3

In this paper, we propose a distributed algorithm for stochastic smooth, non-convex optimization. We assume a worker-server architecture where nodes, each having (potential…