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 711–720 of 1262 papers

TitleStatusHype
Imprecise Multi-Armed Bandits—0
Improved Algorithms for Adversarial Bandits with Unbounded Losses—0
Improved Algorithms for Misspecified Linear Markov Decision Processes—0
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback—0
Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms—0
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs—0
Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing—0
A Tractable Online Learning Algorithm for the Multinomial Logit Contextual Bandit—0
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards—0
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits—0
Show:102550
← PrevPage 72 of 127Next →

Benchmark Results

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