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 741–750 of 1262 papers

TitleStatusHype
Encrypted Linear Contextual Bandit—0
Nearest Neighbor Search Under Uncertainty—0
Efficient Algorithms for Finite Horizon and Streaming Restless Multi-Armed Bandit Problems—0
Selective Intervention Planning using Restless Multi-Armed Bandits to Improve Maternal and Child Health Outcomes—0
Fairness of Exposure in Stochastic Bandits—0
Local Clustering in Contextual Multi-Armed Bandits—0
Adapting to Misspecification in Contextual Bandits with Offline Regression Oracles—0
Online Multi-Armed Bandits with Adaptive Inference—0
Combinatorial Bandits under Strategic ManipulationsCode0
Federated Multi-armed Bandits with PersonalizationCode0
Show:102550
← PrevPage 75 of 127Next →

Benchmark Results

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