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 351400 of 1262 papers

TitleStatusHype
Deep Neural Linear Bandits: Overcoming Catastrophic Forgetting through Likelihood Matching0
Context-Aware Bandits0
Deep Contextual Bandits for Fast Initial Access in mmWave Based User-Centric Ultra-Dense Networks0
Deep Upper Confidence Bound Algorithm for Contextual Bandit Ranking of Information Selection0
Delay-Adaptive Learning in Generalized Linear Contextual Bandits0
Delegating via Quitting Games0
Designing an Interpretable Interface for Contextual Bandits0
Designing Truthful Contextual Multi-Armed Bandits based Sponsored Search Auctions0
Meta-Learning Bandit Policies by Gradient Ascent0
Differentially Private Episodic Reinforcement Learning with Heavy-tailed Rewards0
Differentially Private Kernelized Contextual Bandits0
Differentially Private Multi-Armed Bandits in the Shuffle Model0
Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost?0
Diffusion Approximations for Thompson Sampling0
Diffusion Models Meet Contextual Bandits with Large Action Spaces0
Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits0
Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits0
Discrete Choice Multi-Armed Bandits0
Disentangling Exploration from Exploitation0
Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication0
Asymptotic Instance-Optimal Algorithms for Interactive Decision Making0
Distributed Differential Privacy in Multi-Armed Bandits0
Distributed Exploration in Multi-Armed Bandits0
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget0
Multi-player Multi-armed Bandits for Stable Allocation in Heterogeneous Ad-Hoc Networks0
Distributed Multi-Task Learning for Stochastic Bandits with Context Distribution and Stage-wise Constraints0
Distributed Online Learning via Cooperative Contextual Bandits0
Distributed Optimization via Kernelized Multi-armed Bandits0
Distributed Thompson Sampling0
An Empirical Evaluation of Thompson Sampling0
Distributionally Robust Policy Evaluation and Learning in Offline Contextual Bandits0
Distributionally Robust Batch Contextual Bandits0
Distribution-dependent and Time-uniform Bounds for Piecewise i.i.d Bandits0
Distribution-Dependent Rates for Multi-Distribution Learning0
Diversify and Conquer: Bandits and Diversity for an Enhanced E-commerce Homepage Experience0
Diversity-Based Recruitment in Crowdsensing By Combinatorial Multi-Armed Bandits0
Diversity-Driven Selection of Exploration Strategies in Multi-Armed Bandits0
DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback0
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits0
Online Multi-Armed Bandits with Adaptive Inference0
Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing0
Bi-Criteria Optimization for Combinatorial Bandits: Sublinear Regret and Constraint Violation under Bandit Feedback0
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option0
Doubly robust off-policy evaluation with shrinkage0
Doubly-Robust Off-Policy Evaluation with Estimated Logging Policy0
Doubly Robust Policy Evaluation and Optimization0
Boltzmann Exploration Done Right0
Active Search for High Recall: a Non-Stationary Extension of Thompson Sampling0
Adapting to Misspecification in Contextual Bandits0
Dynamic Global Sensitivity for Differentially Private Contextual Bandits0
Show:102550
← PrevPage 8 of 26Next →

Benchmark Results

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