Skip to content
conftrace_

Multi-Armed Bandits

1,327 papers

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

Papers

Matching in Multi-arm Bandit with Collision NeurIPS 2022 Metalearning Linear Bandits by Prior Update AISTATS 2022 Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification NeurIPS 2022 Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits NeurIPS 2022 Minimax Regret for Cascading Bandits NeurIPS 2022 Modeling Attrition in Recommender Systems with Departing Bandits AAAI 2022 Model Selection in Batch Policy Optimization ICML 2022 Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022 Multi-armed Bandit Algorithm against Strategic Replication AISTATS 2022 Multi-Armed Bandit Problem with Temporally-Partitioned Rewards: When Partial Feedback Counts IJCAI 2022 Multi-Fidelity Best-Arm Identification NeurIPS 2022 Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms ICML 2022 Multi-slots Online Matching with High Entropy ICML 2022 MuMu: Cooperative Multitask Learning-Based Guided Multimodal Fusion AAAI 2022 Near Instance Optimal Model Selection for Pure Exploration Linear Bandits AISTATS 2022 Nearly Optimal Algorithms for Level Set Estimation AISTATS 2022 Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions NeurIPS 2022 Nested Bandits ICML 2022 Neural Contextual Bandits without Regret AISTATS 2022 Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NeurIPS 2022 Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NeurIPS 2022 Non-stationary Bandits with Knapsacks NeurIPS 2022 Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022 Nonstochastic Bandits with Composite Anonymous Feedback JMLR 2022 No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation NeurIPS 2022