← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Linear Stochastic Bandits Under Safety Constraints NIPS 2019
Efficient Pure Exploration in Adaptive Round model NIPS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019
Batched Multi-armed Bandits Problem NIPS 2019
Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems NIPS 2019
Personalizing Many Decisions with High-Dimensional Covariates NIPS 2019
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NIPS 2019
Model Selection for Contextual Bandits NIPS 2019
Large Scale Markov Decision Processes with Changing Rewards NIPS 2019
Combinatorial Bandits with Relative Feedback NIPS 2019
Pure Exploration with Multiple Correct Answers NIPS 2019
Are sample means in multi-armed bandits positively or negatively biased? NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Optimal Best Markovian Arm Identification with Fixed Confidence NIPS 2019
Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits NIPS 2019
Policy Evaluation with Latent Confounders via Optimal Balance NIPS 2019
Categorized Bandits NIPS 2019
Learning Multiple Markov Chains via Adaptive Allocation NIPS 2019
Surrogate Objectives for Batch Policy Optimization in One-step Decision Making NIPS 2019
Decentralized Cooperative Stochastic Bandits NIPS 2019
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NIPS 2019
Blocking Bandits NIPS 2019
Sequential Experimental Design for Transductive Linear Bandits NIPS 2019
Non-Asymptotic Pure Exploration by Solving Games NIPS 2019