scientific article; zbMATH DE number 7626733

MaRDI QIDQ5053221zbMATH OpenFDO

Authors Zixin Zhong, Wang Chueng Chi, Vincent Y. F. Tan

Publication date 6 December 2022

Full work available at URL https://arxiv.org/abs/1810.01187, https://jmlr.csail.mit.edu/papers/v22/20-447.html

zbMATH Keywords

cascading banditslinear banditsmulti-armed banditsregret minimizationThompson sampling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A Tutorial on Thompson Sampling
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
• Elements of Information Theory
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• Learning to optimize via posterior sampling
• Linear Thompson sampling revisited
• MNL-bandit: a dynamic learning approach to assortment selection
• Multi-objective multi-armed bandit with lexicographically ordered and satisficing objectives
• Near-optimal regret bounds for Thompson sampling
• On upper-confidence bound policies for switching bandit problems
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• The Nonstochastic Multiarmed Bandit Problem
• Thompson sampling: an asymptotically optimal finite-time analysis

Cited in

(7)

• Linear Thompson sampling revisited
• An information-theoretic analysis of Thompson sampling
• On the Prior Sensitivity of Thompson Sampling
• Thompson Sampling for Bayesian Bandits with Resets
• A Tutorial on Thompson Sampling
• Sliding-Window Thompson Sampling for Non-Stationary Settings
• Online Network Revenue Management Using Thompson Sampling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053221)