Efficient Optimal Learning for Contextual Bandits
Abstract
We address the problem of learning in an online setting where the learner repeatedly observes features, selects among a set of actions, and receives reward for the action taken. We provide the first efficient algorithm with an optimal regret. Our algorithm uses a cost sensitive classification learner as an oracle and has a running time , where is the number of classification rules among which the oracle might choose. This is exponentially faster than all previous algorithms that achieve optimal regret in this setting. Our formulation also enables us to create an algorithm with regret that is additive rather than multiplicative in feedback delay as in all previous work.
Efficient Optimal Learning for Contextual Bandits
Miroslav Dudik mdudik@yahooinc.com Daniel Hsu djhsu@rci.rutgers.edu Satyen Kale skale@yahooinc.com Nikos Karampatziakis nk@cs.cornell.edu
John Langford jl@yahooinc.com Lev Reyzin lreyzin@cc.gatech.edu Tong Zhang tzhang@stat.rutgers.edu
1 Introduction
The contextual bandit setting consists of the following loop repeated indefinitely:

The world presents context information as features .

The learning algorithm chooses an action from possible actions.

The world presents a reward for the action.
The key difference between the contextual bandit setting and standard supervised learning is that only the reward of the chosen action is revealed. For example, after always choosing the same action several times in a row, the feedback given provides almost no basis to prefer the chosen action over another action. In essence, the contextual bandit setting captures the difficulty of exploration while avoiding the difficulty of credit assignment as in more general reinforcement learning settings.
The contextual bandit setting is a halfway point between standard supervised learning and fullscale reinforcement learning where it appears possible to construct algorithms with convergence rate guarantees similar to supervised learning. Many natural settings satisfy this halfway point, motivating the investigation of contextual bandit learning. For example, the problem of choosing interesting news articles or ads for users by internet companies can be naturally modeled as a contextual bandit setting. In the medical domain where discrete treatments are tested before approval, the process of deciding which patients are eligible for a treatment takes contexts into account. More generally, we can imagine that in a future with personalized medicine, new treatments are essentially equivalent to new actions in a contextual bandit setting.
In the i.i.d. setting, the world draws a pair consisting of a context and a reward vector from some unknown distribution , revealing in Step 1, but only the reward of the chosen action in Step 3. Given a set of policies , the goal is to create an algorithm for Step 2 which competes with the set of policies. We measure our success by comparing the algorithm’s cumulative reward to the expected cumulative reward of the best policy in the set. The difference of the two is called regret.
All existing algorithms for this setting either achieve a suboptimal regret (Langford and Zhang, 2007) or require computation linear in the number of policies (Auer et al., 2002b; Beygelzimer et al., 2011). In unstructured policy spaces, this computational complexity is the best one can hope for. On the other hand, in the case where the rewards of all actions are revealed, the problem is equivalent to costsensitive classification, and we know of algorithms to efficiently search the space of policies (classification rules) such as costsensitive logistic regression and support vector machines. In these cases, the space of classification rules is exponential in the number of features, but these problems can be efficiently solved using convex optimization.
Our goal here is to efficiently solve the contextual bandit problems for similarly large policy spaces. We do this by reducing the contextual bandit problem to costsensitive classification. Given a supervised costsensitive learning algorithm as an oracle (Beygelzimer et al., 2009), our algorithm runs in time only while achieving regret , where is the number of possible policies (classification rules), is the number of actions (classes), and is the number of time steps. This efficiency is achieved in a modular way, so any future improvement in costsensitive learning immediately applies here.
1.1 Previous Work and Motivation
All previous regretoptimal approaches are measure based—they work by updating a measure over policies, an operation which is linear in the number of policies. In contrast, regret guarantees scale only logarithmically in the number of policies. If not for the computational bottleneck, these regret guarantees imply that we could dramatically increase performance in contextual bandit settings using more expressive policies. We overcome the computational bottleneck using an algorithm which works by creating costsensitive classification instances and calling an oracle to choose optimal policies. Actions are chosen based on the policies returned by the oracle rather than according to a measure over all policies. This is reminiscent of AdaBoost (Freund and Schapire, 1997), which creates weighted binary classification instances and calls a “weak learner” oracle to obtain classification rules. These classification rules are then combined into a final classifier with boosted accuracy. Similarly as AdaBoost converts a weak learner into a strong learner, our approach converts a costsensitive classification learner into an algorithm that solves the contextual bandit problem.
In a more difficult version of contextual bandits, an adversary chooses given knowledge of the learning algorithm (but not any random numbers). All known regretoptimal solutions in the adversarial setting are variants of the EXP4 algorithm (Auer et al., 2002b). EXP4 achieves the same regret rate as our algorithm: , where is the number of time steps, is the number of actions available in each time step, and is the number of policies.
Why not use EXP4 in the i.i.d. setting? For example, it is known that the algorithm can be modified to succeed with high probability (Beygelzimer et al., 2011), and also for VC classes when the adversary is constrained to i.i.d. sampling. There are two central benefits that we hope to realize by directly assuming i.i.d. contexts and reward vectors.

