SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits
5 references·4 citing·28 second hop
Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits (2011)Upper-Confidence-Bound Algorithms for Act…Pure exploration in finitely-armed and continuous-armed bandits (2010)Pure exploration in finitely-…Best Arm Identification in Multi-Armed Bandits (2010)Best Arm Identification in Mu…Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Exploration–exploitation trad…Theory of Optimal Experiments. (1972)Theory of Optimal Experiments.Theory of optimal experiments (1972)Theory of optimal experimentsHuman complex exploration strategies are extended via noradrenaline-modulated heuristics (2020)Human complex exploration str…Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration (2013)Parallel Gaussian Process Opt…Gaussian Process Optimization with Mutual Information (2013)Gaussian Process Optimization…The strategic student approach for life-long exploration and learning (2012)The strategic student approac…Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Almost Optimal Exploration in Multi-Armed Bandits (2013)Safe Exploration for Optimization with Gaussian Processes (2015)A unified framework for stochastic optimization (2018)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Practical Bayesian Optimization of Machine Learning Algorithms (2012)Adaptive design of experiments based on Gaussian mixture regression (2020)The Nonstochastic Multiarmed Bandit Problem (2002)Dynamic pricing with limited supply (2012)Information Complexity in Bandit Subset Selection (2013)Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Multi-Armed Bandit Allocation Indices. (1990)The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Intrinsic motivation, curiosity, and learning (2016)Conflict, arousal, and curiosity. (1960)Rethinking Innateness: A Connectionist Perspective on Development (1996)Object Learning Through Active Exploration (2014)Development and validation of brief measures of positive and negative affect: The PANAS scales. (1988)Development and validation of brief measures of positive and negative affect: The PANAS scales. (1988)Eta squared and partial eta squared as measures of effect size in educational research (2011)Bayesian Experimental Design: A Review (1995)Global sensitivity analysis using polynomial chaos expansions (2007)Response surface methodology (2010)Constructing Experimental Designs for Discrete-Choice Experiments: Report of the ISPOR Conjoint Analysis Experimental Design Good Research Practices Task Force (2013)
this work references cited by second hop

References

  • 1972Theory of optimal experiments2,093 cited
  • 1972Theory of Optimal Experiments.1,896 cited
  • 2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
  • 2010Best Arm Identification in Multi-Armed Bandits418 cited
  • 2010Pure exploration in finitely-armed and continuous-armed bandits188 cited

Cited by

  • 2013Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration70 cited
  • 2012The strategic student approach for life-long exploration and learning56 cited
  • 2013Gaussian Process Optimization with Mutual Information53 cited
  • 2020Human complex exploration strategies are extended via noradrenaline-modulated heuristics4 cited

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