arXiv Statistics ML
Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Oct 7
Linear Bandits under Exact Sliding-Window Constraints
arXiv:2610. 08745v1 Announce Type: new Abstract: We study linear bandits under exact sliding-window constraints, where every consecutive block of actions must belong to a prescribed feasible set.
arXiv Machine Learning
Sep 30
Nonpreemptive Scheduling While Learning Context-Dependent Service Rates
arXiv:2609.37660v1 Announce Type: new Abstract: We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each roun...
arXiv Machine Learning
Oct 2
Rising Multi-Armed Bandits with Known Horizons
arXiv:2602.10727v3 Announce Type: replace Abstract: Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such proble...
arXiv Machine Learning
Oct 8
Online Resource Allocation with an Endogenous Markov State: Fewer LP Solves Earn More
arXiv:2610.09577v1 Announce Type: new Abstract: We study finite-horizon online resource allocation with i.i.d. requests and an endogenous Markov state on a finite state space: each action affects the...
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 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.