Computational Tractability. Even when the reward vector is fully known, adversarial regrets scale as while computation scales as in general. One attempt to get around this is the followtheperturbedleader algorithm (Kalai and Vempala, 2005) which provides a computationally tractable solution in certain specialcase structures. This algorithm has no mechanism for efficient application to arbitrary policy spaces, even given an efficient costsensitive classification oracle. An efficient costsensitive classification oracle has been shown effective in transductive settings (Kakade and Kalai, 2005). Aside from the drawback of requiring a transductive setting, the regret achieved there is substantially worse than for EXP4.

Improved Rates. When the world is not completely adversarial, it is possible to achieve substantially lower regrets than are possible with algorithms optimized for the adversarial setting. For example, in supervised learning, it is possible to obtain regrets scaling as with a problem dependent constant (Bartlett et al., 2007). When the feedback is delayed by rounds, lower bounds imply that the regret in the adversarial setting increases by a multiplicative while in the i.i.d. setting, it is possible to achieve an additive regret of (Langford et al., 2009).
In a direct i.i.d. setting, the previousbest approach using a costsensitive classification oracle was given by greedy and epoch greedy algorithms (Langford and Zhang, 2007) which have a regret scaling as in the worst case.
There have also been many specialcase analyses. For example, theory of contextfree setting is well understood (Lai and Robbins, 1985; Auer et al., 2002a; EvenDar et al., 2006). Similarly, good algorithms exist when rewards are linear functions of features (Auer, 2002) or actions lie in a continuous space with the reward function sampled according to a Gaussian process (Srinivas et al., 2010).
1.2 What We Prove
In Section 3 we state the PolicyElimination algorithm, and prove the following regret bound for it.
Theorem 4.
For all distributions over with actions, for all sets of policies , with probability at least , the regret of PolicyElimination (Algorithm 1) over rounds is at most
This result can be extended to deal with VC classes, as well as other special cases. It forms the simplest method we have of exhibiting the new analysis.
The new key element of this algorithm is identification of a distribution over actions which simultaneously achieves small expected regret and allows estimating value of every policy with small variance. The existence of such a distribution is shown nonconstructively by a minimax argument.
PolicyElimination is computationally intractable and also requires exact knowledge of the context distribution (but not the reward distribution!). We show how to address these issues in Section 4 using an algorithm we call RandomizedUCB. Namely, we prove the following theorem.
Theorem 5.
For all distributions over with actions, for all sets of policies , with probability at least , the regret of RandomizedUCB (Algorithm 2) over rounds is at most
RandomizedUCB’s analysis is substantially more complex, with a key subroutine being an application of the ellipsoid algorithm with a costsensitive classification oracle (described in Section 5). RandomizedUCB does not assume knowledge of the context distribution, and instead works with the history of contexts it has observed. Modifying the proof for this empirical distribution requires a covering argument over the distributions over policies which uses the probabilistic method. The net result is an algorithm with a similar toplevel analysis as PolicyElimination, but with the running time only polylogarithmic in the number of policies given a costsensitive classification oracle.
Theorem 11.
In each time step , RandomizedUCB makes at most calls to costsensitive classification oracle, and requires additional processing time.
Apart from a tractable algorithm, our analysis can be used to derive tighter regrets than would be possible in adversarial setting. For example, in Section 6, we consider a common setting where reward feedback is delayed by rounds. A straightforward modification of PolicyElimination yields a regret with an additive term proportional to compared with the delayfree setting. Namely, we prove the following.
Theorem 12.
For all distributions over with actions, for all sets of policies , and all delay intervals , with probability at least , the regret of DelayedPE (Algorithm 3) is at most
We start next with precise settings and definitions.
2 Setting and Definitions
2.1 The Setting
Let be the set of actions, let be the domain of contexts , and let be an arbitrary joint distribution on . We denote the marginal distribution of over by .
We denote to be a finite set of policies , where each policy , given a context in round , chooses the action . The cardinality of is denoted by . Let be the vector of rewards, where is the reward of action on round .
In the i.i.d. setting, on each round , the world chooses i.i.d. according to and reveals to the learner. The learner, having access to , chooses action . Then the world reveals reward (which we call for short) to the learner, and the interaction proceeds to the next round.
We consider two modes of accessing the set of policies . The first option is through the enumeration of all policies. This is impractical in general, but suffices for the illustrative purpose of our first algorithm. The second option is an oracle access, through an argmax oracle, corresponding to a costsensitive learner:
Definition 1.
For a set of policies , an argmax oracle ( for short), is an algorithm, which for any sequence , , , computes
The reason why the above can be viewed as a costsensitive classification oracle is that vectors of rewards can be interpreted as negative costs and hence the policy returned by is the optimal costsensitive classifier on the given data.
2.2 Expected and Empirical Rewards
Let the expected instantaneous reward of a policy be denoted by
The best policy is that which maximizes . More formally,
We define to be the history at time that the learner has seen. Specifically
where is the probability of the algorithm choosing action at time . Note that and are produced by the learner while are produced by nature. We write to denote choosing uniformly at random from the ’s in history .
Using the history of past actions and probabilities with which they were taken, we can form an unbiased estimate of the policy value for any :
The unbiasedness follows, because . The empirically best policy at time is denoted
2.3 Regret
The goal of this work is to obtain a learner that has small regret relative to the expected performance of over rounds, which is
(2.1) 
We say that the regret of the learner over rounds is bounded by with probability at least , if
where the probability is taken with respect to the random pairs for , as well as any internal randomness used by the learner.
We can also define notions of regret and empirical regret for policies . For all , let
Our algorithms work by choosing distributions over policies, which in turn then induce distributions over actions. For any distribution over policies , let denote the induced conditional distribution over actions given the context :
(2.2) 
In general, we shall use , and as conditional probability distributions over the actions given contexts , i.e., such that is a probability distribution over (and similarly for and ). We shall think of as a smoothed version of with a minimum action probability of (to be defined by the algorithm), such that
Conditional distributions such as (and , , etc.) correspond to randomized policies. We define notions true and empirical value and regret for them as follows:
3 Policy Elimination
The basic ideas behind our approach are demonstrated in our first algorithm: PolicyElimination (Algorithm 1).
Let and
history
Define:
Define:
Define:
For each timestep , observe and do:

