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 141–150 of 1262 papers

TitleStatusHype
IRL for Restless Multi-Armed Bandits with Applications in Maternal and Child HealthCode0
UCB algorithms for multi-armed bandits: Precise regret and adaptive inference—0
Conservative Contextual Bandits: Beyond Linear Representations—0
Coordinated Multi-Armed Bandits for Improved Spatial Reuse in Wi-Fi—0
Data Acquisition for Improving Model Fairness using Reinforcement Learning—0
Selective Reviews of Bandit Problems in AI via a Statistical View—0
Achieving PAC Guarantees in Mechanism Design through Multi-Armed Bandits—0
Contextual Bandits in Payment Processing: Non-uniform Exploration and Supervised Learning at Adyen—0
Off-policy estimation with adaptively collected data: the power of online learning—0
Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions—0
Show:102550
← PrevPage 15 of 127Next →

Benchmark Results

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