SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Contextual Bandit Bake-off
10 references·3 citing·36 second hop
A Contextual Bandit Bake-off (2018)A Contextual Bandit Bake-offThe self-normalized estimator for counterfactual learning (2015)The self-normalized estimator…Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (2014)Taming the Monster: A Fast an…Ad click prediction (2013)Ad click predictionThompson Sampling for Contextual Bandits with Linear Payoffs (2012)Thompson Sampling for Context…Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Efficient Optimal Learning for Contextual Bandits (2011)Efficient Optimal Learning fo…Doubly Robust Policy Evaluation and Learning (2011)Doubly Robust Policy Evaluati…An Empirical Evaluation of Thompson Sampling (2011)An Empirical Evaluation of Th…On the Generalization Ability of Online Strongly Convex Programming Algorithms (2008)On the Generalization Ability…The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information (2007)The Epoch-Greedy Algorithm fo…The Externalities of Exploration and How Data Diversity Helps Exploitation (2023)The Externalities of Explorat…Selection Problems in the Presence of Implicit Bias (2023)Selection Problems in the Pre…Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Bypassing the Monster: A Fast…The Nonstochastic Multiarmed Bandit Problem (2002)Batch learning from logged bandit feedback through counterfactual risk minimization (2015)Online convex programming and generalized infinitesimal gradient ascent (2003)The Operational Value of Social Media Information (2015)Real-Time Bidding by Reinforcement Learning in Display Advertising (2017)Targeting and Privacy in Mobile Advertising (2018)Using confidence bounds for exploitation-exploration trade-offs (2003)Bandits with Knapsacks (2013)Counterfactual Risk Minimization: Learning from Logged Bandit Feedback (2015)Fairness in Learning: Classic and Contextual Bandits (2016)Multi-Armed Bandit Allocation Indices. (1990)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Learning to Optimize via Posterior Sampling (2014)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-Time Analysis of Kernelised Contextual Bandits (2013)From Ads to Interventions: Contextual Bandits in Mobile Health (2017)Adaptive Treatment Assignment in Experiments for Policy Choice (2021)Some aspects of the sequential design of experiments (1952)Prediction, Learning, and Games (2006)Introduction to Multi-Armed Bandits (2019)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Parametric Bandits: The Generalized Linear Case (2010)Online Decision Making with High-Dimensional Covariates (2019)Survey on Applications of Multi-Armed and Contextual Bandits (2020)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Multiclass classification with bandit feedback using adaptive regularization (2012)The Generalization Ability of Online Algorithms for Dependent Data (2012)On multilabel classification and ranking with bandit feedback (2014)Monte Carlo methods for security pricing (1997)Simulation and the Monte Carlo Method (2007)Deep Learning with Logged Bandit Feedback (2018)Artificial Intelligence for Social Good: A Survey (2020)Counterfactual Reward Modification for Streaming Recommendation with Delayed Feedback (2021)Further Optimal Regret Bounds for Thompson Sampling (2012)A Tutorial on Thompson Sampling (2018)
this work references cited by second hop

References

  • 2011An Empirical Evaluation of Thompson Sampling1,000 cited
  • 2013Ad click prediction870 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits860 cited
  • 2012Thompson Sampling for Contextual Bandits with Linear Payoffs600 cited
  • 2007The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information426 cited
  • 2011Doubly Robust Policy Evaluation and Learning383 cited
  • 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits286 cited
  • 2015The self-normalized estimator for counterfactual learning185 cited
  • 2011Efficient Optimal Learning for Contextual Bandits174 cited
  • 2008On the Generalization Ability of Online Strongly Convex Programming Algorithms113 cited

Cited by

  • 2021Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability46 cited
  • 2023The Externalities of Exploration and How Data Diversity Helps Exploitation19 cited
  • 2023Selection Problems in the Presence of Implicit Bias18 cited

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