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 921–930 of 1262 papers

TitleStatusHype
Coordination without communication: optimal regret in two players multi-armed bandits—0
Tight Lower Bounds for Combinatorial Multi-Armed Bandits—0
A General Theory of the Stochastic Linear Bandit and Its Applications—0
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles—0
Adversarial Attacks on Linear Contextual Bandits—0
Inference for Batched Bandits—0
Selfish Robustness and Equilibria in Multi-Player Bandits—0
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity—0
Safe Exploration for Optimizing Contextual BanditsCode0
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback—0
Show:102550
← PrevPage 93 of 127Next →

Benchmark Results

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