SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Generic Exploration and K-armed Voting Bandits
10 references·2 citing·34 second hop
Generic Exploration and K-armed Voting Bandits (2013)Generic Exploration and K-armed Voting Ba…The K-armed dueling bandits problem (2012)The K-armed dueling bandits p…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-…Best Arm Identification in Multi-Armed Bandits (2010)Best Arm Identification in Mu…Interactively optimizing information retrieval systems as a dueling bandits problem (2009)Interactively optimizing info…Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Exploration–exploitation trad…A Short Introduction to Computational Social Choice (2007)A Short Introduction to Compu…Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Action Elimination and Stoppi…PAC Bounds for Multi-armed Bandit and Markov Decision Processes (2002)PAC Bounds for Multi-armed Ba…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Online rank elicitation for Plackett-Luce: a dueling bandits approach (2015)Online rank elicitation for P…A Survey of Preference-Based Online Learning with Bandit Algorithms (2014)A Survey of Preference-Based …Some aspects of the sequential design of experiments (1952)Prediction, Learning, and Games (2006)Almost Optimal Exploration in Multi-Armed Bandits (2013)Safe Exploration for Optimization with Gaussian Processes (2015)A unified framework for stochastic optimization (2018)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Bandits with Knapsacks (2013)lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits (2013)Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Learning diverse rankings with multi-armed bandits (2008)Reducing Dueling Bandits to Cardinal Bandits (2014)Contextual Bandits in a Collaborative Environment (2016)Social Choice and Individual Values. (1951)Social Choice and Individual Values (1952)A Course in Game Theory (1994)Budgeted social choice: from consensus to personalized decision making (2011)Computational Social Choice (2012)Introduction to Computational Social Choice (2016)Multi-Armed Bandit Allocation Indices. (1990)The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond (2011)Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Intrinsic motivation, curiosity, and learning (2016)The multi-armed bandit problem with covariates (2011)The best of both worlds: stochastic and adversarial bandits (2012)Coactive Learning (2015)Stagewise Safe Bayesian Optimization with Gaussian Processes (2018)Dynamic pricing with limited supply (2012)Information Complexity in Bandit Subset Selection (2013)Combinatorial Pure Exploration of Multi-Armed Bandits (2014)The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
  • 2010Best Arm Identification in Multi-Armed Bandits418 cited
  • 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
  • 2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes300 cited
  • 2010UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem285 cited
  • 2009Interactively optimizing information retrieval systems as a dueling bandits problem268 cited
  • 2007A Short Introduction to Computational Social Choice264 cited
  • 2012The K-armed dueling bandits problem248 cited
  • 2010Pure exploration in finitely-armed and continuous-armed bandits188 cited

Cited by

  • 2015Online rank elicitation for Plackett-Luce: a dueling bandits approach39 cited
  • 2014A Survey of Preference-Based Online Learning with Bandit Algorithms37 cited

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