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 1021–1030 of 1262 papers

TitleStatusHype
Privacy Amplification via Shuffling for Linear Contextual Bandits—0
Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits—0
Privacy-Preserving Multi-Party Contextual Bandits—0
Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs—0
Productization Challenges of Contextual Multi-Armed Bandits—0
Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimization—0
Provable Benefits of Policy Learning from Human Preferences in Contextual Bandit Problems—0
Provable General Function Class Representation Learning in Multitask Bandits and MDPs—0
Provably and Practically Efficient Neural Contextual Bandits—0
Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks—0
Show:102550
← PrevPage 103 of 127Next →

Benchmark Results

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