33 citations · 254 across the 68 of their papers we have counts for
7 papers · 1 filter
Utilizing Redundancy in Cost Functions for Resilience in Distributed Optimization and Learning
Shuo Liu, Nirupam Gupta, Nitin Vaidya
This paper considers the problem of resilient distributed optimization and stochastic machine learning in a server-based architecture. The system comprises a server and multiple ag…
Byzantine Consensus in Directed Hypergraphs
Muhammad Samir Khan, Nitin H. Vaidya
Byzantine consensus is a classical problem in distributed computing. Each node in a synchronous system starts with a binary input. The goal is to reach agreement in the presence of…
Byzantine Fault-Tolerance in Federated Local SGD under 2f-Redundancy
Nirupam Gupta, Thinh T. Doan, Nitin Vaidya
We consider the problem of Byzantine fault-tolerance in federated machine learning. In this problem, the system comprises multiple agents each with local data, and a trusted centra…
Asynchronous Distributed Optimization with Redundancy in Cost Functions
Shuo Liu, Nirupam Gupta, Nitin H. Vaidya
This paper considers the problem of asynchronous distributed multi-agent optimization on server-based system architecture. In this problem, each agent has a local cost, and the goa…
Contention Resolution with Predictions
Seth Gilbert, Calvin Newport, Nitin Vaidya +1
In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is…
Byzantine Fault-Tolerance in Peer-to-Peer Distributed Gradient-Descent
Nirupam Gupta, Nitin H. Vaidya
We consider the problem of Byzantine fault-tolerance in the peer-to-peer (P2P) distributed gradient-descent method -- a prominent algorithm for distributed optimization in a P2P sy…