SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bandits with Budgets
16 references·0 citing·38 second hop
Bandits with Budgets (2015)Bandits with BudgetsKnapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits (2021)Knapsack Based Optimal Polici…Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms (2014)Unimodal Bandits: Regret Lowe…Informational confidence bounds for self-normalized averages and applications (2013)Informational confidence boun…Bandits with Knapsacks (2013)Bandits with KnapsacksThompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Thompson Sampling: An Asympto…Dynamic Pricing Under a General Parametric Choice Model (2012)Dynamic Pricing Under a Gener…Combinatorial bandits (2012)Combinatorial banditsThe KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)The KL-UCB Algorithm for Boun…ε-first policies for budget-limited multi-armed bandits (2010)ε-first policies for budget-l…Regret bounds for sleeping experts and bandits (2010)Regret bounds for sleeping ex…Epsilon–First Policies for Budget–Limited Multi-Armed Bandits (2010)Epsilon–First Policies for Bu…Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (2009)Regret and Convergence Bounds…The on-line shortest path problem under partial monitoring (2007)The on-line shortest path pro…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…Adaptive Treatment Allocation and the Multi-Armed Bandit Problem (1987)Adaptive Treatment Allocation…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Bandit Processes and Dynamic Allocation Indices (1979)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Optimistic bayesian sampling in contextual-bandit problems (2012)Bandits With Heavy Tail (2013)KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)A Stochastic Approximation Method (1951)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)The Nonstochastic Multiarmed Bandit Problem (2002)Mortal Multi-Armed Bandits (2008)An Asymptotically Optimal Bandit Algorithm for Bounded Support Models. (2010)Multi-armed bandits with application to 5G small cells (2016)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)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Bandits with concave rewards and convex knapsacks (2014)Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Bandits with Knapsacks (2018)Discrete Choice Analysis: Theory and Application to Travel Demand. (1987)Discrete choice analysis: Theory and application to travel demand (1988)Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information (2014)Non-Stationary Stochastic Optimization (2015)On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning (2015)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)A Tutorial on Thompson Sampling (2018)Efficient algorithms for online decision problems (2004)Prediction, Learning, and Games (2006)From Bandits to Experts: On the Value of Side-Observations (2011)Regret in Online Combinatorial Optimization (2013)Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Optimal Adaptive Policies for Sequential Allocation Problems (1996)On Bayesian Upper Confidence Bounds for Bandit Problems (2012)Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments (2017)Efficient crowdsourcing of unknown experts using bounded multi-armed bandits (2014)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
  • 2011The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond363 cited
  • 2012Combinatorial bandits320 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 1987Adaptive Treatment Allocation and the Multi-Armed Bandit Problem279 cited
  • 2012Dynamic Pricing Under a General Parametric Choice Model275 cited
  • 2013Bandits with Knapsacks211 cited
  • 2010Regret bounds for sleeping experts and bandits200 cited
  • 2021Knapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits154 cited
  • 2007The on-line shortest path problem under partial monitoring151 cited
  • 2010Epsilon–First Policies for Budget–Limited Multi-Armed Bandits140 cited
  • 2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms97 cited
  • 2010ε-first policies for budget-limited multi-armed bandits83 cited
  • 2009Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems80 cited
  • 2013

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

Informational confidence bounds for self-normalized averages and applications
74 cited

Cited by

No citing works inside the corpus for this window.