arXiv Machine Learning July 31, 2026 By Wentao Zhang, Wentao Mo

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

Read the original on arXiv Machine 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.

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.

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 AI

Sep 10

Constrained Online Learning with Noisy Constraint Values

arXiv:2609. 06921v1 Announce Type: cross Abstract: We study constrained online convex optimization with adversarial constraints when constraint values and gradients are observed through unbiased noise.

By Vaneet Aggarwal

safety

arXiv Machine Learning

Jun 2

Online Packet Scheduling with Deadlines and Learning

arXiv:2606. 00835v1 Announce Type: new Abstract: Network routers that enforce Quality-of-Service (QoS) guarantees must decide, at every clock cycle, which expiring packet of information to transmit, even when the value of the packet is unknown until it is processed.

By Gianmarco Genalti, Achraf Azize, Vianney Perchet

reinforcement-learning

arXiv Machine Learning

Aug 18

Beyond Peak Backlog: Conditional Energy and Temporal Geometry in Capacity-Constrained Delayed Bandit Optimization

arXiv:2608. 16216v1 Announce Type: new Abstract: What is the right delay complexity when a learner can track only $C$ pending feedback items and discarded feedback is permanently lost?

By Anling Xiang, Yuwen Yang, Yang Shen

reinforcement-learning

arXiv Machine Learning

Jun 11

Capacity-Constrained Online Convex Optimization with Delayed Feedback

arXiv:2606. 11711v1 Announce Type: new Abstract: Online learning with delayed feedback typically assumes that the learner can track all pending rounds until their feedback arrives.

By Alexander Ryabchenko, Idan Attias, Daniel M. Roy

reinforcement-learning

arXiv Machine Learning

Sep 15

High-Probability Nash Regret for Decentralized Learning in Markov $\alpha$-Potential Games: Episodic and Fully Online Asynchronous Algorithms with Applications to Markov Congestion Games

arXiv:2609. 14959v1 Announce Type: new Abstract: We study decentralized learning of Nash equilibria (NE) in infinite-horizon discounted Markov games under bandit feedback, focusing on Markov $\alpha$-potential games.

By S. Rasoul Etesami

reinforcement-learning safety

One email a morning, machine-written

Related stories

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

Constrained Online Learning with Noisy Constraint Values

Online Packet Scheduling with Deadlines and Learning

Beyond Peak Backlog: Conditional Energy and Temporal Geometry in Capacity-Constrained Delayed Bandit Optimization

Capacity-Constrained Online Convex Optimization with Delayed Feedback

High-Probability Nash Regret for Decentralized Learning in Markov $\alpha$-Potential Games: Episodic and Fully Online Asynchronous Algorithms with Applications to Markov Congestion Games