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. 1204.4710
  4. Cited By
Regret in Online Combinatorial Optimization

Regret in Online Combinatorial Optimization

20 April 2012
Jean-Yves Audibert
Sébastien Bubeck
Gábor Lugosi
    OffRL
ArXivPDFHTML

Papers citing "Regret in Online Combinatorial Optimization"

2 / 2 papers shown
Title
Towards minimax policies for online linear optimization with bandit
  feedback
Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck
Nicolò Cesa-Bianchi
Sham Kakade
OffRL
280
150
0
14 Feb 2012
The on-line shortest path problem under partial monitoring
The on-line shortest path problem under partial monitoring
Pál Benkö
T. Várady
L. Andor
Ralph Robert Martin
593
355
0
08 Apr 2007
1