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 431–440 of 1262 papers

TitleStatusHype
Stochastic Contextual Bandits with Long Horizon Rewards—0
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback—0
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback—0
Quantum contextual bandits and recommender systems for quantum data—0
Adversarial Attacks on Adversarial Bandits—0
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback—0
Contextual Causal Bayesian Optimisation—0
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits—0
Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning—0
Quantum Heavy-tailed Bandits—0
Show:102550
← PrevPage 44 of 127Next →

Benchmark Results

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