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 1201–1250 of 1262 papers

TitleStatusHype
A Survey on Contextual Multi-armed BanditsCode0
Episodic Multi-armed Bandits—0
Linear Contextual Bandits with Knapsacks—0
Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits—0
Selecting the best system and multi-armed bandits—0
Scalable Discrete Sampling as a Multi-Armed Bandit Problem—0
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives—0
Regulating Greed Over Time in Multi-Armed BanditsCode0
On Regret-Optimal Learning in Decentralized Multi-player Multi-armed Bandits—0
Thompson Sampling for Budgeted Multi-armed Bandits—0
Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits—0
Regret vs. Communication: Distributed Stochastic Multi-Armed Bandits and Beyond—0
Global Bandits—0
Networked Stochastic Multi-Armed Bandits with Combinatorial Strategies—0
Doubly Robust Policy Evaluation and Optimization—0
Learning to Search Better Than Your Teacher—0
Learning Multiple Tasks in Parallel with a Shared Annotator—0
Combinatorial Pure Exploration of Multi-Armed Bandits—0
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback—0
On Minimax Optimal Offline Policy Evaluation—0
Bandits Warm-up Cold Recommender Systems—0
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms—0
Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms—0
Reducing Dueling Bandits to Cardinal Bandits—0
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems—0
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits—0
Resourceful Contextual Bandits—0
Algorithms for multi-armed bandit problems—0
Taming the Monster: A Fast and Simple Algorithm for Contextual BanditsCode0
Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits—0
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits—0
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation—0
Distributed Exploration in Multi-Armed Bandits—0
Generalized Thompson Sampling for Contextual Bandits—0
Multi-Armed Bandits for Intelligent Tutoring Systems—0
Sequential Monte Carlo Bandits—0
Finite-Time Analysis of Kernelised Contextual Bandits—0
Building Bridges: Viewing Active Learning from the Multi-Armed Bandit Lens—0
Distributed Online Learning via Cooperative Contextual Bandits—0
Modeling Human Decision-making in Generalized Gaussian Multi-armed Bandits—0
Towards Distribution-Free Multi-Armed Bandits with Combinatorial Strategies—0
From Bandits to Experts: A Tale of Domination and Independence—0
On Finding the Largest Mean Among Many—0
Concentration bounds for temporal difference learning with linear function approximation: The case of batch data and uniform sampling—0
A Gang of Bandits—0
Dynamic Ad Allocation: Bandits with Budgets—0
Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits—0
Hierarchical Optimistic Region Selection driven by Curiosity—0
Risk-Aversion in Multi-armed Bandits—0
Thompson Sampling for Contextual Bandits with Linear PayoffsCode0
Show:102550
← PrevPage 25 of 26Next →

Benchmark Results

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