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 926–950 of 1262 papers

TitleStatusHype
Online Allocation and Pricing: Constant Regret via Bellman Inequalities—0
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination—0
Online and Scalable Model Selection with Multi-Armed Bandits—0
Online certification of preference-based fairness for personalized recommender systems—0
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits—0
Generalizable Meta-Heuristic based on Temporal Estimation of Rewards for Large Scale Blackbox Optimization—0
Online Fair Division with Contextual Bandits—0
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits—0
Online Learning for Autonomous Management of Intent-based 6G Networks—0
Online Learning for Cooperative Multi-Player Multi-Armed Bandits—0
Online Learning in Contextual Bandits using Gated Linear Networks—0
Online learning over a finite action set with limited switching—0
Online Learning under Adversarial Corruptions—0
Online Learning via the Differential Privacy Lens—0
Online Learning with an Unknown Fairness Metric—0
Online learning with Corrupted context: Corrupted Contextual Bandits—0
Online learning with feedback graphs and switching costs—0
Online Learning with Off-Policy Feedback—0
Online Limited Memory Neural-Linear Bandits—0
Online Meta-Learning in Adversarial Multi-Armed Bandits—0
Online Posterior Sampling with a Diffusion Prior—0
Online Residential Demand Response via Contextual Multi-Armed Bandits—0
Online Restless Multi-Armed Bandits with Long-Term Fairness Constraints—0
Online Semi-Supervised Learning with Bandit Feedback—0
Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent—0
Show:102550
← PrevPage 38 of 51Next →

Benchmark Results

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