Josef Broder
Artificial Intelligence · 2012
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 15 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 6 citations into it; #9,639 of 35,345 by trust here, #12,083 by citations
- Reinforcement Learning — 6 citations into it; #814 of 2,242 by trust here, #1,118 by citations
Whom Josef Broder trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Peter Auer
- Thorsten Joachims
- T. L. Lai Andherbertrobbins
- Nicholas I. Fisher
- William W. Cohen
- Eyal Even-Dar
- Shie Mannor
Who trusts Josef Broder overall
- Masrour Zoghi
- Aadirupa Saha
- Yisong Yue
- Andreas Holzinger
- Róbert Istvan Busa-Fekete
- Thorsten Joachims
- Shimon Whiteson
- Huasen Wu
- Akash Kumar Mohankumar
- Maarten de Rijke
Papers from Josef Broder's perspective
Ordered by how strongly the researchers Josef Broder trusts endorse each paper. Same corpus, a different order for every researcher.
- Probability Inequalities for Sums of Bounded Random Variables
- Some aspects of the sequential design of experiments
- Asymptotically Efficient Adaptive Allocation Rules
- Information Theory: 1948-1998 - Guest Editorial
- Using Confidence Bounds for Exploitation-Exploration Trade-offs
- Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems
- Minimax Policies for Adversarial and Stochastic Bandits
- The Epoch-Greedy algorithm for contextual multi-armed bandits
- The Sample Complexity of Exploration in the Multi-Armed Bandit Problem (Journal of machine learning research)
- The Nonstochastic Multiarmed Bandit Problem
Their papers
- The K-armed Dueling Bandits Problem (2012) — 454 citations