Choose distribution over s.t. :

Let for all

Choose

Observe reward

Let

Let
The key step is Step 1, which finds a distribution over policies which induces low variance in the estimate of the value of all policies. Below we use minimax theorem to show that such a distribution always exists. How to find this distribution is not specified here, but in Section 5 we develop a method based on the ellipsoid algorithm. Step 2 then projects this distribution onto a distribution over actions and applies smoothing. Finally, Step 5 eliminates the policies that have been determined to be suboptimal (with high probability).
Algorithm Analysis
We analyze PolicyElimination in several steps. First, we prove the existence of in Step 1, provided that is nonempty. We recast the feasibility problem in Step 1 as a game between two players: Prover, who is trying to produce , and Falsifier, who is trying to find violating the constraints. We give more power to Falsifier and allow him to choose a distribution over (i.e., a randomized policy) which would violate the constraints.
Note that any policy corresponds to a point in the space of randomized policies (viewed as functions ), with . For any distribution over policies in , the induced randomized policy then corresponds to a point in the convex hull of . Denoting the convex hull of by , Prover’s choice by and Falsifier’s choice by , the feasibility of Step 1 follows by the following lemma:
Lemma 1.
Let be a compact and convex set of randomized policies. Let and for any , . Then for all distributions ,
Proof.
Let denote the inner expression of the minimax problem. Note that is:

everywhere defined: Since , we obtain that , hence the expectations are defined for all and .

linear in : Linearity follows from rewriting as

convex in : Note that is convex in by convexity of in , for , . Convexity of in then follows by taking expectations over and .
Hence, by Theorem 14 (in Appendix B), min and max can be reversed without affecting the value:
The righthand side can be further upperbounded by , which is upperbounded by
∎ 
Corollary 2.
The set of distributions satisfying constraints of Step 1 is nonempty.
Given the existence of , we will see below that the constraints in Step 1 ensure low variance of the policy value estimator for all . The small variance is used to ensure accuracy of policy elimination in Step 5 as quantified in the following lemma:
Lemma 3.
With probability at least , for all :

