Finite-TimeRegretofThompsonSampling AlgorithmsforExponentialFamilyMulti-Armed Bandits

Neural Information Processing Systems 

Weprovideatightregretanalysis forExpTS, whichsimultaneously yields both the finite-timeregret bound as well as the asymptotic regret bound.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found