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. 2312.15549
  4. Cited By
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling
  on Sparse Hypergraphs

Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs

24 December 2023
Tianyuan Jin
Hao-Lun Hsu
William Chang
Pan Xu
ArXivPDFHTML

Papers citing "Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs"

4 / 4 papers shown
Title
ε-Neural Thompson Sampling of Deep Brain Stimulation for
  Parkinson Disease Treatment
ε-Neural Thompson Sampling of Deep Brain Stimulation for Parkinson Disease Treatment
Hao-Lun Hsu
Qitong Gao
Miroslav Pajic
53
0
0
11 Mar 2024
Multi-Objective Coordination Graphs for the Expected Scalarised Returns
  with Generative Flow Models
Multi-Objective Coordination Graphs for the Expected Scalarised Returns with Generative Flow Models
Conor F. Hayes
T. Verstraeten
D. Roijers
Enda Howley
Patrick Mannion
24
3
0
01 Jul 2022
Multi-Agent Multi-Armed Bandits with Limited Communication
Multi-Agent Multi-Armed Bandits with Limited Communication
Mridul Agarwal
Vaneet Aggarwal
Kamyar Azizzadenesheli
31
32
0
10 Feb 2021
Federated Bandit: A Gossiping Approach
Federated Bandit: A Gossiping Approach
Zhaowei Zhu
Jingxuan Zhu
Ji Liu
Yang Liu
FedML
139
83
0
24 Oct 2020
1