T. Hayes
Management Science and Operations Research · with Dani · 2003–2009
A researcher in the Science corpus: 5 papers; trusts 18 researchers and is trusted by 69 researchers here, as inferred from the citation graph.
Subfields
- Management Science and Operations Research — 7 citations into it; #3,899 of 11,946 by trust here, #7,638 by citations
- Statistics and Probability — 7 citations into it
- Computer Networks and Communications — 6 citations into it; #3,141 of 9,886 by trust here, #6,788 by citations
- Statistical Learning Theory — 5 citations into it; #490 of 1,038 by trust here, #619 by citations
Whom T. Hayes trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Peter Auer
- David Freedman
- Nicholas I. Fisher
- Yoav Freund
- Varsha Dani
- Pranab Kumar Sen
- Aranyak Mehta
- Niv Buchbinder
- Rajeev Agrawal
- T. L. Lai Andherbertrobbins
Who trusts T. Hayes overall
- Ching-An Cheng
- Ashish Khetan
- Alekh Agarwal
- R´emi Munos
- Daniel Russo
- Andreas Krause
- Shipra Agrawal
- Sewoong Oh
- Sham M. Kakade
- Byron Boots
Papers from T. Hayes's perspective
Ordered by how strongly the researchers T. Hayes trusts endorse each paper. Same corpus, a different order for every researcher.
- Asymptotically Efficient Adaptive Allocation Rules
- Some aspects of the sequential design of experiments
- Probability Inequalities for Sums of Bounded Random Variables
- Using Confidence Bounds for Exploitation-Exploration Trade-offs
- On Tail Probabilities for Martingales
- Efficient algorithms for online decision problems
- A decision-theoretic generalization of on-line learning and an application to boosting
- The Nonstochastic Multiarmed Bandit Problem
- Finite-time Analysis of the Multiarmed Bandit Problem
- The On-Line Shortest Path Problem Under Partial Monitoring (Journal of machine learning research)
Their papers
- The adwords problem: online keyword matching with budgeted bidders under random permutations (2009) — 413 citations
- Stochastic Linear Optimization under Bandit Feedback (2008) — 969 citations
- High-Probability Regret Bounds for Bandit Online Linear Optimization (2008) — 130 citations
- The Price of Bandit Information for Online Optimization (2007) — 243 citations
- A large-deviation inequality for vector-valued martingales (2003) — 73 citations