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 351–360 of 1262 papers

TitleStatusHype
Deep Neural Linear Bandits: Overcoming Catastrophic Forgetting through Likelihood Matching—0
Asymptotic Instance-Optimal Algorithms for Interactive Decision Making—0
Deep Contextual Bandits for Fast Initial Access in mmWave Based User-Centric Ultra-Dense Networks—0
Deep Upper Confidence Bound Algorithm for Contextual Bandit Ranking of Information Selection—0
Delay-Adaptive Learning in Generalized Linear Contextual Bandits—0
Delegating via Quitting Games—0
Designing an Interpretable Interface for Contextual Bandits—0
Designing Truthful Contextual Multi-Armed Bandits based Sponsored Search Auctions—0
Meta-Learning Bandit Policies by Gradient Ascent—0
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget—0
Show:102550
← PrevPage 36 of 127Next →

Benchmark Results

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