Variational Bayesian Optimistic Sampling
Year: 2022

Abstract:
We consider online sequential decision problems where an agent must balance exploration and exploitation. We derive a set of Bayesian ‘optimistic’ policies which, in the stochastic multi-armed bandit case, includes the Thompson sampling policy. We provide a new analysis showing that any algorithm producing policies in the optimistic set enjoys Õ( √ AT ) Bayesian regret for a problem with A actions after T rounds. We extend the regret analysis for optimistic policies to bilinear saddle-point problems which include zero-sum matrix games and constrained bandits as special cases. In this case we show that Thompson sampling can produce policies outside of the optimistic set and suffer linear regret in some instances. Finding a policy inside the optimistic set amounts to solving a convex optimization problem and we call the resulting algorithm ‘variational Bayesian optimistic sampling’ (VBOS). The procedure works for any posteriors, i.e., it does not require the posterior to have any special properties, such as log-concavity, unimodality, or smoothness. The variational view of the problem has many useful properties, including the ability to tune the exploration-exploitation tradeoff, add regularization, incorporate constraints, and linearly parameterize the policy.

text: √ AT ) Bayesian regret for a problem with
A actions after T rounds. We extend the regret analysis for optimistic policies to bilinear saddle-point problems which include zero-sum matrix games and constrained bandits as special cases. In this case we show that Thompson sampling can produce policies outside of the optimistic set and suffer linear regret in some instances. Finding a policy inside the optimistic set amounts to solving a convex optimization problem and we call the resulting algorithm ‘variational Bayesian optimistic sampling’ (VBOS). The procedure works for any posteriors, i.e., it does not require the posterior to have any special properties, such as log-concavity, unimodality, or smoothness. The variational view of the problem has many useful properties, including the ability to tune the exploration-exploitation tradeoff, add regularization, incorporate constraints, and linearly parameterize the policy.

heading: 1 Introduction
text: In this manuscript we consider online learning, in particular the multi-armed stochastic bandit problem [19] and its extension to bilinear saddle-point problems. Thompson sampling (TS) is a wellknown Bayesian algorithm to tackle this problem [37, 35]. At each iteration TS samples an action according to the posterior probability that it is the optimal action. However, it never computes these probabilities, instead TS samples from the posterior of each arm and then acts greedily with respect to that sample, which is an implicit sample from the posterior probability of optimality. TS enjoys strong theoretical guarantees [1, 35] as well as excellent practical performance [6]. Moreover, it has an elegant information-theoretic interpretation of an agent that is making a tradeoff between information accumulation and regret [34]. That being said it does have several weaknesses. Firstly, TS requires samples from the true posterior, which may be intractable for some problems. It is known that TS with even small error in its posterior samples can suffer linear regret [32]. In many cases of interest the posterior distribution is highly intractable to sample from and running MCMC chains, one for each arm, can be wasteful and slow and still not yield precise enough samples for good performance, though recent work has attempted to improve this situation [22]. Moreover, TS is unable to take into account other preferences, such as constraints or the presence of other agents. In particular, it was recently shown that TS can suffer linear regret in two-player zero sum games [27] and we shall demonstrate the same phenomenon in this work empirically for constrained bandits. Finally, when performing TS the user never has direct access to the posterior probability of optimality, only samples from that distribution (though the distribution can be estimated by taking many samples). In some practical applications having access to the policy is desirable, for example to ensure safety constraints or to allocate budgets.
35th Conference on Neural Information Processing Systems (NeurIPS 2021).
In this paper we present ‘variational Bayesian optimistic sampling’ (VBOS), a new Bayesian approach to online learning. At every step the VBOS algorithm solves a convex optimization problem over the simplex. The solution to this problem is a policy that satisfies a particular ‘optimism’ condition. The problem is always convex, no matter what form the posteriors take. The only requirement is the ability to compute or estimate the cumulant generating function of the posteriors. VBOS and TS can be considered as part of the same family of algorithms since, in the bandit case, they both produce policies inside the optimistic set. That being said, VBOS has several advantages over TS. First, in some cases estimating or bounding the cumulant generating function may be easier than sampling from the posterior. Second, incorporating additional requirements such as constraints, opponents or tuning the exploration exploitation tradeoff is easy in VBOS - just change the optimization problem. Finally, when using VBOS we always have direct access to the policy, rather than just implicit samples from it, as well as an explicit upper bound on the expected value of the problem, which TS does not give us. Here we list the contributions of this work.

