SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Pure Exploration with Multiple Correct Answers
12 references·1 citing·30 second hop
Pure Exploration with Multiple Correct Answers (2019)Pure Exploration with Multiple Correct An…Minimal Exploration in Structured Stochastic Bandits (2017)Minimal Exploration in Struct…On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)On the Complexity of Best Arm…Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Combinatorial Pure Exploratio…lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits (2013)lil' UCB : An Optimal Explora…Information Complexity in Bandit Subset Selection (2013)Information Complexity in Ban…Almost Optimal Exploration in Multi-Armed Bandits (2013)Almost Optimal Exploration in…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Pure exploration in finitely-armed and continuous-armed bandits (2010)Pure exploration in finitely-…Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Action Elimination and Stoppi…PAC Bounds for Multi-armed Bandit and Markov Decision Processes (2002)PAC Bounds for Multi-armed Ba…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Theory of Games and Statistical Decisions. (1955)Theory of Games and Statistic…Non-Asymptotic Pure Exploration by Solving Games (2019)Non-Asymptotic Pure Explorati…Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Non-stochastic Best Arm Identification and Hyperparameter Optimization (2015)Intelligent facial emotion recognition based on stationary wavelet entropy and Jaya algorithm (2017)A unified framework for stochastic optimization (2018)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Bandits with Knapsacks (2013)A Stochastic Approximation Method (1951)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)Learning diverse rankings with multi-armed bandits (2008)Best Arm Identification in Multi-Armed Bandits (2010)Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting (2014)Efficient Hyperparameter Optimization and Infinitely Many Armed Bandits (2017)Improved Algorithms for Linear Stochastic Bandits (2011)Exploration in Structured Reinforcement Learning (2018)Multi-Armed Bandits With Correlated Arms (2021)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)Team Decision Problems (1962)On Optimum Methods in Quickest Detection Problems (1963)The origin of predictable behavior (1983)Dynamic pricing with limited supply (2012)The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)Optimal Best Arm Identification with Fixed Confidence (2016)
this work references cited by second hop

References

  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 1955Theory of Games and Statistical Decisions.1,032 cited
  • 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Models704 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited
  • 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
  • 2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes300 cited
  • 2013Almost Optimal Exploration in Multi-Armed Bandits258 cited
  • 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits196 cited
  • 2010Pure exploration in finitely-armed and continuous-armed bandits188 cited
  • 2017Minimal Exploration in Structured Stochastic Bandits113 cited
  • 2013Information Complexity in Bandit Subset Selection107 cited
  • 2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited

Cited by

  • 2019Non-Asymptotic Pure Exploration by Solving Games76 cited

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