conftrace_
← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1,057 papers

Papers per year

5
27
87
38
'10
'15
'20
'25

Papers

Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NIPS 2020
Collapsing Bandits and Their Application to Public Health Intervention NIPS 2020
Batched Coarse Ranking in Multi-Armed Bandits NIPS 2020
Online Bayesian Persuasion NIPS 2020
Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition NIPS 2020
Choice Bandits NIPS 2020
Hedging in games: Faster convergence of external and swap regrets NIPS 2020
Fatigue-Aware Bandits for Dependent Click Models AAAI 2020
Monte-Carlo Tree Search in Continuous Action Spaces with Value Gradients AAAI 2020
Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020
Efficient Automatic CASH via Rising Bandits AAAI 2020
Diversified Interactive Recommendation with Implicit Feedback AAAI 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Cost-Effective Incentive Allocation via Structured Counterfactual Inference AAAI 2020
On Adaptivity in Information-Constrained Online Learning AAAI 2020
Linear Bandits with Feature Feedback AAAI 2020
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020
Parameterized Indexed Value Function for Efficient Exploration in Reinforcement Learning AAAI 2020
Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting AAAI 2020
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020
Multi-Source Domain Adaptation for Text Classification via DistanceNet-Bandits AAAI 2020
Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020
Safe Linear Stochastic Bandits AAAI 2020
Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments AAAI 2020
Conditional Importance Sampling for Off-Policy Learning AISTATS 2020