heading: 1.1 Contributions
text: 1. We derive a set of ‘optimistic’ Bayesian policies for the stochastic multi-armed bandit that satisfy a particular optimism inequality and which includes the TS policy. 2. We present a new, simple proof of a Õ( √ AT ) regret-bound for a bandit with A arms after
T timesteps that covers any policy in the optimistic set (Õ ignores logarithmic factors).
3. We derive variational Bayesian optimistic sampling (VBOS), which is a policy in the optimistic set that can be computed by solving a convex optimization problem.
4. We show that, unlike TS, the variational formulation easily handles more complicated problems, such as bilinear saddle-point problems which include as special cases zero-sum two player games and constrained bandits.

heading: 1.2 Preliminaries
text: A stochastic multi-armed bandit problem is a sequential learning problem in which an agent interacts with an environment in order to maximize its total cumulative reward. Initially the agent does not know how the rewards are distributed and must learn about them from experience. In each round t ∈ N the agent selects an action at ∈ {1, . . . , A} and receives a reward rt = µat + ηtat where η t at ∈ R is zero-mean noise associated with action at at time t. We define Ft = (a1, r1, . . . , at−1, rt−1) to be the sequence of actions and rewards observed by the agent prior to round t, and as shorthand we shall use the notation Et(·) = E( · | Ft). An algorithm alg is a measurable mapping that takes the entire history at time t and produces a probability distribution, the policy, from which the agent samples its action. In order to assess the quality of an algorithm alg we consider the regret, or shortfall in cumulative rewards relative to the optimal value,
Regret(µ, alg, T ) = Eη,alg [ T∑ t=1 max i µi − rt ] , (1)
where Eη,alg denotes the expectation with respect to the noise process η and any randomness in the algorithm. This quantity (1) depends on the unknown expected reward µ ∈ RA, which is fixed at the start of play and kept the same throughout. To assess the quality of learning algorithms designed to work across some familyM of problems we define
BayesRegret(φ, alg, T ) = Eµ∼φRegret(µ, alg, T ) (2)
where φ is a prior probability measure over µ ∈M that assigns relative importance to each problem instance and which we assume is known to the algorithm.

heading: 2 Thompson sampling and a variational approach
text: The algorithm that minimizes the Bayesian regret (2) is called the Bayes-optimal policy, but it is believed to be intractable to compute in most cases [10]. With that in mind we would like an algorithm that is computationally tractable and still guarantees a good bound on the Bayesian regret.
TS is a Bayesian algorithm that at each time step samples possible values of each arm from their respective posteriors and acts greedily with respect to those samples; see Algorithm 1. This simple strategy provides a principled approach to the exploration-exploitation tradeoff in the stochastic multi-armed bandit problem. In this section we derive a set of ‘optimistic’ policies, which includes the TS policy, and we shall show that any algorithm that produces policies in this set satisfies a guaranteed Bayesian regret bound. For brevity we defer all proofs to the appendices.

heading: 2.1 Bounding the conditional expectation
text: The Bayesian regret (2) depends on the expectation of the maximum over a collection of random variables. Here we shall derive an upper bound on this quantity, starting with a generic upper bound on the conditional expectation.
If X : Ω → Rd is a random variable in Ld1 (i.e., E|Xi| < ∞ for each i = 1, . . . , d) then we denote by ΨX : Rd → R ∪ {∞} the cumulant generating function of X − EX , i.e.,
ΨX(β) = logE exp(β>(X − EX)).
This function is always convex, and we shall assume throughout this manuscript that it is also closed and proper for any random variables we encounter. With this definition we can present a bound on the conditional expectation.
Lemma 1. Let X : Ω → R be a random variable on (Ω,F ,P) satisfying X ∈ L1, and let A ∈ F be an event with P(A) > 0. Then, for any τ ≥ 0
E[X|A] ≤ EX + τΨX(1/τ)− τ logP(A). (3)
The right hand side of (3) involves the perspective of ΨX and so is convex in τ [4] and we can minimize over τ ≥ 0 to find the tightest bound, which we do next. Recall that the convex conjugate of function f : Rd → R is denoted f∗ : Rd → R and is given by f∗(y) = supx ( x>y − f(x) ) [4].
Theorem 1. Let X : Ω → R be a random variable such that the interior of the domain of ΨX is non-empty, then under the same assumptions as Lemma 1 we have 1
E[X|A] ≤ EX + (Ψ∗X)−1(− logP(A)).
For example, if X ∼ N (0, σ2), then for any event A we can bound the conditional expectation as E[X|A] ≤ σ √ −2 logP(A), no matter how X and A are related. This inequality has clear connections to Kullback’s inequality [8] and the Donsker-Varadhan variational representation of KL-divergence [11, Thm. 3.2]. The function Ψ∗ is referred to as the Cramér function or the rate function in large deviations theory [39]. The inverse of the rate function comes up in several contexts, such as queuing theory and calculating optimal insurance premiums [21]. Cramér’s theorem tells us that the probability of a large deviation of the empirical average of a collection of IID random variables decays exponentially with more data, and that the decay constant is the rate function. It is no surprise then that the regret bound we derive will depend on the inverse of the rate function, i.e., when the tails decay faster we incur less regret.

