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 91–100 of 1262 papers

TitleStatusHype
Combining Diverse Information for Coordinated Action: Stochastic Bandit Algorithms for Heterogeneous AgentsCode0
Censored Semi-Bandits: A Framework for Resource Allocation with Censored FeedbackCode0
Adaptive Linear Estimating EquationsCode0
A Convex Framework for Confounding Robust InferenceCode0
Combinatorial Bandits under Strategic ManipulationsCode0
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex NetworksCode0
Bandit-Based Monte Carlo Optimization for Nearest NeighborsCode0
An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed BanditsCode0
Safe and Adaptive Decision-Making for Optimization of Safety-Critical Systems: The ARTEO AlgorithmCode0
Cascading Bandits for Large-Scale Recommendation ProblemsCode0
Show:102550
← PrevPage 10 of 127Next →

Benchmark Results

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