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 651–675 of 1262 papers

TitleStatusHype
Fighting Contextual Bandits with Stochastic Smoothing—0
Finding All -Good Arms in Stochastic Bandits—0
Finding the bandit in a graph: Sequential search-and-stop—0
Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap—0
Finite-Horizon Single-Pull Restless Bandits: An Efficient Index Policy For Scarce Resource Allocation—0
Finite-Time Analysis of Kernelised Contextual Bandits—0
Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation—0
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family 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
Foundations of Reinforcement Learning and Interactive Decision Making—0
From Bandits to Experts: A Tale of Domination and Independence—0
From Bandits to Experts: On the Value of Side-Observations—0
From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses—0
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information—0
Full Gradient Deep Reinforcement Learning for Average-Reward Criterion—0
Fully Gap-Dependent Bounds for Multinomial Logit Bandit—0
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation—0
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits—0
Gaussian Process bandits with adaptive discretization—0
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits—0
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits—0
Show:102550
← PrevPage 27 of 51Next →

Benchmark Results

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