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 21–30 of 1262 papers

TitleStatusHype
EE-Net: Exploitation-Exploration Neural Networks in Contextual BanditsCode1
Efficient Contextual Bandits with Continuous ActionsCode1
Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions ModelingCode1
Hierarchical Adaptive Contextual Bandits for Resource Constraint based RecommendationCode1
A Modern Introduction to Online LearningCode1
An empirical evaluation of active inference in multi-armed banditsCode1
Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless BanditsCode1
Anytime-valid off-policy inference for contextual banditsCode1
LASeR: Learning to Adaptively Select Reward Models with Multi-Armed BanditsCode1
Generalized Linear Bandits with Local Differential PrivacyCode1
Show:102550
← PrevPage 3 of 127Next →

Benchmark Results

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