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 41–50 of 1262 papers

TitleStatusHype
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic EnvironmentsCode0
Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm—0
Collaborative Min-Max Regret in Grouped Multi-Armed Bandits—0
Meet Me at the Arm: The Cooperative Multi-Armed Bandits Problem with Shareable Arms—0
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards—0
From Theory to Practice with RAVEN-UCB: Addressing Non-Stationarity in Multi-Armed Bandits through Variance AdaptationCode0
VirnyFlow: A Design Space for Responsible Model DevelopmentCode0
Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms—0
COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents—0
A Reinforcement-Learning-Enhanced LLM Framework for Automated A/B Testing in Personalized Marketing—0
Show:102550
← PrevPage 5 of 127Next →

Benchmark Results

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