activity
20092022
most citedByzantine Multi-Agent Optimization: Part II

33 citations · 254 across the 68 of their papers we have counts for

collaborators

74 papers

cs.DC2022

Impact of Redundancy on Resilience in Distributed Optimization and Learning

Shuo Liu, Nirupam Gupta, Nitin H. Vaidya

This report considers the problem of resilient distributed optimization and stochastic learning in a server-based architecture. The system comprises a server and multiple agents, w…

cs.DC2022

Impact of the Consistency Model on Checkpointing of Distributed Shared Memory

Sandeep Kulkarni, Duong Nguyen, Lewis Tseng +1

In this report, we consider the impact of the consistency model on checkpointing and rollback algorithms for distributed shared memory. In particular, we consider specific implemen…

cs.DC2022

Byzantine Fault-Tolerant Min-Max Optimization

Shuo Liu, Nitin Vaidya

In this paper, we consider a min-max optimization problem under adversarial manipulation, where there are cost functions, up to of which may be replaced by arbitrary faulty…

cs.DC2021

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…

cs.DC2021

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…

cs.DC2021★ 1 cited

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…