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 871–880 of 1262 papers

TitleStatusHype
Confident Off-Policy Evaluation and Selection through Self-Normalized Importance WeightingCode0
Stochastic Network Utility Maximization with Unknown Utilities: Multi-Armed Bandits Approach—0
Stochastic Bandits with Linear Constraints—0
Constrained regret minimization for multi-criterion multi-armed banditsCode0
Finding All ε-Good Arms in Stochastic BanditsCode0
Non-Stationary Off-Policy Optimization—0
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners—0
Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme—0
TS-UCB: Improving on Thompson Sampling With Little to No Additional Computation—0
Bandits with Partially Observable Confounded Data—0
Show:102550
← PrevPage 88 of 127Next →

Benchmark Results

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