SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A fully adaptive algorithm for pure exploration in linear bandits.
5 references·0 citing·19 second hop
A fully adaptive algorithm for pure exploration in linear bandits. (2018)A fully adaptive algorithm for pure explo…On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning (2014)On correlation and budget con…Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Pure Exploration in Multi-armed Bandits Problems (2009)Pure Exploration in Multi-arm…Associative Reinforcement Learning using Linear Probabilistic Concepts (1999)Associative Reinforcement Lea…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Finite-time Analysis of the Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Almost Optimal Exploration in Multi-Armed Bandits (2013)Non-stochastic Best Arm Identification and Hyperparameter Optimization (2015)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)Prediction, Learning, and Games (2006)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Introduction to Multi-Armed Bandits (2019)Practical Bayesian Optimization of Machine Learning Algorithms (2012)Best-Arm Identification in Linear Bandits (2014)A new acquisition function for Bayesian optimization based on the moment-generating function (2017)ADMMBO: Bayesian Optimization with Unknown Constraints using ADMM. (2019)Using upper confidence bounds for online learning (2002)Improved Algorithm on Online Clustering of Bandits (2019)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits860 cited
  • 2009Pure Exploration in Multi-armed Bandits Problems365 cited
  • 2014On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning85 cited
  • 1999Associative Reinforcement Learning using Linear Probabilistic Concepts58 cited

Cited by

No citing works inside the corpus for this window.

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