ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2206.02834
  4. Cited By
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal
  Regret Bounds

Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds

6 June 2022
A. Mitra
Arman Adibi
George J. Pappas
Hamed Hassani
ArXiv (abs)PDFHTML

Papers citing "Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds"

4 / 4 papers shown
Title
Harnessing the Power of Federated Learning in Federated Contextual
  Bandits
Harnessing the Power of Federated Learning in Federated Contextual Bandits
Chengshuai Shi
Ruida Zhou
Kun Yang
Cong Shen
FedML
64
0
0
26 Dec 2023
Byzantine-Resilient Decentralized Multi-Armed Bandits
Byzantine-Resilient Decentralized Multi-Armed Bandits
Jingxuan Zhu
Alec Koppel
Alvaro Velasquez
Ji Liu
73
6
0
11 Oct 2023
Byzantine-Robust Distributed Online Learning: Taming Adversarial
  Participants in An Adversarial Environment
Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment
Xingrong Dong
Zhaoxian Wu
Qing Ling
Zhi Tian
AAML
87
12
0
16 Jul 2023
Federated Multi-Armed Bandits Under Byzantine Attacks
Federated Multi-Armed Bandits Under Byzantine Attacks
Artun Saday
Ilker Demirel
Yiğit Yıldırım
Cem Tekin
AAML
64
13
0
09 May 2022
1