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 851–860 of 1262 papers

TitleStatusHype
Multi-Armed Bandits for Minesweeper: Profiting from Exploration-Exploitation Synergy—0
Competing Bandits: The Perils of Exploration Under Competition—0
Minimax Policy for Heavy-tailed Bandits—0
Self-Tuning Bandits over Unknown Covariate-Shifts—0
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits—0
Quantum exploration algorithms for multi-armed banditsCode0
Optimal Learning for Structured BanditsCode0
Fair Algorithms for Multi-Agent Multi-Armed Bandits—0
Recurrent Neural-Linear Posterior Sampling for Nonstationary Contextual BanditsCode0
Robust Multi-Agent Multi-Armed Bandits—0
Show:102550
← PrevPage 86 of 127Next →

Benchmark Results

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