SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Gamification of Pure Exploration for Linear Bandits
16 references·0 citing·36 second hop
Gamification of Pure Exploration for Linear Bandits (2020)Gamification of Pure Exploration for Line…Pure Exploration with Multiple Correct Answers (2019)Pure Exploration with Multipl…Non-Asymptotic Pure Exploration by Solving Games (2019)Non-Asymptotic Pure Explorati…Improving the Expected Improvement Algorithm (2017)Improving the Expected Improv…Optimal Best Arm Identification with Fixed Confidence (2016)Optimal Best Arm Identificati…Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (2016)Explore First, Exploit Next: …An optimal algorithm for the Thresholding Bandit Problem (2016)An optimal algorithm for the …Follow the Leader If You Can, Hedge If You Must (2013)Follow the Leader If You Can,…Almost Optimal Exploration in Multi-Armed Bandits (2013)Almost Optimal Exploration in…Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Best Arm Identification in Multi-Armed Bandits (2010)Best Arm Identification in Mu…PAC Bounds for Multi-armed Bandit and Markov Decision Processes (2002)PAC Bounds for Multi-armed Ba…Optimal design of experiments (1993)Optimal design of experimentsSequential Design of Experiments (1992)Sequential Design of Experime…Optimal and Efficient Designs of Experiments (1969)Optimal and Efficient Designs…Optimum Designs in Regression Problems (1959)Optimum Designs in Regression…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Bandit Algorithms (2020)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Introduction to Multi-Armed Bandits (2019)Experiments with Mixtures (1958)DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS (1959)General Equivalence Theory for Optimum Designs (Approximate Theory) (1974)D-Optimality for Regression Designs: A Review (1975)Response Surface Methodology: 1966-1988 (1989)A Method of Sampling Inspection (1929)Experimental Determination of the Maximum of a Function (1941)A Stochastic Approximation Method (1951)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Locally Optimal Designs for Estimating Parameters (1953)Multi-Factor Experimental Designs for Exploring Response Surfaces (1957)Optimum Experimental Designs (1959)Minimax and maximin distance designs (1990)Learning diverse rankings with multi-armed bandits (2008)On the Complexity of Best Arm Identification in Multi-Armed Bandit Models (2014)Non-stochastic Best Arm Identification and Hyperparameter Optimization (2015)Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization (2016)Optimum Experimental Designs (1993)Bayesian Experimental Design: A Review (1995)Uniform Design: Theory and Application (2000)Making and Evaluating Point Forecasts (2011)On Sequential Designs for Maximizing the Sum of $n$ Observations (1956)Uncertainty, Information, and Sequential Experiments (1962)A Biometrics Invited Paper. A Review of Response Surface Methodology from a Biometric Viewpoint (1975)Active sequential hypothesis testing (2013)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Multiplayer Bandits: A Trekking Approach (2021)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1993Optimal design of experiments1,563 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits920 cited
  • 1959Optimum Designs in Regression Problems796 cited
  • 2010Best Arm Identification in Multi-Armed Bandits448 cited
  • 2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes327 cited
  • 1992Sequential Design of Experiments309 cited
  • 2013Almost Optimal Exploration in Multi-Armed Bandits258 cited
  • 1969Optimal and Efficient Designs of Experiments193 cited
  • 2016Explore First, Exploit Next: The True Shape of Regret in Bandit Problems135 cited
  • 2016Optimal Best Arm Identification with Fixed Confidence115 cited
  • 2013Follow the Leader If You Can, Hedge If You Must92 cited
  • 2019Pure Exploration with Multiple Correct Answers76 cited
  • 2019Non-Asymptotic Pure Exploration by Solving Games76 cited
  • 2017Improving the Expected Improvement Algorithm76 cited
  • 2016An optimal algorithm for the Thresholding Bandit Problem68 cited

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

Cited by

No citing works inside the corpus for this window.