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 451–500 of 1262 papers

TitleStatusHype
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits—0
EVOLvE: Evaluating and Optimizing LLMs For Exploration—0
Expanding on Repeated Consumer Search Using Multi-Armed Bandits and Secretaries—0
Expected Improvement-based Contextual Bandits—0
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners—0
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment—0
Exploration Potential—0
Exploration Through Bias: Revisiting Biased Maximum Likelihood Estimation in Stochastic Multi-Armed Bandits—0
Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits—0
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits—0
Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits—0
Exposure-Aware Recommendation using Contextual Bandits—0
Constant regret for sequence prediction with limited advice—0
Fair Algorithms for Multi-Agent Multi-Armed Bandits—0
Bandit Learning with Delayed Impact of Actions—0
Fair Contextual Multi-Armed Bandits: Theory and Experiments—0
Fair Exploration via Axiomatic Bargaining—0
Fairness and Privacy Guarantees in Federated Contextual Bandits—0
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits—0
Fairness for Workers Who Pull the Arms: An Index Based Policy for Allocation of Restless Bandit Tasks—0
Asymptotic Convergence of Thompson Sampling—0
Combinatorial Multi-armed Bandits: Arm Selection via Group Testing—0
Fairness of Exposure in Stochastic Bandits—0
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints—0
Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits—0
Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits—0
Combinatorial Multi-Armed Bandits with Filtered Feedback—0
Faster Maximum Inner Product Search in High Dimensions—0
Faster Q-Learning Algorithms for Restless Bandits—0
Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise—0
Federated Combinatorial Multi-Agent Multi-Armed Bandits—0
Federated Linear Bandits with Finite Adversarial Actions—0
Federated Linear Contextual Bandits—0
Federated Linear Contextual Bandits with Heterogeneous Clients—0
Federated Linear Contextual Bandits with User-level Differential Privacy—0
Conservative Contextual Bandits: Beyond Linear Representations—0
Federated Multi-Armed Bandits Under Byzantine Attacks—0
Combinatorial Semi-Bandits with Knapsacks—0
Combining Difficulty Ranking with Multi-Armed Bandits to Sequence Educational Content—0
Federated Online Sparse Decision Making—0
Federated Learning for Heterogeneous Bandits with Unobserved Contexts—0
FedMABA: Towards Fair Federated Learning through Multi-Armed Bandits Allocation—0
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning—0
Feel-Good Thompson Sampling for Contextual Dueling Bandits—0
Field Study in Deploying Restless Multi-Armed Bandits: Assisting Non-Profits in Improving Maternal and Child Health—0
Fighting Contextual Bandits with Stochastic Smoothing—0
Communication Efficient Distributed Learning for Kernelized Contextual Bandits—0
Finding All -Good Arms in Stochastic Bandits—0
Finding the bandit in a graph: Sequential search-and-stop—0
Conformal Off-Policy Prediction in Contextual Bandits—0
Show:102550
← PrevPage 10 of 26Next →

Benchmark Results

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