SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Multi-armed Bandit Problems with History
5 references·1 citing·20 second hop
Multi-armed Bandit Problems with History (2012)Multi-armed Bandit Problems with HistoryRegret bounds for sleeping experts and bandits (2010)Regret bounds for sleeping ex…Exploration scavenging (2008)Exploration scavengingTuning Bandit Algorithms in Stochastic Environments (2007)Tuning Bandit Algorithms in S…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Online Pricing with Offline Data: Phase Transition and Inverse Square Law (2022)Online Pricing with Offline D…Some aspects of the sequential design of experiments (1952)Multi-Armed Bandit Allocation Indices. (1990)Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton (2010)Leveraging Side Observations in Stochastic Bandits (2012)Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs (2014)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Bandit Problems, Sequential Allocation of Experiments. (1987)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Counterfactual Risk Minimization (2015)Off-policy evaluation for slate recommendation (2016)Deep Learning with Logged Bandit Feedback (2018)Prediction, Learning, and Games (2006)Improved Algorithms for Linear Stochastic Bandits (2011)Mortal Multi-Armed Bandits (2008)An Asymptotically Optimal Bandit Algorithm for Bounded Support Models. (2010)Multi-armed bandits with application to 5G small cells (2016)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2010Regret bounds for sleeping experts and bandits200 cited
  • 2007Tuning Bandit Algorithms in Stochastic Environments158 cited
  • 2008Exploration scavenging109 cited

Cited by

  • 2022Online Pricing with Offline Data: Phase Transition and Inverse Square Law33 cited

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