Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Improved Rates for the Stochastic Continuum-Armed Bandit Problem

3 references·16 citing·33 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
1995The Continuum-Armed Bandit Problem201 cited

Cited by

2010Contextual Multi-Armed Bandits175 cited
2014Bandit Algorithms for Tree Search170 cited
2013Stochastic Convex Optimization with Bandit Feedback167 cited
2008Algorithms for Infinitely Many-Armed Bandits159 cited
2011Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness145 cited
2013Parallel Gaussian process optimization with upper confidence bound and pure exploration144 cited
2008Online Optimization in X-Armed Bandits131 cited
2012Dynamic pricing with limited supply98 cited
2014Regret Minimization for Reserve Prices in Second-Price Auctions97 cited
2013Online Learning for Linearly Parametrized Control Problems90 cited
2021Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand85 cited
2019Bandits and Experts in Metric Spaces75 cited

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

2016

Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems

75 cited

2013Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration70 cited

2013Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions67 cited

2011Lipschitz Bandits without the Lipschitz Constant66 cited