← Back to all news
arXiv Machine Learning September 30, 2026 By Wansoo Choi, Seoungbin Bae, Dabeen Lee

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jun 9

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

arXiv:2606. 09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates.

By Seoungbin Bae, Dabeen Lee
More like this →
arXiv Machine Learning
Jul 14

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards

arXiv:2112. 06362v5 Announce Type: replace Abstract: We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments.

By Jung-hun Kim, Milan Vojnovic
reinforcement-learningefficiency
More like this →
arXiv Machine Learning
Jul 23

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

arXiv:2607. 19854v1 Announce Type: new Abstract: We study horizon-free regret minimization for finite-horizon time-homogeneous tabular Markov decision processes with $S$ states, $A$ actions, horizon $H$, and per-trajectory total reward bounded by $1$.

By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du
reinforcement-learning
More like this →
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.

By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop
reinforcement-learningbenchmarkssafety
More like this →
arXiv Statistics ML
Sep 2

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits

arXiv:2511.08097v2 Announce Type: replace-cross Abstract: We consider a general infinite horizon Heterogeneous Restless multi-armed Bandit (RMAB). Heterogeneity is a fundamental problem for many real...

By Dheeraj Narasimha, Nicolas Gast
reinforcement-learning
More like this →
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...

By Zhaohua Chen
benchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea