conftrace_

multi-armed bandit

1098 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) thompson sampling (237) upper confidence bound (197) regret minimization (315) online algorithm (445) sample complexity (1169) contextual bandit (381) best arm identification (85)

Papers

Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021
Near-Optimal MNL Bandits Under Risk Criteria AAAI 2021
Contextual Bandits with Delayed Feedback and Semi-supervised Learning (Student Abstract) AAAI 2021
Indexed Minimum Empirical Divergence for Unimodal Bandits NIPS 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NIPS 2021
Tuning Mixed Input Hyperparameters on the Fly for Efficient Population Based AutoRL NIPS 2021
Observation-Free Attacks on Stochastic Bandits NIPS 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NIPS 2021
Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature NIPS 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Federated Linear Contextual Bandits NIPS 2021
Corralling Stochastic Bandit Algorithms AISTATS 2021
Efficient Algorithms for Stochastic Repeated Second-price Auctions ALT 2021
Regret Minimization in Heavy-Tailed Bandits COLT 2021
Multiplayer Bandit Learning, from Competition to Cooperation COLT 2021
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions COLT 2021
Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds COLT 2021
Simple combinatorial algorithms for combinatorial bandits: corruptions and approximations UAI 2021
Regret Analysis of Bandit Problems with Causal Background Knowledge UAI 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020
Learning by Repetition: Stochastic Multi-armed Bandits under Priming Effect UAI 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020