On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

Documenti analoghi

• Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
  di: Ji, Kaixuan, et al.
  Pubblicazione: (2026)
• Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
  di: Zhao, Qingyue, et al.
  Pubblicazione: (2026)
• Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits
  di: Zhao, Qingyue, et al.
  Pubblicazione: (2025)
• Sharp Analysis for KL-Regularized Contextual Bandits and RLHF
  di: Zhao, Heyang, et al.
  Pubblicazione: (2024)
• Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling
  di: Di, Qiwei, et al.
  Pubblicazione: (2025)