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 1081–1090 of 1262 papers

TitleStatusHype
Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for Reinforcement LearningCode0
Introduction to Multi-Armed BanditsCode0
Invariant Policy Learning: A Causal PerspectiveCode0
Equal Opportunity in Online Classification with Partial FeedbackCode0
Inverse Contextual Bandits: Learning How Behavior Evolves over TimeCode0
An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed BanditsCode0
Combining Diverse Information for Coordinated Action: Stochastic Bandit Algorithms for Heterogeneous AgentsCode0
Information-Directed Selection for Top-Two AlgorithmsCode0
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex NetworksCode0
IRL for Restless Multi-Armed Bandits with Applications in Maternal and Child HealthCode0
Show:102550
← PrevPage 109 of 127Next →

Benchmark Results

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