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 301–310 of 1262 papers

TitleStatusHype
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward—0
A conversion theorem and minimax optimality for continuum contextual bandits—0
Contextual Information-Directed Sampling—0
Contextual Linear Bandits with Delay as Payoff—0
Contextual memory bandit for pro-active dialog engagement—0
Contextual Multi-Armed Bandits for Causal Marketing—0
Bandits Don’t Follow Rules: Balancing Multi-Facet Machine Translation with Multi-Armed Bandits—0
Contextual Multinomial Logit Bandits with General Value Functions—0
Contextual Online Decision Making with Infinite-Dimensional Functional Regression—0
Context-Aware Bandits—0
Show:102550
← PrevPage 31 of 127Next →

Benchmark Results

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