Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

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

Papers

Thompson Sampling via Local Uncertainty ICML 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020 Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020 X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks ACML 2019 Adaptive Influence Maximization with Myopic Feedback NeurIPS 2019 A New Perspective on Pool-Based Active Classification and False-Discovery Control NeurIPS 2019 An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019 Approximations of the Restless Bandit Problem JMLR 2019 Are sample means in multi-armed bandits positively or negatively biased? NeurIPS 2019 A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NeurIPS 2019 Bandits with Feedback Graphs and Switching Costs NeurIPS 2019 Batched Multi-armed Bandits Problem NeurIPS 2019 Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019 Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019 Best Arm Identification for Contaminated Bandits JMLR 2019 Blocking Bandits NeurIPS 2019 Bootstrapping Upper Confidence Bound NeurIPS 2019 BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback UAI 2019 Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model IJCAI 2019 Categorized Bandits NeurIPS 2019 Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NeurIPS 2019 Combinatorial Bandits with Relative Feedback NeurIPS 2019 Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NeurIPS 2019 Contextual Bandits with Cross-Learning NeurIPS 2019