arXiv Machine Learning
Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Jul 15
Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation
We study the contextual combinatorial semi-bandit (CCSB) problem with general reward function approximation. At each round, the learner observes a context, selects a combinatorial action consisting of a subset of basic arms, and receives the reward of each selected arm; the goal is to maximize the cumulative reward over time.
arXiv Machine Learning
Jul 16
Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation
arXiv:2607. 13686v1 Announce Type: new Abstract: We study the contextual combinatorial semi-bandit (CCSB) problem with general reward function approximation.
arXiv Machine Learning
Jun 19
Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learning
arXiv:2606. 19883v1 Announce Type: new Abstract: We study a multi-agent multi-armed bandit problem in the competitive setup with two-sided matching markets under a human centric decision making model.
arXiv Machine Learning
Sep 22
Multi-Armed Bernoulli Bandits via Minimax Single-Arm Stopping
arXiv:2609. 22690v1 Announce Type: new Abstract: We develop an index policy for finite-horizon Bernoulli multi-armed bandits from minimax solutions to single-arm bandit (SAB) problems.
arXiv Machine Learning
Jun 16
Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
arXiv:2605. 01961v2 Announce Type: replace Abstract: Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents.
arXiv Machine Learning
Jun 29
Learning in Markovian bandits with non-observable states and constrained decision epochs
arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.