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 791–800 of 1262 papers

TitleStatusHype
BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed BanditsCode1
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many ArmsCode0
A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit—0
Resonance: Replacing Software Constants with Context-Aware Models in Real-time Communication—0
Fully Gap-Dependent Bounds for Multinomial Logit Bandit—0
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning—0
A New Bandit Setting Balancing Information from State Evolution and Corrupted ContextCode0
Improving Offline Contextual Bandits with Distributional Robustness—0
Metric-Free Individual Fairness with Cooperative Contextual Bandits—0
Active Reinforcement Learning: Observing Rewards at a Cost—0
Show:102550
← PrevPage 80 of 127Next →

Benchmark Results

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