SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive-treed bandits
16 references·0 citing·28 second hop
Adaptive-treed bandits (2015)Adaptive-treed banditsStochastic simultaneous optimistic optimization (2026)Stochastic simultaneous optim…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Information-Theoretic Regret …X -Armed Bandits (2011)X -Armed BanditsOptimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness (2011)Optimistic Optimization of a …Lipschitz Bandits without the Lipschitz Constant (2011)Lipschitz Bandits without the…The Knowledge-Gradient Policy for Correlated Normal Beliefs (2009)The Knowledge-Gradient Policy…Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (2009)Regret and Convergence Bounds…Pure Exploration in Multi-armed Bandits Problems (2009)Pure Exploration in Multi-arm…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Improved Rates for the Stocha…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit Pr…Stochastic Estimation of the Maximum of a Regression Function (1952)Stochastic Estimation of the …Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…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)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)Online convex programming and generalized infinitesimal gradient ascent (2003)Contextual Bandits with Similarity Information (2009)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)Simulation Modeling and Analysis. (1983)Design and Analysis of Computer Experiments (1989)Statistics for Spatial Data (1993)Bayesian Optimization in a Billion Dimensions via Random Embeddings (2016)A Tutorial on Thompson Sampling (2018)A unified framework for stochastic optimization (2018)A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)Bandit Algorithms (2020)Acceleration of Stochastic Approximation by Averaging (1992)Multivariate stochastic approximation using a simultaneous perturbation gradient approximation (1992)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Safe Exploration for Optimization with Gaussian Processes (2015)Stochastic Convex Optimization with Bandit Feedback (2013)Thompson Sampling for Complex Online Problems (2014)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1952Stochastic Estimation of the Maximum of a Regression Function2,134 cited
  • 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 2009The Knowledge-Gradient Policy for Correlated Normal Beliefs408 cited
  • 2009Pure Exploration in Multi-armed Bandits Problems365 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 2011X -Armed Bandits205 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited
  • 2011Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness145 cited
  • 2009Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems80 cited
  • 2026Stochastic simultaneous optimistic optimization72 cited

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

2011
Lipschitz Bandits without the Lipschitz Constant
66 cited

Cited by

No citing works inside the corpus for this window.