Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

6
32
103
106
'10
'15
'20
'25

Papers

Collapsing Bandits and Their Application to Public Health Intervention NeurIPS 2020 Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints IJCAI 2020 Conditional Importance Sampling for Off-Policy Learning AISTATS 2020 Constrained Upper Confidence Reinforcement Learning L4DC 2020 Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting JMLR 2020 Coordination without communication: optimal regret in two players multi-armed bandits COLT 2020 Cost-Effective Incentive Allocation via Structured Counterfactual Inference AAAI 2020 Covariance-adapting algorithm for semi-bandits with application to sparse outcomes COLT 2020 Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NeurIPS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication ICLR 2020 Distributionally Robust Policy Evaluation and Learning in Offline Contextual Bandits ICML 2020 Diversified Interactive Recommendation with Implicit Feedback AAAI 2020 DORB: Dynamically Optimizing Multiple Rewards with Bandits EMNLP 2020 Efficient and robust algorithms for adversarial linear contextual bandits COLT 2020 Efficient and Robust High-Dimensional Linear Contextual Bandits IJCAI 2020 Efficient Automatic CASH via Rising Bandits AAAI 2020 Efficient Contextual Bandits with Continuous Actions NeurIPS 2020 Empirical Likelihood for Contextual Bandits NeurIPS 2020 Exact Passive-Aggressive Algorithms for Multiclass Classification Using Bandit Feedbacks ACML 2020 Fatigue-Aware Bandits for Dependent Click Models AAAI 2020 Finite-Time Analysis of Round-Robin Kullback-Leibler Upper Confidence Bounds for Optimal Adaptive Allocation with Multiple Plays and Markovian Rewards NeurIPS 2020 From Finite to Countable-Armed Bandits NeurIPS 2020 FrugalML: How to use ML Prediction APIs more accurately and cheaply NeurIPS 2020 Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits UAI 2020