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 271–280 of 1262 papers

TitleStatusHype
Combinatorial Multi-armed Bandits for Real-Time Strategy Games—0
A Reinforcement-Learning-Enhanced LLM Framework for Automated A/B Testing in Personalized Marketing—0
Combinatorial Multi-armed Bandits: Arm Selection via Group Testing—0
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints—0
Bayesian Analysis of Combinatorial Gaussian Process Bandits—0
Top-k Combinatorial Bandits with Full-Bandit Feedback—0
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning—0
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits—0
Adversarial Attacks on Adversarial Bandits—0
Adapting Bandit Algorithms for Settings with Sequentially Available Arms—0
Show:102550
← PrevPage 28 of 127Next →

Benchmark Results

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