← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Constrained Upper Confidence Reinforcement Learning L4DC 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020
Regret Analysis of Bandit Problems with Causal Background Knowledge UAI 2020
Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020
Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments AAAI 2020
Parameterized Indexed Value Function for Efficient Exploration in Reinforcement Learning AAAI 2020
Cost-Effective Incentive Allocation via Structured Counterfactual Inference AAAI 2020
Diversified Interactive Recommendation with Implicit Feedback AAAI 2020
Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NIPS 2020
A Bandit Learning Algorithm and Applications to Auction Design NIPS 2020
Locally Differentially Private (Contextual) Bandits Learning NIPS 2020
Neural Contextual Bandits with UCB-based Exploration ICML 2020
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020
Thompson Sampling via Local Uncertainty ICML 2020
Adaptive Estimator Selection for Off-Policy Evaluation ICML 2020
Distributionally Robust Policy Evaluation and Learning in Offline Contextual Bandits ICML 2020
Optimistic Policy Optimization with Bandit Feedback ICML 2020
Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards ICML 2020
Causal Bayesian Optimization AISTATS 2020
On Thompson Sampling for Smoother-than-Lipschitz Bandits AISTATS 2020
A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020
Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019
Approximations of the Restless Bandit Problem JMLR 2019
InterSpot: Interactive Spammer Detection in Social Media IJCAI 2019
Incorporating Behavioral Constraints in Online AI Systems AAAI 2019