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 751–800 of 1262 papers

TitleStatusHype
Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Bandits—0
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits—0
PAC-Bayesian Analysis of Contextual Bandits—0
PAC-Bayesian Lifelong Learning For Multi-Armed Bandits—0
PAC-Bayesian Offline Contextual Bandits With Guarantees—0
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits—0
PAC Reinforcement Learning with Rich Observations—0
Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy—0
Parallel Contextual Bandits in Wireless Handover Optimization—0
Parallelizing Contextual Bandits—0
Parameterized Exploration—0
Partial Bandit and Semi-Bandit: Making the Most Out of Scarce Users' Feedback—0
Partially Observable Contextual Bandits with Linear Payoffs—0
Personalization Paradox in Behavior Change Apps: Lessons from a Social Comparison-Based Personalized App for Physical Activity—0
Personalized Course Sequence Recommendations—0
Perturbed-History Exploration in Stochastic Multi-Armed Bandits—0
Pessimism for Offline Linear Contextual Bandits using _p Confidence Sets—0
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits—0
Phasic Diversity Optimization for Population-Based Reinforcement Learning—0
Non-Stationary Off-Policy Optimization—0
Player Modeling via Multi-Armed Bandits—0
Policy Gradients for Contextual Recommendations—0
Practical Algorithms for Best-K Identification in Multi-Armed Bandits—0
Practical Contextual Bandits with Regression Oracles—0
Preference-based Online Learning with Dueling Bandits: A Survey—0
Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms—0
Privacy Amplification via Shuffling for Linear Contextual Bandits—0
Privacy-Preserving Communication-Efficient Federated Multi-Armed Bandits—0
Privacy-Preserving Multi-Party Contextual Bandits—0
Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs—0
Productization Challenges of Contextual Multi-Armed Bandits—0
Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimization—0
Provable Benefits of Policy Learning from Human Preferences in Contextual Bandit Problems—0
Provable General Function Class Representation Learning in Multitask Bandits and MDPs—0
Provably and Practically Efficient Neural Contextual Bandits—0
Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks—0
Transfer Learning with Partially Observable Offline Data via Causal Bounds—0
Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback—0
Provably Efficient RLHF Pipeline: A Unified View from Contextual Bandits—0
Provably Optimal Algorithms for Generalized Linear Contextual Bandits—0
Pure Exploration in Asynchronous Federated Bandits—0
Pure exploration in multi-armed bandits with low rank structure using oblivious sampler—0
Combinatorial Pure Exploration of Causal Bandits—0
Pure Exploration under Mediators' Feedback—0
QoS-Aware Multi-Armed Bandits—0
Quantile Multi-Armed Bandits with 1-bit Feedback—0
Quantum contextual bandits and recommender systems for quantum data—0
Quantum Heavy-tailed Bandits—0
Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets—0
Query-Efficient Correlation Clustering with Noisy Oracle—0
Show:102550
← PrevPage 16 of 26Next →

Benchmark Results

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