Complexity analysis of a countable-armed bandit problem

MaRDI QIDQ7022739zbMATH OpenFDO

Authors Anand Kalvit, Assaf Zeevi

Publication date 24 February 2025

Full work available at URL https://proceedings.mlr.press/v201/kalvit23a.html

zbMATH Keywords

infinite-armed banditsUCBadaptivity to reservoir-distributionexplore-then-commit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Asymptotically efficient adaptive allocation rules
• Bandit algorithms
• Bandit problems with infinitely many arms
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Finite-time analysis of the multiarmed bandit problem
• Introduction to multi-armed bandits
• MNL-bandit: a dynamic learning approach to assortment selection
• Matching while learning
• Probability
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Complexity analysis of a countable-armed bandit problem

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