Learning to Route and Schedule LLMs from User Retrials via Contextual Queueing Bandits

Documenti analoghi

• Queue Length Regret Bounds for Contextual Queueing Bandits
  di: Bae, Seoungbin, et al.
  Pubblicazione: (2026)
• Neural Logistic Bandits
  di: Bae, Seoungbin, et al.
  Pubblicazione: (2025)
• Logistic Bandits with $\tilde{O}(\sqrt{dT})$ Regret without Context Diversity Assumptions
  di: Bae, Seoungbin, et al.
  Pubblicazione: (2026)
• Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards
  di: Yu, Kihyun, et al.
  Pubblicazione: (2026)
• Primal-Dual Policy Optimization for Linear CMDPs with Adversarial Losses
  di: Yu, Kihyun, et al.
  Pubblicazione: (2026)