6 citations · 27 across the 15 of their papers we have counts for
3 papers · 2 filters
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
Aritra Mitra, Arman Adibi, George J. Pappas +1
We consider a linear stochastic bandit problem involving agents that can collaborate via a central server to minimize regret. A fraction of these agents are adversarial and…
Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents
Arman Adibi, Aritra Mitra, George J. Pappas +1
Recent years have witnessed a growing interest in the topic of min-max optimization, owing to its relevance in the context of generative adversarial networks (GANs), robust control…
Linear Stochastic Bandits over a Bit-Constrained Channel
Aritra Mitra, Hamed Hassani, George J. Pappas
One of the primary challenges in large-scale distributed learning stems from stringent communication constraints. While several recent works address this challenge for static optim…