SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems
12 references·6 citing·31 second hop
Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems (2013)Deterministic Sequencing of Exploration a…Online Learning of Rested and Restless Bandits (2012)Online Learning of Rested and…Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics (2012)Learning in a Changing World:…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…1 1 Online Learning of Rested and Restless Bandits (2012)1 1 Online Learning of Rested…Distributed Learning in Multi-Armed Bandit With Multiple Players (2010)Distributed Learning in Multi…Online linear optimization and adaptive routing (2007)Online linear optimization an…Multi-Armed Bandit Problems (2007)Multi-Armed Bandit ProblemsFinite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit Pr…Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Sample mean based index polic…Design of Experiments: Ranking and Selection (1984)Design of Experiments: Rankin…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Online Learning and Pricing for Service Systems with Reusable Resources (2022)Online Learning and Pricing f…Multi-Armed Bandits: Theory and Applications to Online Learning in Networks (2019)Multi-Armed Bandits: Theory a…Distributed Learning for Channel Allocation Over a Shared Spectrum (2019)Distributed Learning for Chan…Multi-armed bandits in multi-agent networks (2017)Multi-armed bandits in multi-…Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure (2016)Risk-Averse Multi-Armed Bandi…On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits (2016)On Regret-Optimal Learning in…Design of Experiments (1936)Theory of optimal experiments (1972)The Knowledge Gradient Algorithm for a General Class of Online Learning Problems (2012)Incentivizing exploration (2014)Introduction to Stochastic Processes (2014)Asymptotically optimal priority policies for indexable and nonindexable restless bandits (2016)A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)The Nonstochastic Multiarmed Bandit Problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)Projection-free Online Learning (2012)Multi-armed bandits with application to 5G small cells (2016)Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)Using confidence bounds for exploitation-exploration trade-offs (2003)Stochastic Linear Optimization Under Bandit Feedback (2008)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Cascading Bandits: Learning to Rank in the Cascade Model (2015)Linearly Parameterized Bandits (2010)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Multi-Player Bandits -- a Musical Chairs Approach (2015)Prediction, Learning, and Games (2006)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Methods for selecting the best system (for simulation) (2002)Time-Varying Gaussian Process Bandit Optimization (2016)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2010Distributed Learning in Multi-Armed Bandit With Multiple Players386 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2007Multi-Armed Bandit Problems188 cited
  • 2007Online linear optimization and adaptive routing177 cited
  • 1984Design of Experiments: Ranking and Selection153 cited
  • 20121 1 Online Learning of Rested and Restless Bandits141 cited
  • 2012Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics139 cited
  • 2012Online Learning of Rested and Restless Bandits114 cited

Cited by

  • 2016Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure86 cited
  • 2016On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits66 cited
  • 2017Multi-armed bandits in multi-agent networks

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

65 cited
  • 2019Distributed Learning for Channel Allocation Over a Shared Spectrum50 cited
  • 2019Multi-Armed Bandits: Theory and Applications to Online Learning in Networks35 cited
  • 2022Online Learning and Pricing for Service Systems with Reusable Resources29 cited