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 101–150 of 1262 papers

TitleStatusHype
Contextual Linear Bandits with Delay as Payoff—0
Model selection for behavioral learning data and applications to contextual bandits—0
Near-Optimal Private Learning in Linear Contextual Bandits—0
Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing—0
Contextual bandits with entropy-based human feedbackCode0
Provably Efficient RLHF Pipeline: A Unified View from Contextual Bandits—0
Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models—0
Quantile Multi-Armed Bandits with 1-bit Feedback—0
Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Bandits—0
From Restless to Contextual: A Thresholding Bandit Approach to Improve Finite-horizon PerformanceCode0
Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback—0
Early Stopping in Contextual Bandits and Inferences—0
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards—0
Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap—0
Optimizing Online Advertising with Multi-Armed Bandits: Mitigating the Cold Start Problem under Auction Dynamics—0
Meta-Prompt Optimization for LLM-Based Sequential Decision Making—0
Offline Learning for Combinatorial Multi-armed Bandits—0
Multi-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics—0
Solving Inverse Problem for Multi-armed Bandits via Convex OptimizationCode0
Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information—0
Contextual Online Decision Making with Infinite-Dimensional Functional Regression—0
Breaking the (1/Δ_2) Barrier: Better Batched Best Arm Identification with Adaptive Grids—0
Sequential Learning of the Pareto Front for Multi-objective BanditsCode0
HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems—0
Restless Multi-armed Bandits under Frequency and Window Constraints for Public Service Inspections—0
Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy—0
Optimal Multi-Objective Best Arm Identification with Fixed Confidence—0
Efficient Implementation of LinearUCB through Algorithmic Improvements and Vector Computing Acceleration for Embedded Learning Systems—0
Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks—0
Multilinguality in LLM-Designed Reward Functions for Restless Bandits: Effects on Task Performance and Fairness—0
Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy—0
Neural Risk-sensitive Satisficing in Contextual Bandits—0
Differentially Private Kernelized Contextual Bandits—0
Finite-Horizon Single-Pull Restless Bandits: An Efficient Index Policy For Scarce Resource Allocation—0
On The Statistical Complexity of Offline Decision-Making—0
An Instrumental Value for Data Production and its Application to Data Pricing—0
A Novel Approach to Balance Convenience and Nutrition in Meals With Long-Term Group Recommendations and Reasoning on Multimodal Recipes and its Implementation in BEACON—0
Lagrangian Index Policy for Restless Bandits with Average Reward—0
MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximization—0
An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints—0
IRL for Restless Multi-Armed Bandits with Applications in Maternal and Child HealthCode0
UCB algorithms for multi-armed bandits: Precise regret and adaptive inference—0
Conservative Contextual Bandits: Beyond Linear Representations—0
Coordinated Multi-Armed Bandits for Improved Spatial Reuse in Wi-Fi—0
Data Acquisition for Improving Model Fairness using Reinforcement Learning—0
Selective Reviews of Bandit Problems in AI via a Statistical View—0
Achieving PAC Guarantees in Mechanism Design through Multi-Armed Bandits—0
Contextual Bandits in Payment Processing: Non-uniform Exploration and Supervised Learning at Adyen—0
Off-policy estimation with adaptively collected data: the power of online learning—0
Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions—0
Show:102550
← PrevPage 3 of 26Next →

Benchmark Results

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