SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The Continuum-Armed Bandit Problem
3 references·16 citing·38 second hop
The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit ProblemAsymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Asymptotically efficient allo…Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Stochastic Approximation Meth…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Minimal Exploration in Structured Stochastic Bandits (2017)Minimal Exploration in Struct…Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms (2014)Unimodal Bandits: Regret Lowe…Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms (2014)Lipschitz Bandits: Regret Low…Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Combinatorial Multi-Armed Ban…Stochastic Convex Optimization with Bandit Feedback (2013)Stochastic Convex Optimizatio…Dynamic pricing with limited supply (2012)Dynamic pricing with limited …From Bandits to Experts: On the Value of Side-Observations (2011)From Bandits to Experts: On t…An asymptotically optimal policy for finite support models in the multiarmed bandit problem (2011)An asymptotically optimal pol…Contextual Multi-Armed Bandits (2010)Contextual Multi-Armed BanditsAn Asymptotically Optimal Bandit Algorithm for Bounded Support Models. (2010)An Asymptotically Optimal Ban…Online Optimization in X-Armed Bandits (2008)Online Optimization in X-Arme…Algorithms for Infinitely Many-Armed Bandits (2008)Algorithms for Infinitely Man…Online linear optimization and adaptive routing (2007)Online linear optimization an…Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Improved Rates for the Stocha…An adaptive algorithm for selecting profitable keywords for search-based advertising services (2006)An adaptive algorithm for sel…The max K-armed bandit: a new model of exploration applied to search heuristic selection (2005)The max K-armed bandit: a new…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Bandit Algorithms for Tree Search (2014)The Nonstochastic Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Finite-Time Analysis of Kernelised Contextual Bandits (2013)Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits (2015)From Ads to Interventions: Contextual Bandits in Mobile Health (2017)A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online convex programming and generalized infinitesimal gradient ascent (2003)Projection-free Online Learning (2012)Multi-armed bandits with application to 5G small cells (2016)Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)Stochastic Estimation of the Maximum of a Regression Function (1952)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (2015)Bandit Convex Optimization with Biased Noisy Gradient Oracles (2017)Multi-Modal Dynamic Pricing (2019)Linearly Parameterized Bandits (2010)Combinatorial multi-armed bandit: general framework, results and applications (2013)Reducing Dueling Bandits to Cardinal Bandits (2014)Efficient learning by implicit exploration in bandit problems with side observations (2026)Multi-armed bandits in metric spaces (2008)Lipschitz Bandits without the Lipschitz Constant (2011)Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions (2013)Two-Target Algorithms for Infinite-Armed Bandits with Bernoulli Rewards (2013)Bandit Problems, Sequential Allocation of Experiments. (1987)Cascading Bandits: Learning to Rank in the Cascade Model (2015)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback (2016)Multi-Armed Bandit Problems (2007)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Convergence of least squares learning mechanisms in self-referential linear stochastic models (1989)Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization (2000)Monte Carlo Sampling Methods (2003)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1978Stochastic Approximation Methods for Constrained and Unconstrained Systems1,459 cited
  • 1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited

Cited by

  • 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms196 cited
  • 2007Online linear optimization and adaptive routing177 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited
  • 2010Contextual Multi-Armed Bandits175 cited
  • 2013Stochastic Convex Optimization with Bandit Feedback167 cited
  • 2011From Bandits to Experts: On the Value of Side-Observations167 cited
  • 2008Algorithms for Infinitely Many-Armed Bandits159 cited
  • 2006An adaptive algorithm for selecting profitable keywords for search-based advertising services150 cited
  • 2010An Asymptotically Optimal Bandit Algorithm for Bounded Support Models.139 cited
  • 2008Online Optimization in X-Armed Bandits131 cited
  • 2005The max K-armed bandit: a new model of exploration applied to search heuristic selection114 cited
  • 2017

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

Minimal Exploration in Structured Stochastic Bandits
113 cited
  • 2012Dynamic pricing with limited supply98 cited
  • 2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms97 cited
  • 2014Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms94 cited
  • 2011An asymptotically optimal policy for finite support models in the multiarmed bandit problem94 cited