(i.e., is nonempty)

for all
Proof.
We will show that for any policy , the probability that deviates from by more that is at most . Taking the union bound over all policies and all time steps we find that with probability at least ,
(3.1) 
for all and all . Then:

By the triangle inequality, in each time step, for all , yielding the first part of the lemma.

Also by the triangle inequality, if for , then . Hence the policy is eliminated in Step 5, yielding the second part of the lemma.
It remains to show Eq. (3.1). We fix the policy and time , and show that the deviation bound is violated with probability at most . Our argument rests on Freedman’s inequality (see Theorem 13 in Appendix A). Let
i.e., . Let denote the conditional expectation . To use Freedman’s inequality, we need to bound the range of and its conditional second moment .
Since and , we have the bound
Next,
(3.2)  
(3.3) 
where Eq. (3.2) follows by boundedness of and Eq. (3.3) follows from the constraints in Step 1. Hence,
Since is decreasing for , we obtain that is nonincreasing (by separately analyzing , , ). Let be the first such that . Note that , so for , we have and . Hence, the deviation bound holds for .
This immediately implies that the cumulative regret is bounded by
(3.4)  
and gives us the following theorem.
Theorem 4.
For all distributions over with actions, for all sets of policies , with probability at least , the regret of PolicyElimination (Algorithm 1) over rounds is at most
4 The Randomized Ucb Algorithm
Let be the initial history.
Define the following quantities:
For each timestep , observe and do:

Let be a distribution over that approximately solves the optimization problem
(4.1) so that the objective value at is within of the optimal value, and so that each constraint is satisfied with slack .

Let be the distribution over given by
for all .

Choose .

Observe reward .

Let .
PolicyElimination is the simplest exhibition of the minimax argument, but it has some drawbacks:

The algorithm keeps explicit track of the space of good policies (like a version space), which is difficult to implement efficiently in general.

If the optimal policy is mistakenly eliminated by chance, the algorithm can never recover.

The algorithm requires perfect knowledge of the distribution over contexts.
These difficulties are addressed by RandomizedUCB (or RUCB for short), an algorithm which we present and analyze in this section. Our approach is reminiscent of the UCB algorithm (Auer et al., 2002a), developed for contextfree setting, which keeps an upperconfidence bound on the expected reward for each action. However, instead of choosing the highest upper confidence bound, we randomize over choices according to the value of their empirical performance. The algorithm has the following properties:

The optimization step required by the algorithm always considers the full set of policies (i.e., explicit tracking of the set of good policies is avoided), and thus it can be efficiently implemented using an argmax oracle. We discuss this further in Section 5.

Suboptimal policies are implicitly used with decreasing frequency by using a nonuniform variance constraint that depends on a policy’s estimated regret. A consequence of this is a bound on the value of the optimization, stated in Lemma 7 below.

