Assaf J. Zeevi
Statistics and Probability · 2001–2014
A researcher in the Science corpus: 12 papers; trusts 28 researchers and is trusted by 56 researchers here, as inferred from the citation graph.
Subfields
- Statistics and Probability — 31 citations into it; #10,600 of 12,932 by trust here, #9,714 by citations
- Artificial Intelligence — 28 citations into it; #6,054 of 35,345 by trust here, #12,761 by citations
- Management Science and Operations Research — 26 citations into it; #790 of 11,946 by trust here, #1,482 by citations
- Economics and Econometrics — 19 citations into it; #3,589 of 23,481 by trust here, #8,485 by citations
- Optimization & Training — 14 citations into it
- Reinforcement Learning — 14 citations into it
- Statistical Learning Theory — 12 citations into it
- Game & Decision Theory — 9 citations into it
Whom Assaf J. Zeevi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Alexandre B. Tsybakov
- Tze Leung Lai
- Peter Auer
- Nicolò Cesa-Bianchi
- Robert D. Kleinberg
- Yuhong Yang
- Gábor Lugosi
- Yoav Freund
- Omar Besbes
- Enno Mammen
Who trusts Assaf J. Zeevi overall
- M. Janga Reddy
- Daniel Berg
- Aleksandrs Slivkins
- Poulomi Ganguli
- Xiangdong Long
- Kjersti Aas
- Hamsa Bastani
- Nathan Kallus
- Tae-Hwy Lee
- S. Demarta
Papers from Assaf J. Zeevi's perspective
Ordered by how strongly the researchers Assaf J. Zeevi trusts endorse each paper. Same corpus, a different order for every researcher.
- Some aspects of the sequential design of experiments
- Asymptotically efficient adaptive allocation rules
- Multi-armed Bandit Allocation Indices
- Online Convex Programming and Generalized Infinitesimal Gradient Ascent
- A decision-theoretic generalization of on-line learning and an application to boosting
- Finite-time Analysis of the Multiarmed Bandit Problem
- Using Confidence Bounds for Exploitation-Exploration Trade-offs
- Optimal aggregation of classifiers in statistical learning
- Gradient-based learning applied to document recognition
- ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES
Their papers
- Beyond Correlation: Extreme Co-movements Between Financial Assets (2002) — 258 citations
- Nonparametric Bandits with Covariates (2010) — 118 citations
- A Linear Response Bandit Problem (2013) — 136 citations
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms (2009) — 545 citations
- Bounding Stationary Expectations of Markov Processes (2008) — 80 citations
- Non-Stationary Stochastic Optimization (2013) — 507 citations
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies (2014) — 298 citations
- Optimal change-point estimation from indirect observations (2004) — 53 citations
- Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014) — 434 citations
- Woodroofe's One-Armed Bandit Problem Revisited (2009) — 63 citations
- Validity of heavy traffic steady-state approximations in generalized Jackson networks (2004) — 197 citations
- On the maximum workload of a queue fed by fractional Brownian motion (2001) — 49 citations