SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The Budgeted Multi-armed Bandit Problem
1 references·1 citing·7 second hop
The Budgeted Multi-armed Bandit Problem (2004)The Budgeted Multi-armed Bandit ProblemBandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Safety-Aware Algorithms for Adversarial Contextual Bandit. (2017)Safety-Aware Algorithms for A…The Nonstochastic Multiarmed Bandit Problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)Online Learning and Online Convex Optimization (2011)Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints (2019)Learning by Doing and the Choice of Technology (1996)Linearly Parameterized Bandits (2010)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)
this work references cited by second hop

References

  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited

Cited by

  • 2017Safety-Aware Algorithms for Adversarial Contextual Bandit.36 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work