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 411–420 of 1262 papers

TitleStatusHype
BEACON: Balancing Convenience and Nutrition in Meals With Long-Term Group Recommendations and Reasoning on Multimodal Recipes—0
Efficient Algorithms for Finite Horizon and Streaming Restless Multi-Armed Bandit Problems—0
Efficient Algorithms for Learning to Control Bandits with Unobserved Contexts—0
Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits—0
Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits—0
Efficient Automatic CASH via Rising Bandits—0
Delegating via Quitting Games—0
Efficient Contextual Bandits in Non-stationary Worlds—0
Delay-Adaptive Learning in Generalized Linear Contextual Bandits—0
An Analysis of the Value of Information when Exploring Stochastic, Discrete Multi-Armed Bandits—0
Show:102550
← PrevPage 42 of 127Next →

Benchmark Results

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