← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1044 directly classified papers

Papers per year

Papers

Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NIPS 2021
Optimal Best-Arm Identification Methods for Tail-Risk Measures NIPS 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NIPS 2021
Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature NIPS 2021
Bayesian decision-making under misspecified priors with applications to meta-learning NIPS 2021
Generalized Linear Bandits with Local Differential Privacy NIPS 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Bandit Learning with Delayed Impact of Actions NIPS 2021
Federated Linear Contextual Bandits NIPS 2021
Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020
Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020
Conditional Importance Sampling for Off-Policy Learning AISTATS 2020
Latent Bandits Revisited NIPS 2020
Learning Utilities and Equilibria in Non-Truthful Auctions NIPS 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
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020
A Markov Decision Process Model for Socio-Economic Systems Impacted by Climate Change ICML 2020
Budgeted Online Influence Maximization ICML 2020
Learning with Good Feature Representations in Bandits and in RL with a Generative Model ICML 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Linear Bandits with Feature Feedback AAAI 2020
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020
Agbots 2.0: Weeding Denser Fields with Fewer Robots RSS 2020