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 601650 of 1262 papers

TitleStatusHype
Efficient Resource Allocation with Fairness Constraints in Restless Multi-Armed Bandits0
Efficient Training of Multi-task Combinarotial Neural Solver with Multi-armed Bandits0
Empathic Responding for Digital Interpersonal Emotion Regulation via Content Recommendation0
ε-Neural Thompson Sampling of Deep Brain Stimulation for Parkinson Disease Treatment0
Ensemble Active Learning by Contextual Bandits for AI Incubation in Manufacturing0
Episodic Multi-armed Bandits0
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits0
Equipping Experts/Bandits with Long-term Memory0
Estimating Optimal Policy Value in General Linear Contextual Bandits0
Estimation Considerations in Contextual Bandits0
From Predictions to Decisions: The Importance of Joint Predictive Distributions0
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits0
EVOLvE: Evaluating and Optimizing LLMs For Exploration0
Expanding on Repeated Consumer Search Using Multi-Armed Bandits and Secretaries0
Expected Improvement-based Contextual Bandits0
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners0
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment0
Exploration Potential0
Exploration Through Bias: Revisiting Biased Maximum Likelihood Estimation in Stochastic Multi-Armed Bandits0
Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits0
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits0
Exponentiated Gradient LINUCB for Contextual Multi-Armed Bandits0
Exposure-Aware Recommendation using Contextual Bandits0
Fair Algorithms for Infinite and Contextual Bandits0
Fair Algorithms for Multi-Agent Multi-Armed Bandits0
Bandit Learning with Delayed Impact of Actions0
Fair Contextual Multi-Armed Bandits: Theory and Experiments0
Fair Exploration via Axiomatic Bargaining0
Fairness and Privacy Guarantees in Federated Contextual Bandits0
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits0
Fairness for Workers Who Pull the Arms: An Index Based Policy for Allocation of Restless Bandit Tasks0
Fairness in Learning: Classic and Contextual Bandits0
Fairness of Exposure in Stochastic Bandits0
Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits0
Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits0
Faster Maximum Inner Product Search in High Dimensions0
Faster Q-Learning Algorithms for Restless Bandits0
Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise0
Federated Combinatorial Multi-Agent Multi-Armed Bandits0
Federated Linear Bandits with Finite Adversarial Actions0
Federated Linear Contextual Bandits0
Federated Linear Contextual Bandits with Heterogeneous Clients0
Federated Linear Contextual Bandits with User-level Differential Privacy0
Federated Multi-Armed Bandits Under Byzantine Attacks0
Federated Online Sparse Decision Making0
Federated Learning for Heterogeneous Bandits with Unobserved Contexts0
FedMABA: Towards Fair Federated Learning through Multi-Armed Bandits Allocation0
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning0
Feel-Good Thompson Sampling for Contextual Dueling Bandits0
Field Study in Deploying Restless Multi-Armed Bandits: Assisting Non-Profits in Improving Maternal and Child Health0
Show:102550
← PrevPage 13 of 26Next →

Benchmark Results

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