SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Fast boosting using adversarial bandits
7 references·3 citing·25 second hop
Fast boosting using adversarial bandits (2010)Fast boosting using adversarial banditsBandit Algorithms for Tree Search (2014)Bandit Algorithms for Tree Se…Exploration–exploitation tradeoff using variance estimates in multi-armed bandits (2009)Exploration–exploitation trad…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …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…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…Qualitative Multi-Armed Bandits: A Quantile-Based Approach (2015)Qualitative Multi-Armed Bandi…Detecting autism, emotions and social signals using adaboost (2013)Detecting autism, emotions an…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…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)Contributions to the Theory of Games (1952)An analog of the minimax theorem for vector payoffs (1956)Contributions to the theory of games. (1960)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Some aspects of the sequential design of experiments (1952)A Simple Adaptive Procedure Leading to Correlated Equilibrium (2000)Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Improved Algorithms for Linear Stochastic Bandits (2011)Introduction to Multi-Armed Bandits (2019)Multi-Armed Bandit Allocation Indices. (1990)Bandit Algorithms (2020)Multi-Armed Bandit Allocation Indices (1989)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)Detection of real-life emotions in call centers (2005)The INTERSPEECH 2013 computational paralinguistics challenge: social signals, conflict, emotion, autism (2013)Speech Based Emotion Recognition (2014)Quantile Context-Aware Social IoT Service Big Data Recommendation With D2D Communication (2020)Using confidence bounds for exploitation-exploration trade-offs (2003)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,503 cited
  • 2002Finite-time Analysis of the Multiarmed Bandit Problem6,033 cited
  • 2006Prediction, Learning, and Games3,223 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,229 cited
  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem750 cited
  • 2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
  • 2014Bandit Algorithms for Tree Search170 cited

Cited by

  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2013Detecting autism, emotions and social signals using adaboost37 cited
  • 2015Qualitative Multi-Armed Bandits: A Quantile-Based Approach30 cited

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