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 1101–1110 of 1262 papers

TitleStatusHype
An Optimal Algorithm for Multiplayer Multi-Armed Bandits—0
An optimal learning method for developing personalized treatment regimes—0
An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints—0
A General Reduction for High-Probability Analysis with General Light-Tailed Distributions—0
A Novel Approach to Balance Convenience and Nutrition in Meals With Long-Term Group Recommendations and Reasoning on Multimodal Recipes and its Implementation in BEACON—0
A One-Size-Fits-All Solution to Conservative Bandit Problems—0
Approximate Function Evaluation via Multi-Armed Bandits—0
Approximately Stationary Bandits with Knapsacks—0
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning—0
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints—0
Show:102550
← PrevPage 111 of 127Next →

Benchmark Results

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