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 921–930 of 1262 papers

TitleStatusHype
On Kernelized Multi-armed Bandits—0
On Kernelized Multi-Armed Bandits with Constraints—0
On Lai's Upper Confidence Bound in Multi-Armed Bandits—0
On Learning to Rank Long Sequences with Contextual Bandits—0
Online Algorithm for Unsupervised Sequential Selection with Contextual Information—0
Online Allocation and Pricing: Constant Regret via Bellman Inequalities—0
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination—0
Online and Scalable Model Selection with Multi-Armed Bandits—0
Online certification of preference-based fairness for personalized recommender systems—0
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits—0
Show:102550
← PrevPage 93 of 127Next →

Benchmark Results

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