2 citations · 2 across the 4 of their papers we have counts for
6 papers
A Resilient Distributed Algorithm for Solving Linear Equations
Jingxuan Zhu, Alvaro Velasquez, Ji Liu
This paper presents a resilient distributed algorithm for solving a system of linear algebraic equations over a multi-agent network in the presence of Byzantine agents capable of a…
Resilient Distributed Optimization
Jingxuan Zhu, Yixuan Lin, Alvaro Velasquez +1
This paper considers a distributed optimization problem in the presence of Byzantine agents capable of introducing untrustworthy information into the communication network. A resil…
Reaching a Consensus with Limited Information
Jingxuan Zhu, Yixuan Lin, Ji Liu +1
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can ena…
Resilient Constrained Consensus over Complete Graphs via Feasibility Redundancy
Jingxuan Zhu, Yixuan Lin, Alvaro Velasquez +1
This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with…
Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
Jingxuan Zhu, Ethan Mulle, Christopher S. Smith +2
This paper studies a decentralized homogeneous multi-armed bandit problem in a multi-agent network. The problem is simultaneously solved by agents assuming they face a common s…
Federated Bandit: A Gossiping Approach
Zhaowei Zhu, Jingxuan Zhu, Ji Liu +1
In this paper, we study \emph{Federated Bandit}, a decentralized Multi-Armed Bandit problem with a set of agents, who can only communicate their local data with neighbors descr…