heading: 2.2 The optimistic set
text: Using Theorem 1 we next derive the maximal inequality we shall use to bound the regret.
Lemma 2. Let µ : Ω → RA, µ ∈ LA1 , be a random variable, let i? = argmaxi µi (ties broken arbitrarily) and denote by Ψi := Ψµi , then
Emax i µi ≤ A∑ i=1 P(i? = i) ( Eµi + (Ψ∗i )−1(− logP(i? = i)) ) .
Note that Lemma 2 makes no assumption of independence of each entry of µ, the bound holds even in the case of dependency.
1If ΨX = 0, then we take (Ψ∗X) −1 = 0.
In the context of online learning πTSi = P(i? = i) is exactly the TS policy when µi have the laws of the posterior. For ease of notation we introduce the ‘optimism’ map Gtφ : ∆A → R which for a random variable µ : Ω→ RA distributed according to φ(· | Ft) is given by
Gtφ(π) := A∑ i=1 πi ( Etµi + (Ψt∗i )−1(− log πi) ) , (4)
where ∆A denotes the probability simplex of dimension A − 1 and Ψti := Ψµi|Ft . Note that Gtφ is concave since Ψti is convex [4]. Moreover, if the random variables are non-degenerate then Gtφ is differentiable and the gradient can be computed using Danskin’s theorem [7].
With this notation we can write Et maxi µi ≤ Gtφ(πTS). This brings us to the ‘optimistic’ set of probability distributions, which corresponds to the set of policies that satisfy that same inequality. Definition 1. Let µ : Ω → RA be a random variable distributed according to φ(· | Ft), then we define the optimistic set as
Ptφ := {π ∈ ∆A | Et max i µi ≤ Gtφ(π)}.
Immediately we have two facts about the set Ptφ. First, it is non-empty since πTS ∈ Ptφ, and second, it is a convex set since the optimism map Gtφ is concave.

heading: 2.3 Variational Bayesian optimistic sampling
text: Since the TS policy is in Ptφ, it implies that we can maximize the bound and also obtain a policy in Ptφ, since
Et max i µi ≤ Gtφ(πTS) ≤ max π∈∆A Gtφ(π). (5)
We refer to the policy that maximizes Gtφ as the ‘variational Bayesian optimistic sampling’ policy (VBOS) and present the VBOS procedure as Algorithm 2. VBOS produces a policy πt ∈ Ptφ at each round by construction. The maximum is guaranteed to exist since ∆A is compact and Gtφ is continuous. The problem of maximizing Gtφ is a concave maximization problem, and is thus computationally tractable so long as each Ψti is readily accessible. This holds no matter what form the posterior distribution takes. This means we don’t rely on any properties like log-concavity, unimodality, or smoothness of the distribution for tractability of the optimization problem.
As an example, consider the case where each µi ∼ N (0, σ2) independently. In this instance we recover the familiar bound of Emaxi µi ≤ Gφ(πTS) = maxπ∈∆A Gφ(π) = σ √ 2 logA. The variational form allows us to compute a bound in the case of differently distributed random variables.
Algorithm 1 TS for bandits for round t = 1, 2, . . . , T do
sample µ̂t ∼ φ(· | Ft) choose at ∈ argmaxi µ̂ti
end for
Algorithm 2 VBOS for bandits for round t = 1, 2, . . . , T do
compute πt = argmaxπ∈∆A G t φ(π)
sample at ∼ πt end for

