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 491–500 of 1262 papers

TitleStatusHype
Hypothesis Transfer in Bandits by Weighted Models—0
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression—0
Generalizing distribution of partial rewards for multi-armed bandits with temporally-partitioned rewards—0
Thompson Sampling for High-Dimensional Sparse Linear Contextual BanditsCode0
Safe and Adaptive Decision-Making for Optimization of Safety-Critical Systems: The ARTEO AlgorithmCode0
Adaptive Data Depth via Multi-Armed BanditsCode0
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms—0
Revisiting Simple Regret: Fast Rates for Returning a Good Arm—0
Robust Contextual Linear Bandits—0
PAC-Bayesian Offline Contextual Bandits With Guarantees—0
Show:102550
← PrevPage 50 of 127Next →

Benchmark Results

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