S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
H. Brendan McMahan · Study
Home
/
Author
H. Brendan McMahan
8 works
· latest 2017
· 2 institutions
cluster: provisional
ORCID 0009-0003-5892-4193
Follow
Suggest an ORCID correction
h-index
8
i10
8
Citations
2,136
Works here
8
04
07
09
10
13
17
Most cited in this library
Ad click prediction
2013 · 870 citations
Online convex optimization in the bandit setting: gradient descent without a gradient
2004 · 599 citations
Adaptive Bound Optimization for Online Convex Optimization
2010 · 228 citations
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
2004 · 172 citations
Tighter Bounds for Multi-Armed Bandits with Expert Advice
2009 · 91 citations
Works
8 shown
A survey of Algorithms and Analysis for Adaptive Online Learning
Journal of Machine Learning Research
·
2017
·
1 author
88
citations
Ad click prediction
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
2013
·
13 authors
·
other
·
Open access
870
citations
Adaptive Bound Optimization for Online Convex Optimization
arXiv (Cornell University)
·
2010
·
1 author
·
preprint
·
Open access
228
citations
Sleeping Experts and Bandits with Stochastic Action Availability and Adversarial Rewards
·
2009
·
3 authors
49
citations
Tighter Bounds for Multi-Armed Bandits with Expert Advice
·
2009
·
1 author
91
citations
Selecting Observations against Adversarial Objectives
·
2007
·
4 authors
39
citations
Online convex optimization in the bandit setting: gradient descent without a gradient
arXiv (Cornell University)
·
2004
·
3 authors
·
preprint
·
Open access
599
citations
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
Lecture notes in computer science
·
2004
·
2 authors
·
other
172
citations