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

Spectral bandits JMLR 2020
Regret Bound for Safe Gaussian Process Bandit Optimization L4DC 2020
Constrained Upper Confidence Reinforcement Learning L4DC 2020
Agbots 2.0: Weeding Denser Fields with Fewer Robots RSS 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
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits UAI 2020
Bounded Rationality in Las Vegas: Probabilistic Finite Automata Play Multi-Armed Bandits UAI 2020
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
Bootstrapping Upper Confidence Bound 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