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 1161–1170 of 1262 papers

TitleStatusHype
Performance-Aware Self-Configurable Multi-Agent Networks: A Distributed Submodular Approach for Simultaneous Coordination and Network DesignCode0
Active Feature Selection for the Mutual Information CriterionCode0
Corralling a Band of Bandit AlgorithmsCode0
Online Semi-Supervised Learning in Contextual Bandits with Episodic RewardCode0
Correlated Multi-armed Bandits with a Latent Random SourceCode0
A New Bandit Setting Balancing Information from State Evolution and Corrupted ContextCode0
Linear Contextual Bandits with Hybrid Payoff: RevisitedCode0
Persistency of Excitation for Robustness of Neural NetworksCode0
Thompson Sampling for High-Dimensional Sparse Linear Contextual BanditsCode0
Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit ApproachCode0
Show:102550
← PrevPage 117 of 127Next →

Benchmark Results

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