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

Dynamic Balancing for Model Selection in Bandits and RL ICML 2021
Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing ICML 2021
Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021
Reserve Price Optimization for First Price Auctions in Display Advertising ICML 2021
Parametric Graph for Unimodal Ranking Bandit ICML 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021
Optimal Streaming Algorithms for Multi-Armed Bandits ICML 2021
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021
MOTS: Minimax Optimal Thompson Sampling ICML 2021
Bias-Robust Bayesian Optimization via Dueling Bandits ICML 2021
Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching ICML 2021
Sparsity-Agnostic Lasso Bandit ICML 2021
Leveraging Good Representations in Linear Contextual Bandits ICML 2021
Best Arm Identification in Graphical Bilinear Bandits ICML 2021
Adversarial Dueling Bandits ICML 2021
Dueling Convex Optimization ICML 2021
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021
Collaborative Bayesian Optimization with Fair Regret ICML 2021
Dynamic Planning and Learning under Recovering Rewards ICML 2021
Reinforcement Learning for Cost-Aware Markov Decision Processes ICML 2021
Approximation Theory Based Methods for RKHS Bandits ICML 2021
Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021