arXiv Machine Learning August 14, 2026 By Yujie Liu, Vincent Y. F. Tan, Yunbei Xu

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control

Read the original on arXiv Machine Learning →

arXiv:2506. 18278v4 Announce Type: replace-cross Abstract: We introduce an original minimax framework for finite-time performance analysis in queueing control and propose a surprisingly simple Lyapunov-based scheduling policy with superior finite-time performance.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 17

Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

arXiv:2606. 18218v1 Announce Type: cross Abstract: We study finite-horizon queue peaks in generalized switches, a standard stochastic-network model in which many queues share constrained service resources.

By Hao Liang, Cheng Tang, Yunzong Xu

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

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

Jul 3

Adjoint Matching through the Lens of the Stochastic Maximum Principle in Optimal Control

arXiv:2604. 08580v2 Announce Type: replace-cross Abstract: Reward fine-tuning of diffusion and flow models and sampling from tilted or Boltzmann distributions can both be formulated as stochastic optimal control (SOC) problems, where learning an optimal generative dynamics corresponds to optimizing a control under SDE constraints.

By Carles Domingo-Enrich, Jiequn Han

diffusion fine-tuning

arXiv Machine Learning

Aug 4

Heterogeneous Multi-Agent Reinforcement Learning for Radio Resource Management under Coupled Finite-Horizon Constraints

arXiv:2608. 01745v1 Announce Type: new Abstract: Maximizing throughput under proportional fairness in dense wireless networks requires jointly managing user association, scheduling, base station (BS) activation, and handover control under hard finite-horizon energy and handover budgets, which induces a fundamental tension between BS-side energy management and user-side handover regulation.

By Yeonseo Jeong, Wonhyeok Ko, Sungweon Hong, Songnam Hong

agents reinforcement-learning efficiency benchmarks safety

arXiv AI

Jul 21

Certified-Gap Dual-Price Policies for Real-Time Truckload Bid Acceptance with Relocating, Clock-Constrained Resources

arXiv:2607. 16891v1 Announce Type: cross Abstract: A truckload carrier must accept or reject each load tender within seconds.

By Aswin Chandrasekaran

benchmarks

Related stories

Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

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

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

Adjoint Matching through the Lens of the Stochastic Maximum Principle in Optimal Control

Heterogeneous Multi-Agent Reinforcement Learning for Radio Resource Management under Coupled Finite-Horizon Constraints

Certified-Gap Dual-Price Policies for Real-Time Truckload Bid Acceptance with Relocating, Clock-Constrained Resources