S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
Satyen Kale · Study
Home
/
Author
Satyen Kale
13 works
· latest 2015
· 5 institutions
cluster: provisional
Follow
Claim this profile
h-index
13
i10
13
Citations
2,289
Works here
13
06
07
09
10
11
12
14
15
Most cited in this library
Logarithmic regret algorithms for online convex optimization
2007 · 836 citations
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
2014 · 286 citations
Algorithms for portfolio management based on the Newton method
2006 · 239 citations
Logarithmic Regret Algorithms for Online Convex Optimization
2006 · 203 citations
Efficient Optimal Learning for Contextual Bandits
2011 · 174 citations
Works
13 shown
Online Gradient Boosting
arXiv (Cornell University)
·
2015
·
4 authors
·
preprint
·
Open access
51
citations
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
arXiv (Cornell University)
·
2014
·
6 authors
·
preprint
·
Open access
286
citations
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION
Mathematical Finance
·
2012
·
2 authors
44
citations
Projection-free Online Learning
arXiv (Cornell University)
·
2012
·
2 authors
·
preprint
·
Open access
140
citations
Contextual Bandit Learning with Predictable Rewards
arXiv (Cornell University)
·
2012
·
5 authors
·
preprint
·
Open access
43
citations
A simple multi-armed bandit algorithm with optimal variation-bounded regret
Conference on Learning Theory
·
2011
·
2 authors
·
other
52
citations
Efficient Optimal Learning for Contextual Bandits
arXiv (Cornell University)
·
2011
·
7 authors
·
preprint
·
Open access
174
citations
Non-Stochastic Bandit Slate Problems
·
2010
·
3 authors
61
citations
Extracting certainty from uncertainty: regret bounded by variation in costs
Machine Learning
·
2010
·
2 authors
·
Open access
113
citations
Online submodular minimization
·
2009
·
2 authors
47
citations
Logarithmic regret algorithms for online convex optimization
Machine Learning
·
2007
·
2 authors
·
Open access
836
citations
Algorithms for portfolio management based on the Newton method
International Conference on Machine Learning
·
2006
·
3 authors
·
other
239
citations
Logarithmic Regret Algorithms for Online Convex Optimization
Lecture notes in computer science
·
2006
·
3 authors
·
other
203
citations