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

Showing 2650 of 1262 papers

TitleStatusHype
A unifying framework for generalised Bayesian online learning in non-stationary environmentsCode1
BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed BanditsCode1
Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming ProblemCode1
Competing for Shareable Arms in Multi-Player Multi-Armed BanditsCode1
Langevin Monte Carlo for Contextual BanditsCode1
Discovering Minimal Reinforcement Learning EnvironmentsCode1
Efficient Contextual Bandits with Continuous ActionsCode1
Multiplayer Multi-armed Bandits for Optimal Assignment in Heterogeneous NetworksCode1
Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed banditsCode1
Pervasive Machine Learning for Smart Radio Environments Enabled by Reconfigurable Intelligent SurfacesCode1
A Modern Introduction to Online LearningCode1
Federated Multi-Armed BanditsCode1
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex NetworksCode0
Adapting multi-armed bandits policies to contextual bandits scenariosCode0
Combinatorial Multi-armed Bandits for Resource AllocationCode0
Combinatorial Bandits under Strategic ManipulationsCode0
Combining Diverse Information for Coordinated Action: Stochastic Bandit Algorithms for Heterogeneous AgentsCode0
Conditionally Risk-Averse Contextual BanditsCode0
Causal Contextual Bandits with Adaptive ContextCode0
Cascading Bandits for Large-Scale Recommendation ProblemsCode0
Causally Abstracted Multi-armed BanditsCode0
Safe and Adaptive Decision-Making for Optimization of Safety-Critical Systems: The ARTEO AlgorithmCode0
Budgeted Multi-Armed Bandits with Asymmetric Confidence IntervalsCode0
Bandit-Based Monte Carlo Optimization for Nearest NeighborsCode0
Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewardsCode0
Show:102550
← PrevPage 2 of 51Next →

Benchmark Results

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