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

Showing 651700 of 1262 papers

TitleStatusHype
Nonparametric Contextual Bandits in Metric Spaces with Unknown Metric0
Nonparametric Stochastic Contextual Bandits0
Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling0
Adversarial Rewards in Universal Learning for Contextual Bandits0
Non-Stationary Learning of Neural Networks with Automatic Soft Parameter Reset0
Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach0
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback0
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without0
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization0
No-Regret Learning for Fair Multi-Agent Social Welfare Optimization0
Observation-Augmented Contextual Multi-Armed Bandits for Robotic Search and Exploration0
Occupancy Information Ratio: Infinite-Horizon, Information-Directed, Parameterized Policy Search0
Offline Clustering of Linear Bandits: Unlocking the Power of Clusters in Data-Limited Environments0
Offline Contextual Bandits for Wireless Network Optimization0
Offline Contextual Multi-armed Bandits for Mobile Health Interventions: A Case Study on Emotion Regulation0
Offline Learning for Combinatorial Multi-armed Bandits0
Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff0
Off-policy estimation with adaptively collected data: the power of online learning0
Off-Policy Evaluation for Large Action Spaces via Policy Convolution0
Off-Policy Risk Assessment in Contextual Bandits0
Off-Policy Risk Assessment in Markov Decision Processes0
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits0
On conditional versus marginal bias in multi-armed bandits0
On Differentially Private Federated Linear Contextual Bandits0
On Finding the Largest Mean Among Many0
On Interpolating Experts and Multi-Armed Bandits0
On Kernelized Multi-armed Bandits0
On Kernelized Multi-Armed Bandits with Constraints0
On Lai's Upper Confidence Bound in Multi-Armed Bandits0
On Learning to Rank Long Sequences with Contextual Bandits0
Online Algorithm for Unsupervised Sequential Selection with Contextual Information0
Online Allocation and Pricing: Constant Regret via Bellman Inequalities0
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination0
Online and Scalable Model Selection with Multi-Armed Bandits0
Online certification of preference-based fairness for personalized recommender systems0
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits0
Generalizable Meta-Heuristic based on Temporal Estimation of Rewards for Large Scale Blackbox Optimization0
Online Fair Division with Contextual Bandits0
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits0
Online Learning for Autonomous Management of Intent-based 6G Networks0
Online Learning for Cooperative Multi-Player Multi-Armed Bandits0
Online Learning in Contextual Bandits using Gated Linear Networks0
Online learning over a finite action set with limited switching0
Online Learning under Adversarial Corruptions0
Online Learning via the Differential Privacy Lens0
Online Learning with an Unknown Fairness Metric0
Online learning with Corrupted context: Corrupted Contextual Bandits0
Online learning with feedback graphs and switching costs0
Online Learning with Off-Policy Feedback0
Online Limited Memory Neural-Linear Bandits0
Show:102550
← PrevPage 14 of 26Next →

Benchmark Results

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