SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Lipschitz Bandits without the Lipschitz Constant
12 references·2 citing·32 second hop
Lipschitz Bandits without the Lipschitz Constant (2011)Lipschitz Bandits without the Lipschitz C…X -Armed Bandits (2011)X -Armed BanditsRegret Bounds and Minimax Policies under Partial Monitoring (2010)Regret Bounds and Minimax Pol…Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (2009)Regret and Convergence Bounds…Stochastic Linear Optimization Under Bandit Feedback (2008)Stochastic Linear Optimizatio…Multi-armed bandits in metric spaces (2008)Multi-armed bandits in metric…Algorithms for Infinitely Many-Armed Bandits (2008)Algorithms for Infinitely Man…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…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …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…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Black-box optimization of noisy functions with unknown smoothness (2026)Black-box optimization of noi…Online Stochastic Optimization under Correlated Bandit Feedback (2014)Online Stochastic Optimizatio…A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Online linear optimization and adaptive routing (2007)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)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)Stochastic Estimation of the Maximum of a Regression Function (1952)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)Prediction, Learning, and Games (2006)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Safe Exploration for Optimization with Gaussian Processes (2015)Using confidence bounds for exploitation-exploration trade-offs (2003)Contextual Bandits with Linear Payoff Functions (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Contextual Multi-Armed Bandits (2010)Stochastic Convex Optimization with Bandit Feedback (2013)Bandit Algorithms for Tree Search (2014)Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness (2011)Thompson Sampling for Complex Online Problems (2014)On Bayesian Upper Confidence Bounds for Bandit Problems (2012)Optimistic bayesian sampling in contextual-bandit problems (2012)Regret in Online Combinatorial Optimization (2013)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 2008Stochastic Linear Optimization Under Bandit Feedback581 cited
  • 2008Multi-armed bandits in metric spaces353 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 2010Regret Bounds and Minimax Policies under Partial Monitoring213 cited
  • 2011X -Armed Bandits205 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited
  • 2008Algorithms for Infinitely Many-Armed Bandits159 cited
  • 2009Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems80 cited

Cited by

  • 2014Online Stochastic Optimization under Correlated Bandit Feedback45 cited
  • 2026Black-box optimization of noisy functions with unknown smoothness42 cited

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