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 251–260 of 1262 papers

TitleStatusHype
Leveraging (Biased) Information: Multi-armed Bandits with Offline Data—0
Mathematics of statistical sequential decision-making: concentration, risk-awareness and modelling in stochastic bandits, with applications to bariatric surgery—0
Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback—0
Recommenadation aided Caching using Combinatorial Multi-armed Bandits—0
Disentangling Exploration from Exploitation—0
Causally Abstracted Multi-armed BanditsCode0
Structured Reinforcement Learning for Delay-Optimal Data Transmission in Dense mmWave Networks—0
Generalized Linear Bandits with Limited AdaptivityCode0
Sequential Decision Making with Expert Demonstrations under Unobserved HeterogeneityCode0
Feel-Good Thompson Sampling for Contextual Dueling Bandits—0
Show:102550
← PrevPage 26 of 127Next →

Benchmark Results

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