Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

6
32
103
106
'10
'15
'20
'25

Papers

Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Regret Minimization in Heavy-Tailed Bandits COLT 2021 Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021 Reinforcement Learning for Cost-Aware Markov Decision Processes ICML 2021 Reserve Price Optimization for First Price Auctions in Display Advertising ICML 2021 Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021 Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing ICML 2021 Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021 Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021 Robust Bandit Learning with Imperfect Context AAAI 2021 Robustness Guarantees for Mode Estimation with an Application to Bandits AAAI 2021 Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model AAAI 2021 Sparsity-Agnostic Lasso Bandit ICML 2021 Speaker Diarization as a Fully Online Bandit Learning Problem in MiniVox ACML 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021 Stochastic bandits with groups of similar arms. NeurIPS 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021 The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NeurIPS 2021 The Pareto Frontier of model selection for general Contextual Bandits NeurIPS 2021 Thompson Sampling Algorithms for Cascading Bandits JMLR 2021 Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021 Understanding Bandits with Graph Feedback NeurIPS 2021