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 691–700 of 1262 papers

TitleStatusHype
Greybox fuzzing as a contextual bandits problem—0
Guaranteed Fixed-Confidence Best Arm Identification in Multi-Armed Bandits: Simple Sequential Elimination Algorithms—0
GuideBoot: Guided Bootstrap for Deep Contextual Bandits—0
Hawkes Process Multi-armed Bandits for Disaster Search and Rescue—0
HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems—0
Heterogeneous Multi-Agent Bandits with Parsimonious Hints—0
Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models—0
Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks—0
Hierarchical Optimistic Region Selection driven by Curiosity—0
High-dimensional Linear Bandits with Knapsacks—0
Show:102550
← PrevPage 70 of 127Next →

Benchmark Results

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