Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits

Documenti analoghi

• Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
  di: Hu, Bingshan, et al.
  Pubblicazione: (2025)
• Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
  di: Zhang, Raymond, et al.
  Pubblicazione: (2024)
• Efficient and Adaptive Posterior Sampling Algorithms for Bandits
  di: Hu, Bingshan, et al.
  Pubblicazione: (2024)
• On Regret Bounds of Thompson Sampling for Bayesian Optimization
  di: Takeno, Shion, et al.
  Pubblicazione: (2026)
• Near-optimal Per-Action Regret Bounds for Sleeping Bandits
  di: Nguyen, Quan, et al.
  Pubblicazione: (2024)