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 971–980 of 1262 papers

TitleStatusHype
On The Statistical Complexity of Offline Decision-Making—0
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs—0
On Universally Optimal Algorithms for A/B Testing—0
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture—0
Open Problem: Model Selection for Contextual Bandits—0
Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards—0
Optimal Activation of Halting Multi-Armed Bandit Models—0
Optimal Algorithms for Range Searching over Multi-Armed Bandits—0
Optimal Algorithms for Stochastic Contextual Preference Bandits—0
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards—0
Show:102550
← PrevPage 98 of 127Next →

Benchmark Results

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