Varsha Dani
2007–2008
A researcher in the Science corpus: 3 papers; trusts 7 researchers and is trusted by 64 researchers here, as inferred from the citation graph.
Whom Varsha Dani trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Peter Auer
- David Freedman
- Yoav Freund
- Rajeev Agrawal
- T. L. Lai Andherbertrobbins
- Nicolò Cesa-Bianchi
- Robert E. Schapire
- T. Hayes
- Tze Leung Lai
- Sham M. Kakade
Who trusts Varsha Dani overall
- Alekh Agarwal
- R´emi Munos
- Daniel Russo
- Andreas Krause
- Sham M. Kakade
- Hamsa Bastani
- Sébastien Bubeck
- Nicolò Cesa-Bianchi
- A. Carpentier
- Shai Shalev-Shwartz
Papers from Varsha Dani's perspective
Ordered by how strongly the researchers Varsha Dani 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
- On Tail Probabilities for Martingales
- Using Confidence Bounds for Exploitation-Exploration Trade-offs
- Efficient algorithms for online decision problems
- A decision-theoretic generalization of on-line learning and an application to boosting
- The Nonstochastic Multiarmed Bandit Problem
- The On-Line Shortest Path Problem Under Partial Monitoring (Journal of machine learning research)
- Finite-time Analysis of the Multiarmed Bandit Problem
- Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization (Annual Conference Computational Learning Theory)
Their papers
- 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