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 851–875 of 1262 papers

TitleStatusHype
Risk-Aware Algorithms for Adversarial Contextual Bandits—0
Risk-aware linear bandits with convex loss—0
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions—0
Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents—0
Robust Contextual Linear Bandits—0
Exploiting Heterogeneity in Robust Federated Best-Arm Identification—0
Robust Generalization of Quadratic Neural Networks via Function Identification—0
Robust Multi-Agent Multi-Armed Bandits—0
Robustness Guarantees for Mode Estimation with an Application to Bandits—0
Robust Pareto Set Identification with Contaminated Bandit Feedback—0
Restless and Uncertain: Robust Policies for Restless Bandits via Deep Multi-Agent Reinforcement Learning—0
Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks—0
Rotting Bandits—0
Rotting bandits are not harder than stochastic ones—0
Safe Linear Leveling Bandits—0
Safety-Aware Algorithms for Adversarial Contextual Bandit—0
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity—0
Sample complexity of partition identification using multi-armed bandits—0
Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning—0
Satisficing Exploration for Deep Reinforcement Learning—0
Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype—0
Scalable Discrete Sampling as a Multi-Armed Bandit Problem—0
Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees—0
Scale Free Adversarial Multi Armed Bandits—0
Scaling Multi-Armed Bandit Algorithms—0
Show:102550
← PrevPage 35 of 51Next →

Benchmark Results

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