Instead of , the algorithm uses the history of previously seen contexts. The effect of this approximation is quantified in Theorem 6 below.
The regret of RandomizedUCB is the following:
Theorem 5.
For all distributions over with actions, for all sets of policies , with probability at least , the regret of RandomizedUCB (Algorithm 2) over rounds is at most
The proof is given in Appendix D.4. Here, we present an overview of the analysis.
4.1 Empirical Variance Estimates
A key technical prerequisite for the regret analysis is the accuracy of the empirical variance estimates. For a distribution over policies and a particular policy , define
The first quantity is (a bound on) the variance incurred by an importanceweighted estimate of reward in round using the action distribution induced by , and the second quantity is an empirical estimate of using the finite sample drawn from . We show that for all distributions and all , is close to with high probability.
Theorem 6.
For any , with probability at least ,
for all distributions over , all , and all .
The proof appears in Appendix C.
4.2 Regret Analysis
Central to the analysis is the following lemma that bounds the value of the optimization in each round. It is a direct corollary of Lemma 24 in Appendix D.4.
Lemma 7.
If is the value of the optimization problem (4.1) in round , then
This lemma implies that the algorithm is always able to select a distribution over the policies that focuses mostly on the policies with low estimated regret. Moreover, the variance constraints ensure that good policies never appear too bad, and that only bad policies are allowed to incur high variance in their reward estimates. Hence, minimizing the objective in (4.1) is an effective surrogate for minimizing regret.
The bulk of the analysis consists of analyzing the variance of the importanceweighted reward estimates , and showing how they relate to their actual expected rewards . The details are deferred to Appendix D.
5 Using an Argmax Oracle
In this section, we show how to solve the optimization problem (4.1) using the argmax oracle () for our set of policies. Namely, we describe an algorithm running in polynomial time independent^{1}^{1}1Or rather dependent only on , the representation size of a policy. of the number of policies, which makes queries to to compute a distribution over policies suitable for the optimization step of Algorithm 2.
This algorithm relies on the ellipsoid method. The ellipsoid method is a general technique for solving convex programs equipped with a separation oracle. A separation oracle is defined as follows:
Definition 2.
Let be a convex set in . A separation oracle for is an algorithm that, given a point , either declares correctly that , or produces a hyperplane such that and are on opposite sides of .
We do not describe the ellipsoid algorithm here (since it is standard), but only spell out its key properties in the following lemma. For a point and , we use the notation to denote the ball of radius centered at .
Lemma 8.
Suppose we are required to decide whether a convex set is empty or not. We are given a separation oracle for and two numbers and , such that and if is nonempty, then there is a point such that . The ellipsoid algorithm decides correctly if is empty or not, by executing at most iterations, each involving one call to the separation oracle and additional processing time.
We now write a convex program whose solution is the required distribution, and show how to solve it using the ellipsoid method by giving a separation oracle for its feasible set using .
Fix a time period . Let be the set of all contexts seen so far, i.e. . We embed all policies in , with coordinates identified with . With abuse of notation, a policy is represented by the vector with coordinate if and otherwise. Let be the convex hull of all policy vectors . Recall that a distribution over policies corresponds to a point inside , i.e., , and that , where is as defined in Algorithm 2. Also define . In the following, we use the notation to denote a context drawn uniformly at random from .
Consider the following convex program:
(5.1)  
(5.2)  
(5.3) 
We claim that this program is equivalent to the RUCB optimization problem (4.1), up to finding an explicit distribution over policies which corresponds to the optimal solution. This can be seen as follows. Since we require , it can be interpreted as being equal to for some distribution over policies . The constraints (5.3) are equivalent to (4.1) by substitution .
The above convex program can be solved by performing a binary search over and testing feasibility of the constraints. For a fixed value of , the feasibility problem defined by (5.1)–(5.3) is denoted by .
We now give a sketch of how we construct a separation oracle for the feasible region of . The details of the algorithm are a bit complicated due to the fact that we need to ensure that the feasible region, when nonempty, has a nonnegligible volume (recall the requirements of Lemma 8). This necessitates having a small error in satisfying the constraints of the program. We leave the details to Appendix E. Modulo these details, the construction of the separation oracle essentially implies that we can solve .
Before giving the construction of the separation oracle, we first show that allows us to do linear optimization over efficiently:
Lemma 9.
Given a vector , we can compute using one invocation of .
Proof.
The sequence for consists of and . The lemma now follows since . ∎
We need another simple technical lemma which explains how to get a separating hyperplane for violations of convex constraints:
Lemma 10.
For , let be a convex function of , and consider the convex set defined by . Suppose we have a point such that . Let be a subgradient of at . Then the hyperplane separates from .
Proof.
Let . By the convexity of , we have for all . Thus, for any , we have . Since , we conclude that separates from . ∎
Now given a candidate point , a separation oracle can be constructed as follows. We check whether satisfies the constraints of . If any constraint is violated, then we find a hyperplane separating from all points satisfying the constraint.

Next, we consider constraint (5.2). To check if , we use the perceptron algorithm. We shift the origin to , and run the perceptron algorithm with all points being positive examples. The perceptron algorithm aims to find a hyperplane putting all policies on one side. In each iteration of the perceptron algorithm, we have a candidate hyperplane (specified by its normal vector), and then if there is a policy that is on the wrong side of the hyperplane, we can find it by running a linear optimization over in the negative normal vector direction as in Lemma 9.
If , then in a bounded number of iterations (depending on the distance of from , and the maximum magnitude ) we obtain a separating hyperplane. In passing we also note that if , the same technique allows us to explicitly compute an approximate convex combination of policies in that yields . This is done by running the perceptron algorithm as before and stopping after the bound on the number of iterations has been reached. Then we collect all the policies we have found in the run of the perceptron algorithm, and we are guaranteed that is close in distance to their convex hull. We can then find the closest point in the convex hull of these policies by solving a simple quadratic program.

