Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1502.06354
Cited By
First-order regret bounds for combinatorial semi-bandits
23 February 2015
Gergely Neu
Re-assign community
ArXiv
PDF
HTML
Papers citing
"First-order regret bounds for combinatorial semi-bandits"
6 / 6 papers shown
Title
Online Linear Optimization via Smoothing
Jacob D. Abernethy
Chansoo Lee
Abhinav Sinha
Ambuj Tewari
102
77
0
23 May 2014
An efficient algorithm for learning with semi-bandit feedback
Gergely Neu
Gábor Bartók
99
80
0
13 May 2013
Prediction by Random-Walk Perturbation
Luc Devroye
Gábor Lugosi
Gergely Neu
90
37
0
23 Feb 2013
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
193
357
0
18 Aug 2012
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
Yi Gai
Bhaskar Krishnamachari
Rahul Jain
162
261
0
22 Nov 2010
The on-line shortest path problem under partial monitoring
Pál Benkö
T. Várady
L. Andor
Ralph Robert Martin
516
355
0
08 Apr 2007
1