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 111–120 of 1262 papers

TitleStatusHype
Censored Semi-Bandits: A Framework for Resource Allocation with Censored FeedbackCode0
Causally Abstracted Multi-armed BanditsCode0
Combinatorial Bandits under Strategic ManipulationsCode0
Hierarchical Multi-Armed Bandits for the Concurrent Intelligent Tutoring of Concepts and Problems of Varying Difficulty LevelsCode0
Cascading Bandits for Large-Scale Recommendation ProblemsCode0
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm ConfigurationCode0
Adversarial Attacks on Combinatorial Multi-Armed BanditsCode0
Causal Contextual Bandits with Adaptive ContextCode0
Adapting multi-armed bandits policies to contextual bandits scenariosCode0
Combinatorial Multi-armed Bandits for Resource AllocationCode0
Show:102550
← PrevPage 12 of 127Next →

Benchmark Results

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