SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
8 references·16 citing·41 second hop
Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the Continuum-Arm…The value of knowing a demand curve: bounds on regret for online posted-price auctions (2004)The value of knowing a demand…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Gambling in a rigged casino: …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Adaptive Game Playing Using Multiplicative Weights (1999)Adaptive Game Playing Using M…A two-armed bandit theory of market pricing (1974)A two-armed bandit theory of …Stochastic Estimation of the Maximum of a Regression Function (1952)Stochastic Estimation of the …From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)From Bandits to Monte-Carlo T…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…Bandits with Knapsacks (2013)Bandits with KnapsacksX -Armed Bandits (2011)X -Armed BanditsRegret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Regret Bounds for the Adaptiv…UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)UCB revisited: Improved regre…Pure exploration in finitely-armed and continuous-armed bandits (2010)Pure exploration in finitely-…Contextual Multi-Armed Bandits (2010)Contextual Multi-Armed BanditsInteractively optimizing information retrieval systems as a dueling bandits problem (2009)Interactively optimizing info…Contextual Bandits with Similarity Information (2009)Contextual Bandits with Simil…Efficient bandit algorithms for online multiclass prediction (2008)Efficient bandit algorithms f…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 Nonstochastic Multiarmed Bandit Problem (2002)Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)The multi-armed bandit problem with covariates (2011)The best of both worlds: stochastic and adversarial bandits (2012)Almost Optimal Exploration in Multi-Armed Bandits (2013)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Multi-armed bandits in metric spaces (2008)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)A Stochastic Approximation Method (1951)Acceleration of Stochastic Approximation by Averaging (1992)Multivariate stochastic approximation using a simultaneous perturbation gradient approximation (1992)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Learning diverse rankings with multi-armed bandits (2008)The K-armed dueling bandits problem (2012)Reducing Dueling Bandits to Cardinal Bandits (2014)Contextual Bandits in a Collaborative Environment (2016)The Economics of Information (1961)A model of price adjustment (1971)Micro-Economic Foundations of Employment and Inflation Theory. (1972)Bargains and Ripoffs: A Model of Monopolistically Competitive Price Dispersion (1977)Chapter 15 Job search and labor market analysis (1986)Trust as a commodity (1988)Contributions to the Theory of Games (1952)Theory of Games and Statistical Decisions. (1955)Contributions to the theory of games. (1960)A General Class of Adaptive Strategies (2001)Competitive On‐line Statistics (2001)Stochastic Approximations and Differential Inclusions (2005)Optimal Auction Design (1981)Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014)The sample complexity of revenue maximization (2014)The Theory of Learning in Games (1998)Online Learning and Online Convex Optimization (2011)Ad click prediction (2013)Some aspects of the sequential design of experiments (1952)Multi-Armed Bandit Allocation Indices. (1990)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Prediction, Learning, and Games (2006)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1952Stochastic Estimation of the Maximum of a Regression Function2,134 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem741 cited
  • 1974A two-armed bandit theory of market pricing617 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 1999Adaptive Game Playing Using Multiplicative Weights516 cited
  • 2004The value of knowing a demand curve: bounds on regret for online posted-price auctions296 cited

Cited by

  • 2010UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem285 cited
  • 2009Interactively optimizing information retrieval systems as a dueling bandits problem268 cited
  • 2009Contextual Bandits with Similarity Information238 cited
  • 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning233 cited
  • 2011Regret Bounds for the Adaptive Control of Linear Quadratic Systems213 cited
  • 2013Bandits with Knapsacks211 cited
  • 2011

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

X -Armed Bandits
205 cited
  • 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms196 cited
  • 2010Pure exploration in finitely-armed and continuous-armed bandits188 cited
  • 2007Online linear optimization and adaptive routing177 cited
  • 2007Improved Rates for the Stochastic Continuum-Armed Bandit Problem175 cited
  • 2010Contextual Multi-Armed Bandits175 cited
  • 2008Efficient bandit algorithms for online multiclass prediction170 cited
  • 2013Stochastic Convex Optimization with Bandit Feedback167 cited
  • 2008Algorithms for Infinitely Many-Armed Bandits159 cited
  • 2006An adaptive algorithm for selecting profitable keywords for search-based advertising services150 cited