heading: 2.4 Regret analysis
text: Now we shall present regret bounds for algorithms that produce policies in the optimistic set. These bounds cover both TS and VBOS. Lemma 3. Let alg produce any sequence of policies πt, t = 1, . . . , T , that satisfy πt ∈ Ptφ, then
BayesRegret(φ, alg, T ) ≤ E T∑ t=1 A∑ i=1 πti(Ψ t∗ i ) −1(− log πti).
This bound is generic in that it holds for any set of posteriors and any algorithm producing policies in Ptφ. The regret depends on the inverse rate functions of the posteriors, no matter how complicated
those posteriors may be, and faster concentrating posteriors, i.e., larger rate functions, will have lower regret. Loosely speaking, as more data accumulates the posteriors concentrate towards the true value (under benign conditions [38, Ch. 10.2]), implying (Ψt∗i )
−1 → 0. By carefully examining the rate of concentration of the posteriors we can derive concrete regret bounds in specific cases, such as the standard sub-Gaussian reward noise case, which we do next.
Theorem 2. Let alg produce any sequence of policies πt, t = 1, . . . , T , that satisfy πt ∈ Ptφ and assume that both the prior and reward noise are 1-sub-Gaussian for each arm, then
BayesRegret(φ, alg, T ) ≤ √ 2AT logA(1 + log T ) = Õ( √ AT ).
The assumption that the prior is 1-sub-Gaussian is not really necessary and can be removed if, for example, we assume the algorithm pulls each arm once at the start of the procedure. Theorem 2 bounds the regret of both TS and VBOS, as well as any other algorithm producing optimistic policies. The point of this theorem is not to provide the tightest regret bound but to provide some insight into the question of how close to the true TS policy another policy has to be in order to achieve similar (in particular sub-linear) regret. We have provided one answer - any policy in the optimistic set Ptφ for all t, is close enough. However, this set contracts as more data accumulates (as the posteriors concentrate) so it becomes harder to find good approximating policies. That being said, the VBOS policy is always sufficiently close because it is always in the optimistic set. In Figure 1 we show the progression of a single realization of the set Ptφ over time for a three-armed Gaussian bandit with Gaussian prior and where the policy being followed is TS [13]. Initially, Ptφ is quite wide, but gradually as more data accrues it concentrates toward the optimal arm vertex of the simplex.

heading: 3 Connections and interpretations of VBOS
text: Exploration-exploitation tradeoff. Examining the problem that is solved to determine the VBOS policy we can break it into two components
Gtφ(π) = A∑ i=1
πiEtµi︸ ︷︷ ︸ exploit +
A∑ i=1
πi(Ψ t∗ i ) −1(− log πi)︸ ︷︷ ︸
explore
,
the first term of which includes the expected reward (under the posterior) from pulling each arm and is the agent’s current understanding of the world, and the second term consists only of the uncertainty in each arm. The policy that maximizes this function is balancing this exploration and exploitation tradeoff, with a tradeoff parameter of one. In some practical instances it may be beneficial to use a different tradeoff parameter other than one, e.g., when there are a larger number of arms than the total number of rounds to play. In this case VBOS can easily be tuned to be more or less exploring as needed.
Upper confidence bounds. Here we show a connection between VBOS and upper confidence bound (UCB) methods [18, 2]. The Chernoff inequality tells us that the tail probability of random variable µ : Ω → R can be bounded as P(µ − Eµ > ) ≤ exp(−Ψ∗µ( )), for any ≥ 0. UCB algorithms build upper confidence intervals which contain the true value of the random variable with high-probability [18, 2, 16]. If we want the interval to contain the true value of µ with probability at least 1− δ it requires setting = (Ψ∗µ)−1(− log δ), yielding Eµ+ (Ψ∗µ)−1(− log δ) ≥ µ with high probability. UCB approaches to the stochastic multi-armed bandit typically choose the largest upper confidence bound (the ‘optimism in the face of uncertainty’ approach), that is, at time t they select action
at ∈ argmax i (Etµi + (Ψt∗i )−1(− log δt)),
for some schedule δt. A lot of work goes into tuning δt for various applications. By contrast, VBOS samples from policy
at ∼ argmax π∈∆A A∑ i=1 πi ( Etµi + (Ψt∗i )−1(− log πi) ) .
It is clear that VBOS is building upper confidence bounds on the values of each arm that depend on the value of the policy, since if we denote π? the maximizer to the above problem, then Pt(Etµi + (Ψt∗i )
−1(− log π?i ) < µi) ≤ π?i . This procedure gives higher ‘bonuses’ to arms that end up with lower probability of being pulled, and lower bonuses to arms with high probability of being pulled, which is similar to what is done in more sophisticated UCB algorithms such as KL-UCB+ [17, 9, 14]. This is desirable because if the mean of an arm is low then there is a chance this is simply because we have under-estimated it and perhaps we should pay more attention to that arm. In this light VBOS can be interpreted as a stochastic Bayesian UCB approach [16]. One advantage is that we do not have to tune a schedule δt, like TS our algorithm is randomized and stationary, i.e., it does not depend on how many time-steps have elapsed other than implicitly through the posteriors.
K-learning. K-learning is an algorithm originally developed for efficient reinforcement learning in MDPs where it enjoys a similar regret bound to TS [23, 30, 31]. For bandits, the agent policy at time t is given by
τ?t = argmin τ≥0
( τ log
A∑ i=1 exp(Etµi/τ + Ψti(1/τ)) ) , πti ∝ exp(Etµi/τ?t + Ψti(1/τ?t )). (6)
It can be shown that this is equivalent to VBOS when the ‘temperature’ parameters τi that we optimize over are constrained to be equal for each arm. Although K-learning and VBOS have essentially the same regret bound, this can make a large difference in practice. This connection also suggests that recent reinforcement learning algorithms that rely on the log-sum-exp operator, the ‘soft’ max family [12, 20, 28, 33], are also in some sense approximating the VBOS policy, although as made clear in [29] these approaches do not correctly model the uncertainty and so will suffer linear regret in general.

