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 51–100 of 1262 papers

TitleStatusHype
Offline Clustering of Linear Bandits: Unlocking the Power of Clusters in Data-Limited Environments—0
Test-Time Scaling of Diffusion Models via Noise Trajectory SearchCode0
KL-regularization Itself is Differentially Private in Bandits and RLHF—0
Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype—0
Optimal Best-Arm Identification under Fixed Confidence with Multiple Optima—0
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits—0
Human in the Loop Adaptive Optimization for Improved Time Series ForecastingCode0
High-dimensional Nonparametric Contextual Bandit Problem—0
Augmenting Online RL with Offline Data is All You Need: A Unified Hybrid RL Algorithm Design and Analysis—0
Multi-Armed Bandits Meet Large Language Models—0
Near Optimal Best Arm Identification for Clustered Bandits—0
Batched Nonparametric Bandits via k-Nearest Neighbor UCB—0
Adaptive, Robust and Scalable Bayesian Filtering for Online Learning—0
Navigating the Rashomon Effect: How Personalization Can Help Adjust Interpretable Machine Learning Models to Individual Users—0
Adaptive Budgeted Multi-Armed Bandits for IoT with Dynamic Resource Constraints—0
Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms—0
Access Probability Optimization in RACH: A Multi-Armed Bandits Approach—0
On the Problem of Best Arm Retention—0
Neural Contextual Bandits Under Delayed Feedback Constraints—0
Learning-Based User Association for MmWave Vehicular Networks With Kernelized Contextual Bandits—0
Towards More Efficient, Robust, Instance-adaptive, and Generalizable Sequential Decision making—0
A Classification View on Meta Learning Bandits—0
An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System—0
Antithetic Sampling for Top-k Shapley IdentificationCode0
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries—0
Reinforcement Learning for Machine Learning Model Deployment: Evaluating Multi-Armed Bandits in ML Ops Environments—0
MultiScale Contextual Bandits for Long Term Objectives—0
Sparse Additive Contextual Bandits: A Nonparametric Approach for Online Decision-making with High-dimensional Covariates—0
NeuroSep-CP-LCB: A Deep Learning-based Contextual Multi-armed Bandit Algorithm with Uncertainty Quantification for Early Sepsis PredictionCode0
Sparse Nonparametric Contextual Bandits—0
A New Benchmark for Online Learning with Budget-Balancing Constraints—0
Variance-Dependent Regret Lower Bounds for Contextual Bandits—0
Bi-Criteria Optimization for Combinatorial Bandits: Sublinear Regret and Constraint Violation under Bandit Feedback—0
Locally Private Nonparametric Contextual Multi-armed BanditsCode0
Multiplayer Information Asymmetric Contextual Bandits—0
Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference—0
Cost-Aware Optimal Pairwise Pure Exploration—0
Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure—0
Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits—0
Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits—0
Towards Understanding the Benefit of Multitask Representation Learning in Decision Process—0
Semi-Parametric Batched Global Multi-Armed Bandits with Covariates—0
Functional multi-armed bandit and the best function identification problems—0
Meta-Reasoner: Dynamic Guidance for Optimized Inference-time Reasoning in Large Language Models—0
Transfer Learning in Latent Contextual Bandits with Covariate Shift Through Causal TransportabilityCode0
Heterogeneous Multi-Agent Bandits with Parsimonious Hints—0
Multi-agent Multi-armed Bandits with Minimum Reward Guarantee FairnessCode0
Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling—0
Continuous K-Max Bandits—0
Efficient and Optimal Policy Gradient Algorithm for Corrupted Multi-armed Bandits—0
Show:102550
← PrevPage 2 of 26Next →

Benchmark Results

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