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 401–425 of 1262 papers

TitleStatusHype
Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Bandits—0
Dynamic Global Sensitivity for Differentially Private Contextual Bandits—0
Dynamic pricing and assortment under a contextual MNL demand—0
Dynamic Pricing with Limited Supply—0
Dynamic Product Image Generation and Recommendation at Scale for Personalized E-commerce—0
Early Stopping in Contextual Bandits and Inferences—0
Ease.ml: Towards Multi-tenant Resource Sharing for Machine Learning Workloads—0
EduQate: Generating Adaptive Curricula through RMABs in Education Settings—0
Adapting to Misspecification in Contextual Bandits—0
Efficient Action Poisoning Attacks on Linear Contextual Bandits—0
Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism—0
Efficient Algorithms for Finite Horizon and Streaming Restless Multi-Armed Bandit Problems—0
Efficient Algorithms for Learning to Control Bandits with Unobserved Contexts—0
Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits—0
Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits—0
Efficient Automatic CASH via Rising Bandits—0
Efficient Benchmarking of NLP APIs using Multi-armed Bandits—0
Efficient Contextual Bandits in Non-stationary Worlds—0
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries—0
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression—0
Efficient Contextual Bandits with Uninformed Feedback Graphs—0
Cost-Efficient Distributed Learning via Combinatorial Multi-Armed Bandits—0
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability—0
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination—0
Constrained Policy Optimization for Controlled Self-Learning in Conversational AI Systems—0
Show:102550
← PrevPage 17 of 51Next →

Benchmark Results

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