conftrace_
← Learning Types
Machine Learning › Learning Types ›

Multi-Armed Bandits

1,057 papers

Papers per year

5
27
87
38
'10
'15
'20
'25

Papers

Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits NIPS 2022
Anonymous Bandits for Multi-User Systems NIPS 2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NIPS 2022
Non-stationary Bandits with Knapsacks NIPS 2022
Peer Prediction for Learning Agents NIPS 2022
When Combinatorial Thompson Sampling meets Approximation Regret NIPS 2022
Multi-Fidelity Best-Arm Identification NIPS 2022
Learning Infinite-Horizon Average-Reward Restless Multi-Action Bandits via Index Awareness NIPS 2022
The price of unfairness in linear bandits with biased feedback NIPS 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification NIPS 2022
An $\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits NIPS 2022
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model NIPS 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NIPS 2022
Lipschitz Bandits with Batched Feedback NIPS 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NIPS 2022
Adaptively Exploiting d-Separators with Causal Bandits NIPS 2022
Dynamic Learning in Large Matching Markets NIPS 2022
Pessimism for Offline Linear Contextual Bandits using $\ell_p$ Confidence Sets NIPS 2022
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions NIPS 2022
An Analysis of Ensemble Sampling NIPS 2022
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent NIPS 2022
Uplifting Bandits NIPS 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NIPS 2022
Diversified Recommendations for Agents with Adaptive Preferences NIPS 2022
IMED-RL: Regret optimal learning of ergodic Markov decision processes NIPS 2022