heading: 4 Bilinear saddle-point problems
text: In this section we extend the above analysis to constrained bilinear saddle-point problems, which include as special cases zero-sum two player games and constrained multi-armed bandits, as well as standard stochastic multi-armed bandits. Equipped with the tools from the previous sections we shall formulate a convex optimization problem that when solved yields the VBOS policy at each round, and prove that in two special cases this strategy yields a sub-linear regret bound. It is known, and we shall demonstrate empirically, that TS (Algorithm 3) can fail, i.e., suffer linear regret for some instances in this more general regime [27, §3.2]. Consequently, this is the first setting where the variational approach is substantially more powerful than TS.
A finite dimensional, constrained, bilinear saddle-point problem is defined by a matrix R ∈ Rm×A and two non-empty convex sets Π ⊆ RA, Λ ⊆ Rm which are the feasible sets for the maximizer and minimizer respectively. Here we shall assume that the agent is the maximizer, i.e., that Π = ∆A, and that the agent is uncertain about the entries of R and must learn about them from experience. The saddle-point problem has optimal value given by
V ?R,Λ := min λ∈Λ max π∈∆A λ>Rπ = max π∈∆A min λ∈Λ λ>Rπ (7)
where we can swap the order of the min-max due to the minimax theorem [40]. Unlike the stochastic multi-armed bandit case the maximizing policy in the bilinear saddle-point is typically stochastic, and as such the agent will return a policy rather than a single action at each time-step. This is to allow the case, for example, an opponent who gets to know the agent policy in advance of selecting their own action. We shall consider the case where at each time period the agent produces policy πt ∈ ∆A over columns of R from which action at ∈ {1, . . . , A} is sampled, and receives reward rt ∈ R and observation ot ∈ O where either the reward, observation, or both are corrupted by noise ηt. The exact reward, noise, observation, and opponent space Λ will depend on the problem setup. For instance, the vanilla stochastic multi-armed bandit is a special case of this problem where Λ is a singleton and the agent receives bandit feedback associated with the action sampled from its policy (i.e., ot = rt = Rat + η t at ). The information available to the agent at the start of round t is given by Ft = {a1, o1, . . . , at−1, ot−1}. In this setup we define the Bayesian regret to be
BayesRegret(φ, alg, T ) = ER∼φ ( Eη,alg
T∑ t=1 (V ?R,Λ − rt)
) .
Analogously to the stochastic multi-armed bandit case we can define the optimism map and the optimistic set. Let Rj : Ω → Rm, j = 1, . . . , A, denote the random variable corresponding to the jth column of R, denote by Ψtj : Rm → R the cumulant generating function of Rj − EtRj , then assuming that Rj ∈ Lm1 we define the optimism map in this case to be
Gtφ,Λ(π) := min λ∈Λ,τ≥0 A∑ j=1 πj(λ >EtRj + τjΨtj(λ/τj)− τj log πj) (8)
and the optimistic set to be
Ptφ,Λ := {π ∈ ∆A | EtV ?R,Λ ≤ Gtφ,Λ(π)}. (9)
With these we can bound EtV ?R,Λ using the techniques we have previously developed.
Lemma 4. Assuming that R ∈ Lm×A1 we have EtV ?R,Λ ≤ max
π∈∆A Gtφ,Λ(π). (10)
This lemma motivates the VBOS algorithm for bilinear saddle-points, presented as Algorithm 4. VBOS produces policies πt ∈ Ptφ,Λ for all t by construction. On the other hand, in some cases TS can produce policies πt 6∈ Ptφ,Λ, which we shall show by counter-example in the sequel.
At first glance maximizing Gtφ,Λ might seem challenging, but we can convert it into a convex minimization problem by maximizing over π to yield dual convex optimization problem:
minimize V + ∑A j=1 τj exp(sj/τj) subject to sj ≥ λ>EtRj + τjΨtj(λ/τj)− V − τj , j = 1, . . . , A τ ≥ 0, λ ∈ Λ,
(11)
over variables τ ∈ RA, λ ∈ Rm, s ∈ RA, V ∈ R. The VBOS distribution can be recovered using π?i = exp(s ? i /τ ? i ). Problem (11) is an exponential cone program and can be solved efficiently using modern methods [25, 26, 36, 24].
Algorithm 3 TS for saddle-points for round t = 1, 2, . . . , T do
sample R̂t ∼ φ(· | Ft) set πt = argmax
π∈∆A min λ∈Λ
λ>R̂tπ
end for
Algorithm 4 VBOS for saddle-points for round t = 1, 2, . . . , T do
set πt = argmaxGtφ,Λ(π) end for

