Zobrazeno 1 - 10
of 394
pro vyhledávání: '"Vaidya, Nitin"'
Autor:
Liu, Shuo, Vaidya, Nitin H.
In this report, we study the problem of Byzantine fault-tolerant distributed set intersection and the importance of redundancy in solving this problem. Specifically, consider a distributed system with $n$ agents, each of which has a local set. There
Externí odkaz:
http://arxiv.org/abs/2402.08809
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, where each agent has its own local cost function. The agents collaborat
Externí odkaz:
http://arxiv.org/abs/2211.08622
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 implementations of four consistency models for distributed shared memory, name
Externí odkaz:
http://arxiv.org/abs/2208.02411
Autor:
Liu, Shuo, Vaidya, Nitin
In this paper, we consider a min-max optimization problem under adversarial manipulation, where there are $n$ cost functions, up to $f$ of which may be replaced by arbitrary faulty functions by an adversary. The goal is to minimize the maximum cost o
Externí odkaz:
http://arxiv.org/abs/2205.14881
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 agents, where each agent has a local cost function. The agents collabora
Externí odkaz:
http://arxiv.org/abs/2110.10858
Autor:
Khan, Muhammad Samir, Vaidya, Nitin H.
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 faulty nodes. We consider the setting where communication b
Externí odkaz:
http://arxiv.org/abs/2109.01205
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 centralized coordinator. In fault-free setting, the agents collaborate with
Externí odkaz:
http://arxiv.org/abs/2108.11769
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 goal for the agents is to collectively find a minimum of their aggregate
Externí odkaz:
http://arxiv.org/abs/2106.03998
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 provided a distribution defined over the possible network sizes that p
Externí odkaz:
http://arxiv.org/abs/2105.12706
Autor:
Gupta, Nirupam, Vaidya, Nitin H.
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 system. In this problem, the system comprises of multiple agents, and ea
Externí odkaz:
http://arxiv.org/abs/2101.12316