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

TitleStatusHype
Early Stopping in Contextual Bandits and Inferences—0
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards—0
Optimizing Online Advertising with Multi-Armed Bandits: Mitigating the Cold Start Problem under Auction Dynamics—0
Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap—0
Meta-Prompt Optimization for LLM-Based Sequential Decision Making—0
Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information—0
Offline Learning for Combinatorial Multi-armed Bandits—0
Solving Inverse Problem for Multi-armed Bandits via Convex OptimizationCode0
Multi-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics—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
On The Statistical Complexity of Offline Decision-Making—0
Finite-Horizon Single-Pull Restless Bandits: An Efficient Index Policy For Scarce Resource Allocation—0
An Instrumental Value for Data Production and its Application to Data Pricing—0
Show:102550
← PrevPage 4 of 51Next →

Benchmark Results

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