33 citations · 254 across the 68 of their papers we have counts for
8 papers · 1 filter
Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks
Lili Su, Nitin H. Vaidya
We study the problem of constrained distributed optimization in multi-agent networks when some of the computing agents may be faulty. In this problem, the system goal is to have al…
Fault-Tolerant Multi-Agent Optimization: Part III
Lili Su, Nitin Vaidya
We study fault-tolerant distributed optimization of a sum of convex (cost) functions with real-valued scalar input/output in the presence of crash faults or Byzantine faults. In pa…
Characterizing and Adapting the Consistency-Latency Tradeoff in Distributed Key-value Stores
Muntasir Raihan Rahman, Lewis Tseng, Son Nguyen +2
The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first present and prove two CAP-like impossibility theorems. To state these t…
Byzantine Multi-Agent Optimization: Part I
Lili Su, Nitin Vaidya
We study Byzantine fault-tolerant distributed optimization of a sum of convex (cost) functions with real-valued scalar input/ouput. In particular, the goal is to optimize a global…
Byzantine Multi-Agent Optimization: Part II
Lili Su, Nitin Vaidya
In Part I of this report, we introduced a Byzantine fault-tolerant distributed optimization problem whose goal is to optimize a sum of convex (cost) functions with real-valued scal…
Application-Aware Consistency: An Application to Social Network
Lewis Tseng, Alec Benzer, Nitin H. Vaidya
This work weakens well-known consistency models using graphs that capture applications' characteristics. The weakened models not only respect application semantic, but also yield a…