S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
Emilie Kaufmann · Study
Home
/
Author
Emilie Kaufmann
11 works
· latest 2019
· 4 institutions
cluster: provisional
ORCID 0000-0002-5496-824X
Follow
Suggest an ORCID correction
h-index
11
i10
11
Citations
1,954
Works here
11
12
13
14
16
17
18
19
Most cited in this library
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
2014 · 704 citations
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
2012 · 381 citations
On Bayesian Upper Confidence Bounds for Bandit Problems
2012 · 210 citations
Optimal Best Arm Identification with Fixed Confidence
2016 · 115 citations
Information Complexity in Bandit Subset Selection
2013 · 107 citations
Works
11 shown
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players
arXiv (Cornell University)
·
2019
·
4 authors
·
preprint
·
Open access
43
citations
On Bayesian index policies for sequential resource allocation
The Annals of Statistics
·
2018
·
1 author
·
Open access
97
citations
What Doubling Tricks Can and Can't Do for Multi-Armed Bandits
arXiv (Cornell University)
·
2018
·
2 authors
·
preprint
·
Open access
56
citations
Multi-Player Bandits Revisited
arXiv (Cornell University)
·
2017
·
2 authors
·
preprint
·
Open access
53
citations
On Explore-Then-Commit Strategies
arXiv (Cornell University)
·
2016
·
3 authors
·
preprint
·
Open access
100
citations
Optimal Best Arm Identification with Fixed Confidence
arXiv (Cornell University)
·
2016
·
2 authors
·
preprint
·
Open access
115
citations
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
arXiv (Cornell University)
·
2014
·
3 authors
·
preprint
·
Open access
704
citations
Thompson Sampling for 1-Dimensional Exponential Family Bandits
arXiv (Cornell University)
·
2013
·
3 authors
·
preprint
·
Open access
88
citations
Information Complexity in Bandit Subset Selection
·
2013
·
2 authors
107
citations
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
Lecture notes in computer science
·
2012
·
3 authors
·
other
·
Open access
381
citations
On Bayesian Upper Confidence Bounds for Bandit Problems
·
2012
·
2 authors
210
citations