arXiv Machine Learning July 8, 2026 By Giovanni Montanari, Marco Scarsini, Vianney Perchet

Learning When to Automate: Queue Control in Human-AI Service Systems

Read the original on arXiv Machine Learning →

arXiv:2607. 06017v1 Announce Type: new Abstract: We study a human-AI service system in which tasks arrive sequentially and are processed through a two-stage architecture: an automated chatbot followed, when necessary, by a human agent.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

agents

arXiv Machine Learning

Jun 16

Design and Scheduling of an AI-based Queueing System

arXiv:2406. 06855v3 Announce Type: replace-cross Abstract: To leverage prediction models to make optimal scheduling decisions in service systems, we must understand how predictive errors impact congestion due to externalities on the delay of other jobs.

By Jiung Lee, Hongseok Namkoong, Yibo Zeng

llms fine-tuning safety

arXiv AI

Jun 17

Online LLM Selection via Constrained Bandits with Time-Varying Demand

arXiv:2606. 17489v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly deployed in edge-cloud inference systems to handle diverse user tasks with heterogeneous accuracy, latency, and cost profiles.

By Yin Huang, Qingsong Liu, Jie Xu

llms reinforcement-learning benchmarks

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-learning efficiency

arXiv Machine Learning

4d ago

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...

By Wansoo Choi, Seoungbin Bae, Dabeen Lee

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

arXiv Machine Learning

Jul 31

Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning

arXiv:2607. 27626v1 Announce Type: new Abstract: Safety-critical IoT systems such as industrial closed-loop control, V2X coordination, and remote teleoperation require every sensor's peak Age of Information (peak AoI, also abbreviated PAoI) to stay below a hard per-slot deadline, not merely an average bound.

By Wentao Zhang, Wentao Mo

reinforcement-learning safety

One email a morning, machine-written

Related stories

Design and Scheduling of an AI-based Queueing System

Online LLM Selection via Constrained Bandits with Time-Varying Demand

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

Nonpreemptive Scheduling While Learning Context-Dependent Service Rates

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

Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning