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 481–490 of 1262 papers

TitleStatusHype
Incorporating Multi-armed Bandit with Local Search for MaxSATCode0
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget—0
Contextual Decision-Making with Knapsacks Beyond the Worst Case—0
Transfer Learning for Contextual Multi-armed Bandits—0
Contextual Bandits in a Survey Experiment on Charitable Giving: Within-Experiment Outcomes versus Policy Learning—0
Causal Bandits: Online Decision-Making in Endogenous Settings—0
Bandit Algorithms for Prophet Inequality and Pandora's Box—0
Latent Bottlenecked Attentive Neural ProcessesCode0
Multi-Player Bandits Robust to Adversarial Collisions—0
On Penalization in Stochastic Multi-armed Bandits—0
Show:102550
← PrevPage 49 of 127Next →

Benchmark Results

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