Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Learning Types
Machine Learning
›
Learning Types
›
Multi-Armed Bandits
1044 directly classified papers
Papers per year
2002: 1
2006: 2
2007: 3
2008: 5
2009: 3
2010: 5
2011: 23
2012: 16
2013: 32
2014: 42
2015: 27
2016: 33
2017: 46
2018: 55
2019: 80
2020: 87
2021: 124
2022: 160
2023: 136
2024: 126
2025: 38
Papers
Online Multi-Armed Bandits with Adaptive Inference
NIPS 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent
AAAI 2021
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions
AAAI 2021
Online Posted Pricing with Unknown Time-Discounted Valuations
AAAI 2021
Coupon Design in Advertising Systems
AAAI 2021
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits
AAAI 2021
Decentralized Multi-Agent Linear Bandits with Safety Constraints
AAAI 2021
Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features
AAAI 2021
A One-Size-Fits-All Solution to Conservative Bandit Problems
AAAI 2021
Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits
AAAI 2021
Learning from eXtreme Bandit Feedback
AAAI 2021
Stochastic Bandits with Graph Feedback in Non-Stationary Environments
AAAI 2021
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality
AAAI 2021
Robustness Guarantees for Mode Estimation with an Application to Bandits
AAAI 2021
Meta-Learning Effective Exploration Strategies for Contextual Bandits
AAAI 2021
Near-Optimal MNL Bandits Under Risk Criteria
AAAI 2021
Robust Bandit Learning with Imperfect Context
AAAI 2021
Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model
AAAI 2021
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security
AAAI 2021
Comparison Lift: Bandit-based Experimentation System for Online Advertising
AAAI 2021
Contextual Bandits with Delayed Feedback and Semi-supervised Learning (Student Abstract)
AAAI 2021
Bandits Don’t Follow Rules: Balancing Multi-Facet Machine Translation with Multi-Armed Bandits
EMNLP 2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
NIPS 2021
Doubly Robust Thompson Sampling with Linear Payoffs
NIPS 2021
Multi-armed Bandit Requiring Monotone Arm Sequences
NIPS 2021
<
1
…
21
22
23
…
42
>