contextual bandit

Online Algorithm Selection IJCAI 2017 Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017 Optimal and Adaptive Off-policy Evaluation in Contextual Bandits ICML 2017 Provably Optimal Algorithms for Generalized Linear Contextual Bandits ICML 2017 Real-Time Bidding with Side Information NeurIPS 2017 Safety-Aware Algorithms for Adversarial Contextual Bandit ICML 2017 An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives COLT 2016 BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016 Bounded Off-Policy Evaluation with Missing Data for Course Recommendation and Curriculum Design ICML 2016 Contextual Combinatorial Cascading Bandits ICML 2016 Contextual semibandits via supervised learning oracles NeurIPS 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 Fairness in Learning: Classic and Contextual Bandits NeurIPS 2016 Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits NeurIPS 2016 Linear Contextual Bandits with Knapsacks NeurIPS 2016 PAC Reinforcement Learning with Rich Observations NeurIPS 2016 Random Forest for the Contextual Bandit Problem AISTATS 2016 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 Contextual Dueling Bandits COLT 2015 Learning to Search Better than Your Teacher ICML 2015 Toward Minimax Off-policy Value Estimation AISTATS 2015 Contextual Bandits with Similarity Information JMLR 2014 Discovering, Learning and Exploiting Relevance NeurIPS 2014 Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques ICML 2014 Learning Multiple Tasks in Parallel with a Shared Annotator NeurIPS 2014