heading: 4.1 Zero-sum two-player games
text: Consider the problem of an agent playing a two-player zero-sum matrix game against an opponent. In this setting the agent ‘column player’ selects a column index j ∈ {1, . . . , A} and the ‘row player’
selects a row index i ∈ {1, . . . ,m}, possibly with knowledge about the policy the agent is using to select the column. Note that in this case Λ = ∆m. These choices are revealed to the players and the row player makes a payment of rt = Rij + ηtij to the column player, where η t ij is a zero-mean noise term associated with actions i, j at time t, and the observation the agents receive is the reward and the actions of both players. The optimal strategies (π?, λ?) are a Nash equilibrium for the game [40, 5]. We shall assume that the agent we control is the column player, and that we have no control over the actions of the opponent. It was recently shown that both K-learning and UCB variants enjoy sub-linear regret bounds in this context [27]. Here we prove a regret bound for policies in the optimistic set under a sub-Gaussian assumption. Theorem 3. Let alg produce any sequence of policies πt, t = 1, . . . , T , that satisfy πt ∈ Ptφ,Λ and let the opponent produce any policies λt, t = 1, . . . , T , adapted to Ft. Assuming that the prior over each entry of R and reward noise are 1-sub-Gaussian we have
BayesRegret(φ, alg, T ) ≤ √ 2AmT logA(1 + log T ) = Õ( √ mAT ).
In Figure 2 we show how five agents perform on a 50 × 50 randomly generated game in self-play and against a best-response opponent. The entries of R were sampled from prior N (0, 1) and the noise term ηt at each time-period was also sampled fromN (0, 1). In self-play the opponent has the same knowledge and is applying the same algorithm to generate the policy at each time-step. The best-response opponent knows the matrix M exactly as well as the policy that the agent produces and picks the action that minimizes the reward to the agent. The matrix is the same in both cases. We compare the K-learning and UCB algorithms as described in [27] as well as EXP3 [3], a generic adversarial bandit algorithm, VBOS Algorithm 4, and TS Algorithm 3 over 8 seeds. As can be seen VBOS is the best performing algorithm in both cases, followed closely by K-learning. Although performing moderately well in self-play, it is no surprise that TS does very poorly against the bestresponse opponent since it is sometimes susceptible to exploitation, as we show next.
Consider the two-player zero-sum game counter-example presented in [27]. Here Λ = ∆2, and
R =
[ r 0
0 −1
] , r = { 1 with probability 1/2 −1 with probability 1/2.
(12)
In this case TS will play one of two policies: πTS,1 = [1, 0] or πTS,2 = [1/2, 1/2], each with probability 1/2. A quick calculation yields EV ?R,Λ = −1/4 and Gφ,Λ(πTS,2) = −1/2, so with probability 1/2 TS will produce a policy not in the optimistic set, since Gφ,Λ(πTS,2) < EV ?R,Λ. Now, consider the case where r = 1 and the opponent plays the strategy [0, 1] in every round. Then every time TS produces πTS,2 it will incur expected regret of 1/4. Since the value of r is never revealed the uncertainty is never resolved and so this pattern continues forever. This manifests as linear regret for TS in this instance. By contrast VBOS always produces πVBOS = [1, 0] and so suffers no regret.
In Figure 3 we show a realization of Ptφ,Λ over time for an agent following the VBOS policy in a randomly generated 3× 3 zero-sum two-player game. Observe that the TS algorithm has produced policies outside the optimistic set, but VBOS remains inside at all times. Note that this does not prove that TS will suffer linear regret, since membership of the optimistic set is only a sufficient, not necessary, condition.

heading: 4.2 Constrained bandits
text: In constrained bandits we want to find the policy that maximizes expected reward subject to a set of constraints. The constraints specify that the expected value of other reward functions associated with the same arms, which are also initially unknown, are larger than zero. Formally, we have the usual unknown reward vector µ1 ∈ RA we want to maximize as well as m − 1 other unknown reward vectors µ2, . . . , µm ∈ RA that define the constraints. When there is zero uncertainty we want to solve the following primal-dual linear-programming pair
maximize µ>1 π subject to µ>i π ≥ 0, i = 2, . . . ,m
π ∈ ∆A
minimize V subject to ∑m i=1 µiλi ≤ V 1
λ ≥ 0, λ1 = 1,
over primal variable π ∈ ∆A and dual variables V ∈ R and λ ∈ Rm, and where 1 denotes the vector of all ones. We denote by (π?, λ?) any optimal primal-dual points.
When there is uncertainty in the reward vectors, then we must be careful to ensure that the Bayesian regret is well-defined. If the support of the prior includes infeasible problems, which have optimal value −∞, then the expectation of the regret under that prior is unbounded below. However, if we make the assumption that ‖λ?‖2 ≤ C for some C > 0 φ-almost surely, which implies that the problem is feasible almost surely, then the Bayesian regret is well-defined and we can derive a regret bound that will depend on C. With this in mind we define the set Λ = {λ ∈ Rm | λ1 = 1, λ ≥ 0, ‖λ‖2 ≤ C}. Let R ∈ Rm×A be the matrix with the reward vectors µ1, . . . , µm stacked row-wise, then we can write the Lagrangian for the above primal-dual pair as Equation (7), i.e., this problem is a constrained bilinear saddle-point problem in terms of the primal-dual variables π and λ.
At each round t the agent produces a policy πt from which a column is sampled and the agent receives observation vector ot = (µ1j + ηt1j , µ2j + η t 2j , . . . , µmj + η t mj) where j is the index of the sampled column and ηtij is zero-mean noise for entry i, j. We define the reward at each timeperiod to be rt = minλ∈Λ λ>Rπt. We choose this reward for two reasons, firstly the regret with this reward is always non-negative, and secondly if the regret is zero then the corresponding policy πt is optimal for the linear program since it is a maximizer of the saddle-point problem [4]. Unlike the previous examples the agent never observes this reward since it depends on exact knowledge of R to compute, the reward is only used to measure regret. Nevertheless, we have the following Bayesian regret bound for policies in the optimistic set. Theorem 4. Let alg produce any sequence of policies πt, t = 1, . . . , T , that satisfy πt ∈ Ptφ,Λ and assume that the prior over each entry of R and reward noise are 1-sub-Gaussian and that ‖λ?‖2 ≤ C φ-almost surely, then
BayesRegret(φ, alg, T ) ≤ C (√ 2 logA(1 + log T ) + 2 √ m )√ AT = Õ( √ mAT ).
Next we present a numerical experiment with n = 50 variables and m = 25 constraints. The entries of R were sampled from prior N (−0.15, 1), and we repeatedly sampled from this distribution until
a feasible problem was found. We chose a slightly negative bias in the prior for R in order to make the problem of finding a feasible policy more challenging. All noise was sampled from N (0, 1). For this experiment we set C = 10; the true optimal dual variable satisfied ‖λ?‖ ≈ 7. In Figure 4 we compare the performance of TS Algorithm 3, VBOS Algorithm 4, and K-learning [23] over 8 seeds. We also plot how much the policy produced by each algorithm violated the constraints at each time-period, as measured by `∞ norm. As can be seen both VBOS and K-learning enjoy sub-linear regret and have their constraint violation converging to zero, with VBOS slightly outperforming Klearning on both metrics. TS on the other hand appears to suffer from linear regret, and the constraint violation decreases up to a point after which it saturates at a non-zero value. It is clear that TS is unable to adequately trade off exploration and exploitation in this problem.

heading: 5 Conclusion
text: In this manuscript we introduced variational Bayesian optimistic sampling (VBOS), which is an algorithm that produces policies by solving an optimization problem in each round of a sequential decision problem. The optimization problem that must be solved is always convex, no matter how complicated the posteriors are. We showed that VBOS enjoys low regret for several problem families, including the well-known multi-armed bandit problem as well as more exotic problems like constrained bandits where TS can fail.
We conclude with some discussion about future directions for this work. First, in follow-up work we intend to show that VBOS is applicable in structured and multi-period problems like Markov decision processes, and again prove Bayesian regret guarantees. Second, an avenue we did not explore in this work was to parameterize the policy to be in a certain family, e.g., linear in some basis. The variational formulation naturally extends to this case, where the optimization problem is in terms of the basis coefficients (which maintains convexity in the linear case). Combining these two suggests using the variational formulation to find the linearly parameterized VBOS policy in an MDP, which amounts to solving a convex optimization problem that may be much smaller than solving the corresponding problem without the parameterization. We expect that a regret bound is possible in this case under certain assumptions on the basis. Finally, since the VBOS objective is differentiable this opens the door to using differentiable computing architectures, such as deep neural networks trained using backpropagation. We speculate that it may be possible to apply VBOS in deep reinforcement learning to tackle the challenging exploration-exploitation tradeoff in those domains.
Acknowledgments and Disclosure of Funding
The authors would like to thank Ben Van Roy, Satinder Singh, and Zheng Wen for discussions and feedback. The authors received no specific funding for this work.

Review summaries:
This work develops an analog to Thompson sampling by upper-bounding the expected regret in sequential decision-making problems. The two terms in the upper bound loosely resemble the evidence lower bound of variational inference: the first term encourages selecting arms with high expected reward; the second term depends on the inverse of the rate function and penalizes heavy tails and encourages exploration. The resulting variational Thompson sampling algorithm is evaluated on a random game and a constrained bandit problem.

This paper introduces Variational Thompson Sampling, where rather than sampling from the posterior, which can be infeasible, a computationally tractable upper bound is optimized.  In the stochastic multi-armed bandit setting with subgaussian noise, they provide a general analysis for any algorithm that plays a "stochastically optimistic" policy, which includes vanilla TS and the new method.  The VTS algorithm is shown to have sublinear regret for the more challenging bilinear saddle point problems where it can be shown that TS fails.

This paper proposes a novel class of policies for online learning, named variational Thompson sampling (VTS). VTS is derived from a family of stochastically optimistic policies, which includes standard TS as a special case. VTS is amenable to some interesting interpretations when compared with difference existing policies such as UCB and K-learning, and is shown to outperform TS consistently in two classes of problems, i.e., zero-sum two player games and constrained bandits.

This paper presents and establishes regret bounds for a new heuristic, inspired by Thompson sampling, for selecting actions in stochastic multi-arm bandit and bilinear saddle-point problems. As in Thompson sampling, a belief state is maintained over the values of each arm. However, instead of selecting an action according to its probability of optimality, one instead computes a policy (distribution over actions) that maximizes a novel objective. The objective can be understood as combining a "pure exploitation" term (the expected reward of the policy, under the current belief distribution), and an "exploration" term that depends only on the relative concentrations (and not the expected values) of the posteriors for each arm.