SOTAVerified

Multi-Armed Bandits

Multi-armed bandits refer to a task where a fixed amount of resources must be allocated between competing resources that maximizes expected gain. Typically these problems involve an exploration/exploitation trade-off.

( Image credit: Microsoft Research )

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 501–525 of 1262 papers

TitleStatusHype
Finite-Horizon Single-Pull Restless Bandits: An Efficient Index Policy For Scarce Resource Allocation—0
Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy—0
Scalable Decision-Focused Learning in Restless Multi-Armed Bandits with Application to Maternal and Child Health—0
Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation—0
Batched Thompson Sampling for Multi-Armed Bandits—0
First- and Second-Order Bounds for Adversarial Linear Contextual Bandits—0
Fixed-Budget Best-Arm Identification in Structured Bandits—0
FLASH: Federated Learning Across Simultaneous Heterogeneities—0
Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles—0
Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts—0
Decision Automation for Electric Power Network Recovery—0
Decentralized Smart Charging of Large-Scale EVs using Adaptive Multi-Agent Multi-Armed Bandits—0
Batched Thompson Sampling—0
An Adaptive Method for Contextual Stochastic Multi-armed Bandits with Rewards Generated by a Linear Dynamical System—0
Decentralized Multi-player Multi-armed Bandits with No Collision Information—0
Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits—0
Batched Online Contextual Sparse Bandits with Sequential Inclusion of Features—0
Decentralized Exploration in Multi-Armed Bandits -- Extended version—0
Batched Nonparametric Contextual Bandits—0
Decentralized Cooperative Reinforcement Learning with Hierarchical Information Structure—0
DBA bandits: Self-driving index tuning under ad-hoc, analytical workloads with safety guarantees—0
Data Poisoning Attacks on Stochastic Bandits—0
Batched Nonparametric Bandits via k-Nearest Neighbor UCB—0
Regret Bounds for Batched Bandits—0
A Model Selection Approach for Corruption Robust Reinforcement Learning—0
Show:102550
← PrevPage 21 of 51Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1NeuralLinear FullPosterior-MRCumulative regret1.92—Unverified
2Linear FullPosterior-MRCumulative regret1.82—Unverified