Finally, we consider constraint (5.3). We rewrite as , where . Thus, , where , which can be computed by using once.
Next, using the candidate point , compute the vector defined as , where is the number of times appears in , so that . Now, the problem reduces to finding a policy which violates the constraint
Define . Note that is a convex function of . Finding a point that violates the above constraint is equivalent to solving the following (convex) program:
(5.4) (5.5) To do this, we again apply the ellipsoid method. For this, we need a separation oracle for the program. A separation oracle for the constraints (5.5) can be constructed as in Step 2 above. For the constraints (5.4), if the candidate solution has , then we can construct a separating hyperplane as in Lemma 10.
Working out the details carefully yields the following theorem, proved in Appendix E:
Theorem 11.
There is an iterative algorithm with iterations, each involving one call to and processing time, that either declares correctly that is infeasible or outputs a distribution over policies in such that satisfies
where and .
6 Delayed Feedback
In a delayed feedback setting, we observe rewards with a step delay according to:

The world presents features .

The learning algorithm chooses an action .

The world presents a reward for the action given the features .
Let
and history
Define:
and
Define:
For each timestep , observe and do:

Let

Choose distribution over s.t. :

Let

Choose

Observe reward .

Let

Let
Now we can prove the following theorem, which shows the delay has an additive effect on regret.
Theorem 12.
For all distributions over with actions, for all sets of policies , and all delay intervals , with probability at least , the regret of DelayedPE (Algorithm 3) is at most
Proof.
Acknowledgements
We thank Alina Beygelzimer, who helped in several formative discussions.
References
References
 Auer (2002) Peter Auer. Using confidence bounds for exploitationexploration tradeoffs. Journal of Machine Learning Research, 3:397–422, 2002.
 Auer et al. (2002a) Peter Auer, Nicolò CesaBianchi, and Paul Fischer. Finitetime analysis of the multiarmed bandit problem. Machine Learning, 47(2–3):235–256, 2002a.
 Auer et al. (2002b) Peter Auer, Nicolò CesaBianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal of Computing, 32(1):48–77, 2002b.
 Bartlett et al. (2007) P. L. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. In NIPS, 2007.
 Beygelzimer et al. (2009) Alina Beygelzimer, John Langford, and Pradeep Ravikumar. Error correcting tournaments. In ALT, 2009.
 Beygelzimer et al. (2011) Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, and Robert E. Schapire. Contextual bandit algorithms with supervised learning guarantees. In AISTATS, 2011.
 EvenDar et al. (2006) Eyal EvenDar, Shie Mannor, and Yishay Mansour. Action elimination and stopping conditions for the multiarmed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7:1079–1105, 2006.
 Freedman (1975) David A. Freedman. On tail probabilities for martingales. Annals of Probability, 3(1):100–118, 1975.
 Freund and Schapire (1997) Y. Freund and R. E. Schapire. A decisiontheoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119–139, 1997.
 Kakade and Kalai (2005) Sham M. Kakade and Adam Kalai. From batch to transductive online learning. In NIPS, 2005.
 Kalai and Vempala (2005) Adam Tauman Kalai and Santosh Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291–307, 2005.
 Lai and Robbins (1985) Tze Leung Lai and Herbert Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4–22, 1985.
 Langford et al. (2009) J. Langford, A. Smola, and M. Zinkevich. Slow learners are fast. In NIPS, 2009.
 Langford and Zhang (2007) John Langford and Tong Zhang. The epochgreedy algorithm for contextual multiarmed bandits. In NIPS, 2007.
 Sion (1958) Maurice Sion. On general minimax theorems. Pacific J. Math., 8(1):171–176, 1958.
 Srinivas et al. (2010) Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In ICML, 2010.
Appendix A Concentration Inequality
The following is an immediate corollary of Theorem 1 of (Beygelzimer et al., 2011). It can be viewed as a version of Freedman’s Inequality (Freedman, 1975). Let be a sequence of realvalued random variables. Let denote the conditional expectation and conditional variance.
Theorem 13 (Freedmanstyle Inequality).
Let such that , and for all , . Then for any such that , with probability at least ,
Appendix B Minimax Theorem
The following is a continuous version of Sion’s Minimax Theorem (Sion, 1958, Theorem 3.4).
Theorem 14.
Let and be compact and convex sets, and a function which for all is convex and continuous in and for all is concave and continuous in . Then