Search Results for author:
Found 5 papers, 0 papers with code
Byzantine-Resilient Decentralized Multi-Armed Bandits
In decentralized cooperative multi-armed bandits (MAB), each agent observes a distinct stream of rewards, and seeks to exchange information with others to select a sequence of arms so as to minimize its regret.
A Resilient Distributed Algorithm for Solving Linear Equations
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 arbitrarily introducing untrustworthy information in communication.
Resilient Constrained Consensus over Complete Graphs via Feasibility Redundancy
This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs.
Decentralized Multi-Armed Bandit Can Outperform Classic Upper Confidence Bound: A Homogeneous Case over Strongly Connected Graphs
This paper studies a homogeneous decentralized multi-armed bandit problem, in which a network of multiple agents faces the same set of arms, and each agent aims to minimize its own regret.
Federated Bandit: A Gossiping Approach
Motivated by the proposal of federated learning, we aim for a solution with which agents will never share their local observations with a central entity, and will be allowed to only share a private copy of his/her own information with their neighbors.
