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. 2110.01463
  4. Cited By
Asynchronous Upper Confidence Bound Algorithms for Federated Linear
  Bandits

Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits

4 October 2021
Chuanhao Li
Hongning Wang
    FedML
ArXivPDFHTML

Papers citing "Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits"

5 / 5 papers shown
Title
FedConPE: Efficient Federated Conversational Bandits with Heterogeneous
  Clients
FedConPE: Efficient Federated Conversational Bandits with Heterogeneous Clients
Zhuohua Li
Maoli Liu
J. C. Lui
FedML
19
5
0
05 May 2024
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
13
0
0
26 Dec 2023
Vertical Federated Linear Contextual Bandits
Vertical Federated Linear Contextual Bandits
Zeyu Cao
Zhipeng Liang
Shu Zhen Zhang
Hang Li
Ouyang Wen
Yu Rong
P. Zhao
Bing Wu
FedML
19
0
0
20 Oct 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated
  Contextual Linear Bandits
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
Jiafan He
Tianhao Wang
Yifei Min
Quanquan Gu
FedML
11
31
0
07 Jul 2022
Collaborative Pure Exploration in Kernel Bandit
Collaborative Pure Exploration in Kernel Bandit
Yihan Du
Wei Chen
Yuko Kuroki
Longbo Huang
20
10
0
29 Oct 2021
1