SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Active Model Selection
8 references·1 citing·28 second hop
Active Model Selection (2012)Active Model SelectionThe Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …PAC Bounds for Multi-armed Bandit and Markov Decision Processes (2002)PAC Bounds for Multi-armed Ba…Optimal learning: computational procedures for bayes-adaptive markov decision processes (2002)Optimal learning: computation…Finite-time lower bounds for the two-armed bandit problem (2000)Finite-time lower bounds for …Bayesian Experimental Design: A Review (1995)Bayesian Experimental Design:…Multi-Armed Bandit Allocation Indices. (1990)Multi-Armed Bandit Allocation…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Selecting Computations: Theory and Applications (2012)Selecting Computations: Theor…Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Almost Optimal Exploration in Multi-Armed Bandits (2013)Bandits with Knapsacks (2013)lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits (2013)A Stochastic Approximation Method (1951)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Applied Statistical Decision Theory (1962)Theory of optimal experiments (1972)Design and Analysis of Computer Experiments (1989)Kriging metamodeling in simulation: A review (2007)Response surface methodology (2010)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)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)Information Value Theory (1966)Bandit Processes and Dynamic Allocation Indices (1979)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Computational Aspects of Cooperative Game Theory (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Modern Bayesian Experimental Design (2024)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)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Introduction to Multi-Armed Bandits (2019)
this work references cited by second hop

References

  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1995Bayesian Experimental Design: A Review1,846 cited
  • 1990Multi-Armed Bandit Allocation Indices.997 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited
  • 2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes300 cited
  • 2002Optimal learning: computational procedures for bayes-adaptive markov decision processes236 cited
  • 2000Finite-time lower bounds for the two-armed bandit problem73 cited

Cited by

  • 2012Selecting Computations: Theory and Applications51 cited

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