SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Qualitative Multi-Armed Bandits: A Quantile-Based Approach
16 references·1 citing·26 second hopsampled
Qualitative Multi-Armed Bandits: A Quantile-Based Approach (2015)Qualitative Multi-Armed Bandits: A Quanti…Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing (2014)Optimal PAC Multiple Arm Iden…Algorithms for multi-armed bandit problems (2014)Algorithms for multi-armed ba…Risk-Aversion in Multi-armed Bandits (2013)Risk-Aversion in Multi-armed …Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem (2013)Relative Upper Confidence Bou…KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)KULLBACK-LEIBLER UPPER CONFID…The K-armed dueling bandits problem (2012)The K-armed dueling bandits p…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…PAC Subset Selection in Stochastic Multi-armed Bandits (2012)PAC Subset Selection in Stoch…Multi-Bandit Best Arm Identification (2011)Multi-Bandit Best Arm Identif…Regret Bounds and Minimax Policies under Partial Monitoring (2010)Regret Bounds and Minimax Pol…Fast boosting using adversarial bandits (2010)Fast boosting using adversari…Pure Exploration in Multi-armed Bandits Problems (2009)Pure Exploration in Multi-arm…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…The Sample Complexity of Exploration in the Multi-Armed Bandit Problem (2004)The Sample Complexity of Expl…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…Quantile Context-Aware Social IoT Service Big Data Recommendation With D2D Communication (2020)Quantile Context-Aware Social…Some aspects of the sequential design of experiments (1952)Individual Choice Behavior: A Theoretical Analysis. (1960)A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit (2015)Boltzmann Exploration Done Right (2017)Risk-aware multi-armed bandit problem with application to portfolio selection (2017)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2012)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Theory of games and economic behavior (2019)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Introduction to Multi-Armed Bandits (2019)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Multi-Armed Bandit Allocation Indices (1989)Multi-Armed Bandit Allocation Indices. (1990)Sample mean based index policies by O(log n) regret for the multi-armed bandit problem (1995)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Bandit Processes and Dynamic Allocation Indices (1979)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Batched bandit problems (2016)Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (2016)Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization (2016)Bandit Algorithms (2020)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem6,033 cited
  • 2006Prediction, Learning, and Games3,223 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2009Pure Exploration in Multi-armed Bandits Problems398 cited
  • 2014Algorithms for multi-armed bandit problems380 cited
  • 2002PAC Bounds for Multi-armed Bandit and Markov Decision Processes327 cited
  • 2004The Sample Complexity of Exploration in the Multi-Armed Bandit Problem318 cited
  • 2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
  • 2012The K-armed dueling bandits problem248 cited
  • 2010Regret Bounds and Minimax Policies under Partial Monitoring213 cited
  • 2012PAC Subset Selection in Stochastic Multi-armed Bandits188 cited
  • 2013Risk-Aversion in Multi-armed Bandits97 cited
  • 2011Multi-Bandit Best Arm Identification55 cited
  • 2013Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem53 cited
  • 2014Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing39 cited
  • 2010

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

Fast boosting using adversarial bandits
39 cited

Cited by

  • 2020Quantile Context-Aware Social IoT Service Big Data Recommendation With D2D Communication29 cited