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. 2201.12955
  4. Cited By
Optimal Regret Is Achievable with Bounded Approximate Inference Error:
  An Enhanced Bayesian Upper Confidence Bound Framework

Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework

31 January 2022
Ziyi Huang
H. Lam
A. Meisami
Haofeng Zhang
ArXivPDFHTML

Papers citing "Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework"

2 / 2 papers shown
Title
Bayesian Bandit Algorithms with Approximate Inference in Stochastic
  Linear Bandits
Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
Ziyi Huang
Henry Lam
Haofeng Zhang
21
0
0
20 Jun 2024
On Bayesian index policies for sequential resource allocation
On Bayesian index policies for sequential resource allocation
E. Kaufmann
23
84
0
06 Jan 2016
1