S
Study
Academic Library
Search
Dashboard
Shelves
Open access
My library
Review
Thomas P. Hayes · Study
Home
/
Author
Thomas P. Hayes
5 works
· latest 2008
· 2 institutions
cluster: provisional
ORCID 0009-0003-2718-572X
Works
5 shown
High-probability regret bounds for bandit online linear optimization
QUT ePrints (Queensland University of Technology)
·
2008
·
6 authors
·
other
·
Open access
66
citations
Stochastic Linear Optimization Under Bandit Feedback
ScholarlyCommons (University of Pennsylvania)
·
2008
·
3 authors
·
Open access
581
citations
The Price of Bandit Information for Online Optimization
ScholarlyCommons (University of Pennsylvania)
·
2007
·
3 authors
·
Open access
161
citations
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
·
2006
·
2 authors
71
citations
Robbing the bandit
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
2006
·
2 authors
·
other
63
citations