The information complexity of best-arm identification
|
|
- Alaina O’Brien’
- 5 years ago
- Views:
Transcription
1 The information complexity of best-arm identification Emilie Kaufmann, joint work with Olivier Cappé and Aurélien Garivier MAB workshop, Lancaster, January th, 206
2 Context: the multi-armed bandit model (MAB) K arms = K probability distributions (νa has mean µa ) ν ν2 ν3 ν4 ν5 At round t, an agent: chooses an arm At observes a sample Xt νat using a sequential sampling strategy (At ): At+ = Ft (A, X,..., At, Xt ), aimed for a prescribed objective, e.g. related to learning a = argmaxa µa and µ = max µa. a
3 A possible objective: Regret minimization Samples = rewards, (A t ) is adjusted to [ T maximize the (expected) sum of rewards, E t= X t or equivalently minimize regret: [ ] T R T = E T µ X t exploration/exploitation tradeoff Motivation: clinical trials [933] t= ] B(µ ) B(µ 2 ) B(µ 3 ) B(µ 4 ) B(µ 5 ) Goal: Maximize the number of patients healed during the trial
4 Our objective: Best-arm identification Goal : identify the best arm, a, as fast/accurately as possible. No incentive to draw arms with high means! optimal exploration The agent s strategy is made of: a sequential sampling strategy (A t ) a stopping rule τ (stopping time) a recommendation rule â τ Possible goals: Fixed-budget setting τ = T minimize P(â τ a ) Fixed-confidence setting minimize E[τ] P(â τ a ) δ Motivation: Market research, A/B Testing, clinical trials...
5 Our objective: Best-arm identification Goal : identify the best arm, a, as fast/accurately as possible. No incentive to draw arms with high means! optimal exploration The agent s strategy is made of: a sequential sampling strategy (A t ) a stopping rule τ (stopping time) a recommendation rule â τ Possible goals: Fixed-budget setting τ = T minimize P(â τ a ) Fixed-confidence setting minimize E[τ] P(â τ a ) δ Motivation: Market research, A/B Testing, clinical trials...
6 Wanted: Optimal algorithms in the PAC formulation M a class of bandit models ν = (ν,..., ν K ). A strategy is δ-pac on M is ν M, P ν (â τ = a ) δ. Goal: for some classes M, and ν M, find a lower bound on E ν [τ] for any δ-pac strategy a δ-pac strategy such that E ν [τ] matches this bound (distribution-dependent bounds)
7 Outline Regret minimization 2 Lower bound on the sample complexity 3 The complexity of A/B Testing 4 Algorithms for the general case
8 Exponential family bandit models ν,..., ν K belong to a one-dimensional exponential family: P λ,θ,b = {ν θ, θ Θ : ν θ has density f θ (x) = exp(θx b(θ)) w.r.t. λ} Example: Gaussian, Bernoulli, Poisson distributions... ν θ can be parametrized by its mean µ = ḃ(θ) : ν µ := νḃ (µ) Notation: Kullback-Leibler divergence For a given exponential family P, ] d P (µ, µ ) := KL(ν µ, ν µ ) = E X ν µ [log dνµ (X ) dν µ is the KL-divergence between the distributions of mean µ and µ. Example: Bernoulli distributions d(µ, µ ) = KL(B(µ), B(µ )) = µ log µ µ + ( µ) log µ µ.
9 Outline Regret minimization 2 Lower bound on the sample complexity 3 The complexity of A/B Testing 4 Algorithms for the general case
10 Optimal algorithms for regret minimization ν = (ν µ,..., ν µ K ) M = (P) K. N a (t) : number of draws of arm a up to time t K R T (ν) = (µ µ a )E ν [N a (T )] a= consistent algorithm: ν M, α ]0, [, R T (ν) = o(t α ) [Lai and Robbins 985]: every consistent algorithm satisfies µ a < µ lim inf T E ν [N a (T )] log T d(µ a, µ ) Definition A bandit algorithm is asymptotically optimal if, for every ν M, µ a < µ lim sup T E ν [N a (T )] log T d(µ a, µ )
11 KL-UCB: an asymptotically optimal algorithm KL-UCB [Cappé et al. 203] A t+ = arg max a u a (t), with { u a (t) = argmax d (ˆµ a (t), x) log(t) }, x N a (t) ( where d(µ, µ ) = KL ν µ, ν µ ) d(s a (t)/n a (t),q) 2(q S a (t)/n a (t)) log(t)/n a (t) E[N a (T )] S a (t)/n a (t) [ [ ]] q d(µ a, µ ) log T + O( log(t )).
12 The information complexity of regret minimization Letting we showed that κ R (ν) := inf lim inf A consistent T κ R (ν) = K a= (µ µ a ) d(µ a, µ ). R T (ν) log(t ),
13 Outline Regret minimization 2 Lower bound on the sample complexity 3 The complexity of A/B Testing 4 Algorithms for the general case
14 A general lower bound M a class of exponential family bandit models A = (A t, τ, â τ ) a strategy A is δ-pac on M: ν M, P ν (â τ = a ) δ. Theorem [K.,Cappé, Garivier 5] Let ν = (ν µ,..., ν µ K ) be such that µ > µ 2 µ K. Let δ ]0, [. Any algorithm that is δ-pac on M satisfies E ν [τ] ( K ) d(µ, µ 2 ) + ( ) log. d(µ a, µ ) 2.4δ a=2 d(µ, µ ) = KL(ν µ, ν µ )
15 Behind the lower bound: changes of distribution Lemma [K., Cappé, Garivier 205] ν = (ν, ν 2,..., ν K ), ν = (ν, ν 2,..., ν K ) two bandit models. K a= E ν [N a (τ)]kl(ν a, ν a) sup E F τ kl(p ν (E), P ν (E)). with kl(x, y) = x log(x/y) + ( x) log(( x)/( y)).
16 Behind the lower bound: changes of distribution Lemma [K., Cappé, Garivier 205] ν = (ν, ν 2,..., ν K ), ν = (ν, ν 2,..., ν K ) two bandit models. K a= E ν [N a (τ)]kl(ν a, ν a) sup E F τ kl(p ν (E), P ν (E)). with kl(x, y) = x log(x/y) + ( x) log(( x)/( y)). L t the log-likelihood ratio of past observations under ν and ν : Wald s equality: E ν [L τ ] = K a= E ν[n a (τ)]kl(ν a, ν a) change of distribution: E F τ, P ν (E) = E ν [exp( L τ ) E ]
17 Behind the lower bound: changes of distribution Exponential bandits: ν = (µ, µ 2,..., µ K ), ν = (µ, µ 2,..., µ K ) E F τ, K E ν [N a (τ)]d(µ a, µ a) kl(p ν (E), P ν (E)). a= E ν [τ] = K a= E ν[n a (τ)]. Then, for a, choose ν such that arm is no longer the best : µ K µ a µ 2 µ µ + ε { µ a = µ + ɛ µ i = µ i, if i a 2 E = (â τ = ): P ν (E) δ and P ν (E) δ. E ν [N a (τ)]d(µ a, µ + ɛ) kl(δ, δ) ( ) E ν [N a (τ)] d(µ a, µ ) log. 2.4δ
18 The complexity of best arm identification M a class of exponential family bandit models Theorem [K.,Cappé, Garivier 5] Let ν = (ν µ,..., ν µ K ) be such that µ > µ 2 µ K. Let δ ]0, [. Any algorithm that is δ-pac on M satisfies E ν [τ] ( K ) d(µ, µ 2 ) + ( ) log. d(µ a, µ ) 2.4δ a=2
19 The complexity of best arm identification M a class of exponential family bandit models Theorem [K.,Cappé, Garivier 5] Let ν = (ν µ,..., ν µ K ) be such that µ > µ 2 µ K. Let δ ]0, [. Any algorithm that is δ-pac on M satisfies E ν [τ] ( K ) d(µ, µ 2 ) + ( ) log. d(µ a, µ ) 2.4δ a=2 For any class M, the complexity term of ν M is defined as E ν [τ] κ C (ν) :=inf lim sup A PAC log(/δ) δ 0 A = (A(δ)) is PAC if for all δ ]0, [, A(δ) is δ-pac on M.
20 Outline Regret minimization 2 Lower bound on the sample complexity 3 The complexity of A/B Testing 4 Algorithms for the general case
21 Computing the complexity term M a class of two-armed bandit models. For ν = (ν, ν 2 ) recall that E ν [τ] κ C (ν) :=inf lim sup A PAC log(/δ) δ 0 We now compute κ C (ν) for two types of classes M: Exponential family bandit models: M = {ν = (ν µ, ν µ 2 ) : ν µ P, µ µ 2 } Gaussian with known variances σ 2 and σ2 2 : M = { ν = ( N ( µ, σ) 2 (, N µ2, σ2 2 )) : (µ, µ 2 ) R 2 }, µ µ 2
22 Lower bounds on the complexity From our previous lower bound (or a similar method) Exponential family bandit models: κ C (ν) d(µ, µ 2 ) + d(µ 2, µ ). Gaussian with known variances σ 2, σ2 2 : κ C (ν) 2σ 2 (µ µ 2 ) 2 + 2σ 2 2 (µ 2 µ ) 2.
23 Towards tighter lower bounds Exponential bandits: ν = (µ, µ 2 ), ν = (µ, µ 2 ) : µ < µ 2 ( ) E ν [N (τ)]d(µ, µ ) + E ν [N 2 (τ)]d(µ 2, µ 2) log. 2.4δ previously, a new change of distribution: μ 2 μ μ +ε µ = µ µ 2 = µ + ɛ μ 2 μ * μ * +ε μ µ = µ µ 2 = µ + ɛ choosing µ : d(µ, µ ) = d(µ 2, µ ) := d (µ, µ 2 ): ( ) d (µ, µ 2 )E ν [τ] log 2.4δ E ν [τ] d (µ, µ 2 ) log ( ) 2.4δ
24 Tighter lower bounds in the two-armed case New lower bounds (tighter!) Exponential families Gaussian with known σ 2, σ2 2 κ C (ν) d (µ,µ 2 ) κ C (ν) 2(σ +σ 2 ) 2 (µ µ 2 ) 2 d (µ, µ 2 ) := d(µ, µ ) = d(µ 2, µ ) is a Chernoff information. Previous lower bounds Exponential families Gaussian with known σ 2, σ2 2 κ C (ν) d(µ,µ 2 ) + d(µ 2,µ ) κ C (ν) 2(σ2 +σ2 2 ) (µ µ 2 ) 2
25 Upper bounds on the complexity: algorithms M = { ν = ( N ( µ, σ) 2 (, N µ2, σ2 2 )) : (µ, µ 2 ) R 2 }, µ µ 2 The α-elimination algorithm with exploration rate β(t, δ) : chooses A t in order to keep a proportion N (t)/t α i.e. A t = 2 if and only if αt = α(t + ) if ˆµ a (t) is the empirical mean of rewards obtained from a up to time t, σt 2 (α) = σ 2/ αt + σ2 2 /(t αt ), { } τ = inf t N : ˆµ (t) ˆµ 2 (t) > 2σt 2 (α)β(t, δ)
26 Gaussian case: matching algorithm Theorem [K., Cappé, Garivier 4] With α = σ σ + σ 2 and β(t, δ) = log t δ + 2 log log(6t), α-elimination is δ-pac and ɛ > 0, E ν [τ] ( + ɛ) 2(σ + σ 2 ) 2 ( ) ( (µ µ 2 ) 2 log + o ɛ log ) δ δ 0 δ In the Gaussian case, and finally κ C (ν) 2(σ + σ 2 ) 2 (µ µ 2 ) 2 κ C (ν) = 2(σ + σ 2 ) 2 (µ µ 2 ) 2.
27 Exponential families: uniform sampling Another lower bound... M = {ν = (ν µ, ν µ 2 ) : ν µ P, µ µ 2 } A δ-pac algorithm using uniform sampling (A t = t[2]) satisfy ( ) E ν [τ] I (µ, µ 2 ) log 2.4δ with I (µ, µ 2 ) = d ( µ, µ +µ 2 2 ) ( + d µ2, µ +µ 2 ) 2. 2 Remark: I (µ, µ 2 ) is very close to d (µ, µ 2 )... find a good strategy with a uniform sampling strategy!
28 Exponential families: uniform sampling For Bernoulli bandit models, uniform sampling and { ( t )} τ = inf t N : ˆµ (t) ˆµ 2 (t) > log δ is δ-pac but not optimal: E ν[τ] log(/δ) 2 (µ µ 2 ) 2 > I (µ,µ 2 ). SGLRT algorithm (Sequential Generalized Likelihood Ratio Test) Let α > 0. There exists C = C α such that the algorithm using a uniform sampling strategy and the stopping rule τ = inf {t N : ti (ˆµ (t), ˆµ 2 (t)) > β(t, δ))} ( ) with β(t, δ) = log Ct +α is δ-pac and δ lim sup δ 0 E ν [τ] log(/δ) κ C (ν) + α I (µ, µ 2 ). I (µ, µ 2 )
29 The complexity of A/B Testing For Gaussian bandit models with known variances σ 2 and σ2 2, if ν = (N (µ, σ 2 ), N (µ 2, σ 2 2 )), κ C (ν) = (σ + σ 2 ) 2 2(µ + µ 2 ) 2 and the optimal strategy draws the arms proportionally to their standard deviation. For exponential bandit models, if ν = (ν µ, ν µ 2 ), d (µ, µ 2 ) κ C (ν) and uniform sampling is close to optimal. I (µ, µ 2 )
30 Outline Regret minimization 2 Lower bound on the sample complexity 3 The complexity of A/B Testing 4 Algorithms for the general case
31 Racing (or elimination) algorithms S = {,..., K} set of remaining arms r = 0 current round while S > r=r+ draw each a S, compute ˆµ a,r, the empirical mean of the r samples observed sofar compute the empirical best and empirical worst arms: b r = argmax a S ˆµ a,r w r = argmin a S ˆµ a,r end if EliminationRule(r, b r, w r ), eliminate w r : S = S\{w r } Outpout: â the single element in S.
32 Elimination rules In the literature: Successive Elimination for Bernoulli bandits ( ) log (ckt Elimination(r, a, b) = ˆµ a,r ˆµ b,r > 2 /δ) r [Even Dar et al. 06] KL-Racing for exponential family bandits with Elimination(r, a, b) = (l a,r > u b,r ) { la,r = min{x : rd(ˆµ a,r, x) β(r, δ)} u b,r = max{x : rd(ˆµ b,r, x) β(r, δ)} [K. and Kalyanakrishnan 3]
33 The Racing-SGLRT algorithm = EliminationRule(r, a, b) ( ( rd ˆµ a,r, ˆµ a,r + ˆµ b,r 2 ) + rd = (2rI (ˆµ a,r, ˆµ b,r ) > β(r, δ)) ( ˆµ b,r, ˆµ ) ) a,r + ˆµ b,r > β(r, δ) 2 Analysis of Racing-SGLRT Let α > 0. For an exploration rate of the form ( ) Ct +α β(r, δ) = log, δ Racing-SGLRT is δ-pac and satifies ( K ) E ν [τ] lim sup ( + α). δ 0 log(/δ) I (µ a, µ ) a=2
34 Conclusion We presented: a simple methodology to derive lower bounds on the sample complexity of a δ-pac strategy a characterization of the complexity of best arm identification among two-arm, involving alternative information-theoretic quantities (e.g. Chernoff information) To be continued... A/B Testing: for which classes of distributions is uniform sampling a good idea? the complexity of best arm identification is still to be understood in the general case... K d (µ, µ 2 ) + K d(µ a, µ ) κ C (ν) I (µ a, µ ) a=2 a=2
35 References O. Cappé, A. Garivier, O-A. Maillard, R. Munos, and G. Stoltz. Kullback-Leibler upper confidence bounds for optimal sequential allocation. Annals of Statistics, 203. E. Even-Dar, S. Mannor, Y. Mansour, Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems. JMLR, E. Kaufmann, S. Kalyanakrishnan, Information Complexity in Bandit Subset Selection. In Proceedings of the 26th Conference On Learning Theory (COLT), 203. E. Kaufmann, O. Cappé, A. Garivier. On the Complexity of A/B Testing. In Proceedings of the 27th Conference On Learning Theory (COLT), 204. E. Kaufmann, O. Cappé, A. Garivier. On the Complexity of Best Arm Identification in Multi-Armed Bandit Models. JMLR, 205 T.L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 985.
The information complexity of sequential resource allocation
The information complexity of sequential resource allocation Emilie Kaufmann, joint work with Olivier Cappé, Aurélien Garivier and Shivaram Kalyanakrishan SMILE Seminar, ENS, June 8th, 205 Sequential allocation
More informationOn the Complexity of Best Arm Identification with Fixed Confidence
On the Complexity of Best Arm Identification with Fixed Confidence Discrete Optimization with Noise Aurélien Garivier, Emilie Kaufmann COLT, June 23 th 2016, New York Institut de Mathématiques de Toulouse
More informationTwo optimization problems in a stochastic bandit model
Two optimization problems in a stochastic bandit model Emilie Kaufmann joint work with Olivier Cappé, Aurélien Garivier and Shivaram Kalyanakrishnan Journées MAS 204, Toulouse Outline From stochastic optimization
More informationOn the Complexity of Best Arm Identification with Fixed Confidence
On the Complexity of Best Arm Identification with Fixed Confidence Discrete Optimization with Noise Aurélien Garivier, joint work with Emilie Kaufmann CNRS, CRIStAL) to be presented at COLT 16, New York
More informationOn the Complexity of Best Arm Identification in Multi-Armed Bandit Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models Aurélien Garivier Institut de Mathématiques de Toulouse Information Theory, Learning and Big Data Simons Institute, Berkeley, March
More informationRevisiting the Exploration-Exploitation Tradeoff in Bandit Models
Revisiting the Exploration-Exploitation Tradeoff in Bandit Models joint work with Aurélien Garivier (IMT, Toulouse) and Tor Lattimore (University of Alberta) Workshop on Optimization and Decision-Making
More informationStratégies bayésiennes et fréquentistes dans un modèle de bandit
Stratégies bayésiennes et fréquentistes dans un modèle de bandit thèse effectuée à Telecom ParisTech, co-dirigée par Olivier Cappé, Aurélien Garivier et Rémi Munos Journées MAS, Grenoble, 30 août 2016
More informationMulti-armed bandit models: a tutorial
Multi-armed bandit models: a tutorial CERMICS seminar, March 30th, 2016 Multi-Armed Bandit model: general setting K arms: for a {1,..., K}, (X a,t ) t N is a stochastic process. (unknown distributions)
More informationarxiv: v2 [stat.ml] 14 Nov 2016
Journal of Machine Learning Research 6 06-4 Submitted 7/4; Revised /5; Published /6 On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models arxiv:407.4443v [stat.ml] 4 Nov 06 Emilie Kaufmann
More informationBandit models: a tutorial
Gdt COS, December 3rd, 2015 Multi-Armed Bandit model: general setting K arms: for a {1,..., K}, (X a,t ) t N is a stochastic process. (unknown distributions) Bandit game: a each round t, an agent chooses
More informationOn Bayesian bandit algorithms
On Bayesian bandit algorithms Emilie Kaufmann joint work with Olivier Cappé, Aurélien Garivier, Nathaniel Korda and Rémi Munos July 1st, 2012 Emilie Kaufmann (Telecom ParisTech) On Bayesian bandit algorithms
More informationOnline Learning and Sequential Decision Making
Online Learning and Sequential Decision Making Emilie Kaufmann CNRS & CRIStAL, Inria SequeL, emilie.kaufmann@univ-lille.fr Research School, ENS Lyon, Novembre 12-13th 2018 Emilie Kaufmann Sequential Decision
More informationOn the Complexity of A/B Testing
JMLR: Workshop and Conference Proceedings vol 35:1 3, 014 On the Complexity of A/B Testing Emilie Kaufmann LTCI, Télécom ParisTech & CNRS KAUFMANN@TELECOM-PARISTECH.FR Olivier Cappé CAPPE@TELECOM-PARISTECH.FR
More informationBayesian and Frequentist Methods in Bandit Models
Bayesian and Frequentist Methods in Bandit Models Emilie Kaufmann, Telecom ParisTech Bayes In Paris, ENSAE, October 24th, 2013 Emilie Kaufmann (Telecom ParisTech) Bayesian and Frequentist Bandits BIP,
More informationOn Sequential Decision Problems
On Sequential Decision Problems Aurélien Garivier Séminaire du LIP, 14 mars 2018 Équipe-projet AOC: Apprentissage, Optimisation, Complexité Institut de Mathématiques de Toulouse LabeX CIMI Université Paul
More informationBandits : optimality in exponential families
Bandits : optimality in exponential families Odalric-Ambrym Maillard IHES, January 2016 Odalric-Ambrym Maillard Bandits 1 / 40 Introduction 1 Stochastic multi-armed bandits 2 Boundary crossing probabilities
More informationBandit Algorithms for Pure Exploration: Best Arm Identification and Game Tree Search. Wouter M. Koolen
Bandit Algorithms for Pure Exploration: Best Arm Identification and Game Tree Search Wouter M. Koolen Machine Learning and Statistics for Structures Friday 23 rd February, 2018 Outline 1 Intro 2 Model
More informationRegret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Part I. Sébastien Bubeck Theory Group
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Part I Sébastien Bubeck Theory Group i.i.d. multi-armed bandit, Robbins [1952] i.i.d. multi-armed bandit, Robbins [1952] Known
More informationDynamic resource allocation: Bandit problems and extensions
Dynamic resource allocation: Bandit problems and extensions Aurélien Garivier Institut de Mathématiques de Toulouse MAD Seminar, Université Toulouse 1 October 3rd, 2014 The Bandit Model Roadmap 1 The Bandit
More informationInformational Confidence Bounds for Self-Normalized Averages and Applications
Informational Confidence Bounds for Self-Normalized Averages and Applications Aurélien Garivier Institut de Mathématiques de Toulouse - Université Paul Sabatier Thursday, September 12th 2013 Context Tree
More informationarxiv: v3 [cs.lg] 7 Nov 2017
ESAIM: PROCEEDINGS AND SURVEYS, Vol.?, 2017, 1-10 Editors: Will be set by the publisher arxiv:1702.00001v3 [cs.lg] 7 Nov 2017 LEARNING THE DISTRIBUTION WITH LARGEST MEAN: TWO BANDIT FRAMEWORKS Emilie Kaufmann
More informationOptimal Best Arm Identification with Fixed Confidence
JMLR: Workshop and Conference Proceedings vol 49:1 30, 2016 Optimal Best Arm Identification with Fixed Confidence Aurélien Garivier Institut de Mathématiques de Toulouse; UMR5219 Université de Toulouse;
More informationKULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION
Submitted to the Annals of Statistics arxiv: math.pr/0000000 KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION By Olivier Cappé 1, Aurélien Garivier 2, Odalric-Ambrym Maillard
More informationStat 260/CS Learning in Sequential Decision Problems.
Stat 260/CS 294-102. Learning in Sequential Decision Problems. Peter Bartlett 1. Multi-armed bandit algorithms. Exponential families. Cumulant generating function. KL-divergence. KL-UCB for an exponential
More informationKullback-Leibler Upper Confidence Bounds for Optimal Sequential Allocation
Kullback-Leibler Upper Confidence Bounds for Optimal Sequential Allocation Olivier Cappé, Aurélien Garivier, Odalric-Ambrym Maillard, Rémi Munos, Gilles Stoltz To cite this version: Olivier Cappé, Aurélien
More informationAdvanced Machine Learning
Advanced Machine Learning Bandit Problems MEHRYAR MOHRI MOHRI@ COURANT INSTITUTE & GOOGLE RESEARCH. Multi-Armed Bandit Problem Problem: which arm of a K-slot machine should a gambler pull to maximize his
More informationThe Multi-Arm Bandit Framework
The Multi-Arm Bandit Framework A. LAZARIC (SequeL Team @INRIA-Lille) ENS Cachan - Master 2 MVA SequeL INRIA Lille MVA-RL Course In This Lecture A. LAZARIC Reinforcement Learning Algorithms Oct 29th, 2013-2/94
More informationReinforcement Learning
Reinforcement Learning Lecture 5: Bandit optimisation Alexandre Proutiere, Sadegh Talebi, Jungseul Ok KTH, The Royal Institute of Technology Objectives of this lecture Introduce bandit optimisation: the
More informationSubsampling, Concentration and Multi-armed bandits
Subsampling, Concentration and Multi-armed bandits Odalric-Ambrym Maillard, R. Bardenet, S. Mannor, A. Baransi, N. Galichet, J. Pineau, A. Durand Toulouse, November 09, 2015 O-A. Maillard Subsampling and
More informationarxiv: v2 [stat.ml] 19 Jul 2012
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis Emilie Kaufmann, Nathaniel Korda and Rémi Munos arxiv:105.417v [stat.ml] 19 Jul 01 Telecom Paristech UMR CNRS 5141 & INRIA Lille - Nord
More informationMultiple Identifications in Multi-Armed Bandits
Multiple Identifications in Multi-Armed Bandits arxiv:05.38v [cs.lg] 4 May 0 Sébastien Bubeck Department of Operations Research and Financial Engineering, Princeton University sbubeck@princeton.edu Tengyao
More informationTwo generic principles in modern bandits: the optimistic principle and Thompson sampling
Two generic principles in modern bandits: the optimistic principle and Thompson sampling Rémi Munos INRIA Lille, France CSML Lunch Seminars, September 12, 2014 Outline Two principles: The optimistic principle
More informationRacing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors
Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conugate Priors Yichi Zhou 1 Jun Zhu 1 Jingwe Zhuo 1 Abstract Thompson sampling has impressive empirical performance for many multi-armed
More informationNearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
JMLR: Workshop and Conference Proceedings vol 65: 55, 207 30th Annual Conference on Learning Theory Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration Editor: Under Review for COLT 207
More informationIntroduction to Bandit Algorithms. Introduction to Bandit Algorithms
Stochastic K-Arm Bandit Problem Formulation Consider K arms (actions) each correspond to an unknown distribution {ν k } K k=1 with values bounded in [0, 1]. At each time t, the agent pulls an arm I t {1,...,
More informationMonte-Carlo Tree Search by. MCTS by Best Arm Identification
Monte-Carlo Tree Search by Best Arm Identification and Wouter M. Koolen Inria Lille SequeL team CWI Machine Learning Group Inria-CWI workshop Amsterdam, September 20th, 2017 Part of...... a new Associate
More informationarxiv: v2 [math.st] 14 Nov 2016
On Explore-hen-Commit Strategies arxiv:1605.08988v math.s] 1 Nov 016 Aurélien Garivier Institut de Mathématiques de oulouse; UMR519 Université de oulouse; CNRS UPS IM, F-3106 oulouse Cedex 9, France aurelien.garivier@math.univ-toulouse.fr
More informationarxiv: v4 [math.pr] 26 Aug 2013
The Annals of Statistics 2013, Vol. 41, No. 3, 1516 1541 DOI: 10.1214/13-AOS1119 c Institute of Mathematical Statistics, 2013 arxiv:1210.1136v4 [math.pr] 26 Aug 2013 KULLBACK LEIBLER UPPER CONFIDENCE BOUNDS
More informationStochastic bandits: Explore-First and UCB
CSE599s, Spring 2014, Online Learning Lecture 15-2/19/2014 Stochastic bandits: Explore-First and UCB Lecturer: Brendan McMahan or Ofer Dekel Scribe: Javad Hosseini In this lecture, we like to answer this
More informationCorrupt Bandits. Abstract
Corrupt Bandits Pratik Gajane Orange labs/inria SequeL Tanguy Urvoy Orange labs Emilie Kaufmann INRIA SequeL pratik.gajane@inria.fr tanguy.urvoy@orange.com emilie.kaufmann@inria.fr Editor: Abstract We
More informationarxiv: v1 [cs.ds] 4 Mar 2016
Sequential ranking under random semi-bandit feedback arxiv:1603.01450v1 [cs.ds] 4 Mar 2016 Hossein Vahabi, Paul Lagrée, Claire Vernade, Olivier Cappé March 7, 2016 Abstract In many web applications, a
More informationOrdinal optimization - Empirical large deviations rate estimators, and multi-armed bandit methods
Ordinal optimization - Empirical large deviations rate estimators, and multi-armed bandit methods Sandeep Juneja Tata Institute of Fundamental Research Mumbai, India joint work with Peter Glynn Applied
More informationA minimax and asymptotically optimal algorithm for stochastic bandits
Proceedings of Machine Learning Research 76:1 15, 017 Algorithmic Learning heory 017 A minimax and asymptotically optimal algorithm for stochastic bandits Pierre Ménard Aurélien Garivier Institut de Mathématiques
More informationOrdinal Optimization and Multi Armed Bandit Techniques
Ordinal Optimization and Multi Armed Bandit Techniques Sandeep Juneja. with Peter Glynn September 10, 2014 The ordinal optimization problem Determining the best of d alternative designs for a system, on
More informationMulti armed bandit problem: some insights
Multi armed bandit problem: some insights July 4, 20 Introduction Multi Armed Bandit problems have been widely studied in the context of sequential analysis. The application areas include clinical trials,
More informationLecture 4: Lower Bounds (ending); Thompson Sampling
CMSC 858G: Bandits, Experts and Games 09/12/16 Lecture 4: Lower Bounds (ending); Thompson Sampling Instructor: Alex Slivkins Scribed by: Guowei Sun,Cheng Jie 1 Lower bounds on regret (ending) Recap from
More informationStat 260/CS Learning in Sequential Decision Problems. Peter Bartlett
Stat 260/CS 294-102. Learning in Sequential Decision Problems. Peter Bartlett 1. Multi-armed bandit algorithms. Concentration inequalities. P(X ǫ) exp( ψ (ǫ))). Cumulant generating function bounds. Hoeffding
More informationSequential Test for the Lowest Mean: From Thompson to Murphy Sampling
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling Emilie Kaufmann 1 Wouter M. Koolen 2 Aurélien Garivier 3 1 CNRS & U. Lille, CRIStAL / SequeL Inria Lille, emilie.kaufmann@univ-lille.fr
More informationRegret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Sébastien Bubeck Theory Group
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems Sébastien Bubeck Theory Group Part 1: i.i.d., adversarial, and Bayesian bandit models i.i.d. multi-armed bandit, Robbins [1952]
More informationOptimality of Thompson Sampling for Gaussian Bandits Depends on Priors
Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors Junya Honda Akimichi Takemura The University of Tokyo {honda, takemura}@stat.t.u-tokyo.ac.jp Abstract In stochastic bandit problems,
More informationOnline Learning with Gaussian Payoffs and Side Observations
Online Learning with Gaussian Payoffs and Side Observations Yifan Wu 1 András György 2 Csaba Szepesvári 1 1 Department of Computing Science University of Alberta 2 Department of Electrical and Electronic
More informationThe geometry of Gaussian processes and Bayesian optimization. Contal CMLA, ENS Cachan
The geometry of Gaussian processes and Bayesian optimization. Contal CMLA, ENS Cachan Background: Global Optimization and Gaussian Processes The Geometry of Gaussian Processes and the Chaining Trick Algorithm
More informationarxiv: v3 [stat.ml] 6 Nov 2017
On Bayesian index policies for sequential resource allocation Emilie Kaufmann arxiv:60.090v3 [stat.ml] 6 Nov 07 CNRS & Univ. Lille, UMR 989 CRIStAL, Inria SequeL emilie.kaufmann@univ-lille.fr Abstract
More informationAnytime optimal algorithms in stochastic multi-armed bandits
Rémy Degenne LPMA, Université Paris Diderot Vianney Perchet CREST, ENSAE REMYDEGENNE@MATHUNIV-PARIS-DIDEROTFR VIANNEYPERCHET@NORMALESUPORG Abstract We introduce an anytime algorithm for stochastic multi-armed
More informationIntroduction to Reinforcement Learning Part 3: Exploration for decision making, Application to games, optimization, and planning
Introduction to Reinforcement Learning Part 3: Exploration for decision making, Application to games, optimization, and planning Rémi Munos SequeL project: Sequential Learning http://researchers.lille.inria.fr/
More informationBandit Algorithms. Tor Lattimore & Csaba Szepesvári
Bandit Algorithms Tor Lattimore & Csaba Szepesvári Bandits Time 1 2 3 4 5 6 7 8 9 10 11 12 Left arm $1 $0 $1 $1 $0 Right arm $1 $0 Five rounds to go. Which arm would you play next? Overview What are bandits,
More informationPure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence Maryam Aziz, Jesse Anderton, Emilie Kaufmann, Javed Aslam To cite this version: Maryam Aziz, Jesse Anderton, Emilie Kaufmann, Javed
More informationAnalysis of Thompson Sampling for the multi-armed bandit problem
Analysis of Thompson Sampling for the multi-armed bandit problem Shipra Agrawal Microsoft Research India shipra@microsoft.com avin Goyal Microsoft Research India navingo@microsoft.com Abstract We show
More informationAnnealing-Pareto Multi-Objective Multi-Armed Bandit Algorithm
Annealing-Pareto Multi-Objective Multi-Armed Bandit Algorithm Saba Q. Yahyaa, Madalina M. Drugan and Bernard Manderick Vrije Universiteit Brussel, Department of Computer Science, Pleinlaan 2, 1050 Brussels,
More informationRegional Multi-Armed Bandits
School of Information Science and Technology University of Science and Technology of China {wzy43, zrd7}@mail.ustc.edu.cn, congshen@ustc.edu.cn Abstract We consider a variant of the classic multiarmed
More informationLearning to play K-armed bandit problems
Learning to play K-armed bandit problems Francis Maes 1, Louis Wehenkel 1 and Damien Ernst 1 1 University of Liège Dept. of Electrical Engineering and Computer Science Institut Montefiore, B28, B-4000,
More informationarxiv: v1 [stat.ml] 27 May 2016
An optimal algorithm for the hresholding Bandit Problem Andrea Locatelli Maurilio Gutzeit Alexandra Carpentier Department of Mathematics, University of Potsdam, Germany ANDREA.LOCAELLI@UNI-POSDAM.DE MGUZEI@UNI-POSDAM.DE
More informationAdaptive Concentration Inequalities for Sequential Decision Problems
Adaptive Concentration Inequalities for Sequential Decision Problems Shengjia Zhao Tsinghua University zhaosj12@stanford.edu Ashish Sabharwal Allen Institute for AI AshishS@allenai.org Enze Zhou Tsinghua
More informationBandit Algorithms. Zhifeng Wang ... Department of Statistics Florida State University
Bandit Algorithms Zhifeng Wang Department of Statistics Florida State University Outline Multi-Armed Bandits (MAB) Exploration-First Epsilon-Greedy Softmax UCB Thompson Sampling Adversarial Bandits Exp3
More informationMulti-Armed Bandit Formulations for Identification and Control
Multi-Armed Bandit Formulations for Identification and Control Cristian R. Rojas Joint work with Matías I. Müller and Alexandre Proutiere KTH Royal Institute of Technology, Sweden ERNSI, September 24-27,
More informationLecture 5: Regret Bounds for Thompson Sampling
CMSC 858G: Bandits, Experts and Games 09/2/6 Lecture 5: Regret Bounds for Thompson Sampling Instructor: Alex Slivkins Scribed by: Yancy Liao Regret Bounds for Thompson Sampling For each round t, we defined
More informationThe knowledge gradient method for multi-armed bandit problems
The knowledge gradient method for multi-armed bandit problems Moving beyond inde policies Ilya O. Ryzhov Warren Powell Peter Frazier Department of Operations Research and Financial Engineering Princeton
More informationAn Optimal Bidimensional Multi Armed Bandit Auction for Multi unit Procurement
An Optimal Bidimensional Multi Armed Bandit Auction for Multi unit Procurement Satyanath Bhat Joint work with: Shweta Jain, Sujit Gujar, Y. Narahari Department of Computer Science and Automation, Indian
More informationPure Exploration Stochastic Multi-armed Bandits
C&A Workshop 2016, Hangzhou Pure Exploration Stochastic Multi-armed Bandits Jian Li Institute for Interdisciplinary Information Sciences Tsinghua University Outline Introduction 2 Arms Best Arm Identification
More informationarxiv: v1 [cs.lg] 14 Nov 2018 Abstract
Sample complexity of partition identification using multi-armed bandits Sandeep Juneja Subhashini Krishnasamy TIFR, Mumbai November 15, 2018 arxiv:1811.05654v1 [cs.lg] 14 Nov 2018 Abstract Given a vector
More informationTHE MULTI-ARMED BANDIT PROBLEM: AN EFFICIENT NON-PARAMETRIC SOLUTION
THE MULTI-ARMED BANDIT PROBLEM: AN EFFICIENT NON-PARAMETRIC SOLUTION Hock Peng Chan stachp@nus.edu.sg Department of Statistics and Applied Probability National University of Singapore Abstract Lai and
More informationBoundary Crossing for General Exponential Families
Proceedings of Machine Learning Research 76:1 34, 017 Algorithmic Learning Theory 017 Boundary Crossing for General Exponential Families Odalric-Ambrym Maillard INRIA Lille - Nord Europe, Villeneuve d
More informationCsaba Szepesvári 1. University of Alberta. Machine Learning Summer School, Ile de Re, France, 2008
LEARNING THEORY OF OPTIMAL DECISION MAKING PART I: ON-LINE LEARNING IN STOCHASTIC ENVIRONMENTS Csaba Szepesvári 1 1 Department of Computing Science University of Alberta Machine Learning Summer School,
More informationIntroduction to Reinforcement Learning Part 3: Exploration for sequential decision making
Introduction to Reinforcement Learning Part 3: Exploration for sequential decision making Rémi Munos SequeL project: Sequential Learning http://researchers.lille.inria.fr/ munos/ INRIA Lille - Nord Europe
More informationBandits with Delayed, Aggregated Anonymous Feedback
Ciara Pike-Burke 1 Shipra Agrawal 2 Csaba Szepesvári 3 4 Steffen Grünewälder 1 Abstract We study a variant of the stochastic K-armed bandit problem, which we call bandits with delayed, aggregated anonymous
More informationBandits and Exploration: How do we (optimally) gather information? Sham M. Kakade
Bandits and Exploration: How do we (optimally) gather information? Sham M. Kakade Machine Learning for Big Data CSE547/STAT548 University of Washington S. M. Kakade (UW) Optimization for Big data 1 / 22
More informationAn Estimation Based Allocation Rule with Super-linear Regret and Finite Lock-on Time for Time-dependent Multi-armed Bandit Processes
An Estimation Based Allocation Rule with Super-linear Regret and Finite Lock-on Time for Time-dependent Multi-armed Bandit Processes Prokopis C. Prokopiou, Peter E. Caines, and Aditya Mahajan McGill University
More informationImproved Algorithms for Linear Stochastic Bandits
Improved Algorithms for Linear Stochastic Bandits Yasin Abbasi-Yadkori abbasiya@ualberta.ca Dept. of Computing Science University of Alberta Dávid Pál dpal@google.com Dept. of Computing Science University
More informationThe multi armed-bandit problem
The multi armed-bandit problem (with covariates if we have time) Vianney Perchet & Philippe Rigollet LPMA Université Paris Diderot ORFE Princeton University Algorithms and Dynamics for Games and Optimization
More informationStat 260/CS Learning in Sequential Decision Problems. Peter Bartlett
Stat 260/CS 294-102. Learning in Sequential Decision Problems. Peter Bartlett 1. Thompson sampling Bernoulli strategy Regret bounds Extensions the flexibility of Bayesian strategies 1 Bayesian bandit strategies
More informationarxiv: v1 [cs.lg] 15 Oct 2014
THOMPSON SAMPLING WITH THE ONLINE BOOTSTRAP By Dean Eckles and Maurits Kaptein Facebook, Inc., and Radboud University, Nijmegen arxiv:141.49v1 [cs.lg] 15 Oct 214 Thompson sampling provides a solution to
More informationAdaptive Concentration Inequalities for Sequential Decision Problems
Adaptive Concentration Inequalities for Sequential Decision Problems Shengjia Zhao Tsinghua University zhaosj12@stanford.edu Ashish Sabharwal Allen Institute for AI AshishS@allenai.org Enze Zhou Tsinghua
More informationAlireza Shafaei. Machine Learning Reading Group The University of British Columbia Summer 2017
s s Machine Learning Reading Group The University of British Columbia Summer 2017 (OCO) Convex 1/29 Outline (OCO) Convex Stochastic Bernoulli s (OCO) Convex 2/29 At each iteration t, the player chooses
More informationMulti-armed Bandits in the Presence of Side Observations in Social Networks
52nd IEEE Conference on Decision and Control December 0-3, 203. Florence, Italy Multi-armed Bandits in the Presence of Side Observations in Social Networks Swapna Buccapatnam, Atilla Eryilmaz, and Ness
More informationThompson Sampling for the non-stationary Corrupt Multi-Armed Bandit
European Worshop on Reinforcement Learning 14 (2018 October 2018, Lille, France. Thompson Sampling for the non-stationary Corrupt Multi-Armed Bandit Réda Alami Orange Labs 2 Avenue Pierre Marzin 22300,
More informationOn Regret-Optimal Learning in Decentralized Multi-player Multi-armed Bandits
1 On Regret-Optimal Learning in Decentralized Multi-player Multi-armed Bandits Naumaan Nayyar, Dileep Kalathil and Rahul Jain Abstract We consider the problem of learning in single-player and multiplayer
More informationPure Exploration Stochastic Multi-armed Bandits
CAS2016 Pure Exploration Stochastic Multi-armed Bandits Jian Li Institute for Interdisciplinary Information Sciences Tsinghua University Outline Introduction Optimal PAC Algorithm (Best-Arm, Best-k-Arm):
More informationReinforcement Learning
Reinforcement Learning Lecture 6: RL algorithms 2.0 Alexandre Proutiere, Sadegh Talebi, Jungseul Ok KTH, The Royal Institute of Technology Objectives of this lecture Present and analyse two online algorithms
More informationTHE first formalization of the multi-armed bandit problem
EDIC RESEARCH PROPOSAL 1 Multi-armed Bandits in a Network Farnood Salehi I&C, EPFL Abstract The multi-armed bandit problem is a sequential decision problem in which we have several options (arms). We can
More informationReward Maximization Under Uncertainty: Leveraging Side-Observations on Networks
Reward Maximization Under Uncertainty: Leveraging Side-Observations Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks Swapna Buccapatnam AT&T Labs Research, Middletown, NJ
More informationBandit View on Continuous Stochastic Optimization
Bandit View on Continuous Stochastic Optimization Sébastien Bubeck 1 joint work with Rémi Munos 1 & Gilles Stoltz 2 & Csaba Szepesvari 3 1 INRIA Lille, SequeL team 2 CNRS/ENS/HEC 3 University of Alberta
More informationBest Arm Identification in Multi-Armed Bandits
Best Arm Identification in Multi-Armed Bandits Jean-Yves Audibert Imagine, Université Paris Est & Willow, CNRS/ENS/INRIA, Paris, France audibert@certisenpcfr Sébastien Bubeck, Rémi Munos SequeL Project,
More informationPAC Subset Selection in Stochastic Multi-armed Bandits
In Langford, Pineau, editors, Proceedings of the 9th International Conference on Machine Learning, pp 655--66, Omnipress, New York, NY, USA, 0 PAC Subset Selection in Stochastic Multi-armed Bandits Shivaram
More informationEvaluation of multi armed bandit algorithms and empirical algorithm
Acta Technica 62, No. 2B/2017, 639 656 c 2017 Institute of Thermomechanics CAS, v.v.i. Evaluation of multi armed bandit algorithms and empirical algorithm Zhang Hong 2,3, Cao Xiushan 1, Pu Qiumei 1,4 Abstract.
More informationOnline Learning with Gaussian Payoffs and Side Observations
Online Learning with Gaussian Payoffs and Side Observations Yifan Wu András György 2 Csaba Szepesvári Dept. of Computing Science University of Alberta {ywu2,szepesva}@ualberta.ca 2 Dept. of Electrical
More informationMachine learning - HT Maximum Likelihood
Machine learning - HT 2016 3. Maximum Likelihood Varun Kanade University of Oxford January 27, 2016 Outline Probabilistic Framework Formulate linear regression in the language of probability Introduce
More informationGrundlagen der Künstlichen Intelligenz
Grundlagen der Künstlichen Intelligenz Uncertainty & Probabilities & Bandits Daniel Hennes 16.11.2017 (WS 2017/18) University Stuttgart - IPVS - Machine Learning & Robotics 1 Today Uncertainty Probability
More informationThe sample size required in importance sampling. Sourav Chatterjee
Importance sampling Let µ and ν be two probability measures on a set X, with ν µ. Let ρ = dν dµ. Let X 1, X 2,... i.i.d µ. Let f : X R be a measurable function. The goal is to estimate the integral I (f
More informationComplex Bandit Problems and Thompson Sampling
Complex Bandit Problems and Aditya Gopalan Department of Electrical Engineering Technion, Israel aditya@ee.technion.ac.il Shie Mannor Department of Electrical Engineering Technion, Israel shie@ee.technion.ac.il
More informationUpper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits
Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits Alexandra Carpentier 1, Alessandro Lazaric 1, Mohammad Ghavamzadeh 1, Rémi Munos 1, and Peter Auer 2 1 INRIA Lille - Nord Europe,
More information