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 101–125 of 1262 papers

TitleStatusHype
An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit—0
An Instrumental Value for Data Production and its Application to Data Pricing—0
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays—0
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits—0
An Optimal Algorithm for Multiplayer Multi-Armed Bandits—0
An optimal learning method for developing personalized treatment regimes—0
An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints—0
A General Reduction for High-Probability Analysis with General Light-Tailed Distributions—0
Asymptotic Convergence of Thompson Sampling—0
AdaLinUCB: Opportunistic Learning for Contextual Bandits—0
Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits—0
Automatic Ensemble Learning for Online Influence Maximization—0
Approximate Function Evaluation via Multi-Armed Bandits—0
Approximately Stationary Bandits with Knapsacks—0
Adversarial Attacks on Adversarial Bandits—0
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning—0
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints—0
A Reinforcement-Learning-Enhanced LLM Framework for Automated A/B Testing in Personalized Marketing—0
Algorithms for multi-armed bandit problems—0
A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits—0
A Sleeping, Recovering Bandit Algorithm for Optimizing Recurring Notifications—0
A Survey of Learning in Multiagent Environments: Dealing with Non-Stationarity—0
Adversarial Bandits with Knapsacks—0
A Survey of Risk-Aware Multi-Armed Bandits—0
Algorithms for Differentially Private Multi-Armed Bandits—0
Show:102550
← PrevPage 5 of 51Next →

Benchmark Results

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