Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback

Documenti analoghi

• Variance-Dependent Regret Lower Bounds for Contextual Bandits
  di: He, Jiafan, et al.
  Pubblicazione: (2025)
• Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
  di: Di, Qiwei, et al.
  Pubblicazione: (2024)
• Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
  di: Di, Qiwei, et al.
  Pubblicazione: (2023)
• Feel-Good Thompson Sampling for Contextual Dueling Bandits
  di: Li, Xuheng, et al.
  Pubblicazione: (2024)
• A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
  di: Zhao, Heyang, et al.
  Pubblicazione: (2023)