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 661–670 of 1262 papers

TitleStatusHype
The Pareto Frontier of model selection for general Contextual Bandits—0
Linear Contextual Bandits with Adversarial Corruptions—0
Towards the D-Optimal Online Experiment Design for Recommender SelectionCode0
Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Bandits—0
Dynamic pricing and assortment under a contextual MNL demand—0
Stateful Offline Contextual Policy Evaluation and Learning—0
Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Bandits—0
Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits—0
Bandits Don't Follow Rules: Balancing Multi-Facet Machine Translation with Multi-Armed Bandits—0
Query-Reward Tradeoffs in Multi-Armed Bandits—0
Show:102550
← PrevPage 67 of 127Next →

Benchmark Results

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