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. 2402.13182
  4. Cited By
Order-Optimal Regret in Distributed Kernel Bandits using Uniform
  Sampling with Shared Randomness

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness

20 February 2024
Nikola Pavlovic
Sudeep Salgia
Qing Zhao
ArXivPDFHTML

Papers citing "Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness"

4 / 4 papers shown
Title
Distributed Contextual Linear Bandits with Minimax Optimal Communication
  Cost
Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost
Sanae Amani
Tor Lattimore
András Gyorgy
Lin F. Yang
FedML
23
9
0
26 May 2022
Gaussian Process Bandit Optimization with Few Batches
Gaussian Process Bandit Optimization with Few Batches
Zihan Li
Jonathan Scarlett
GP
121
47
0
15 Oct 2021
Federated Multi-Armed Bandits
Federated Multi-Armed Bandits
Chengshuai Shi
Cong Shen
FedML
47
91
0
28 Jan 2021
Federated Bayesian Optimization via Thompson Sampling
Federated Bayesian Optimization via Thompson Sampling
Zhongxiang Dai
K. H. Low
Patrick Jaillet
FedML
79
109
0
20 Oct 2020
1