arXiv Machine Learning July 31, 2026 By Pavel Novoa-Hern\'andez

Expected Survival-Time Bounds for Robust Optimization Over Time under Isotropic Gaussian Dynamics

Read the original on arXiv Machine Learning →

arXiv:2607. 27280v1 Announce Type: cross Abstract: Robust Optimization Over Time (ROOT) is a recent branch of evolutionary dynamic optimization that seeks solutions capable of remaining effective across multiple consecutive environments.

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 27

General Value Functions for Remaining Useful Life and Failure-Mode Prediction

arXiv:2607. 22268v1 Announce Type: cross Abstract: Remaining useful life (RUL) prediction and failure-mode classification are central tasks in predictive maintenance.

By Hao Yan, Ali Sarabi, Qing Zou, Boyang Xu

arXiv Machine Learning

Jul 17

Data Driven Block Replacement Scheduling

arXiv:2607. 15229v1 Announce Type: new Abstract: We develop data-driven algorithms for maintaining $N$ independent identical machines under a \textit{block replacement policy}, in which each machine is replaced upon failure and all machines are jointly replaced at regular intervals of length $k$.

By Aniruddhan Ganesaraman, VIdyadhar Kulkarni

reinforcement-learning benchmarks

arXiv Machine Learning

Aug 4

Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies

arXiv:2608. 02509v1 Announce Type: cross Abstract: Sequential decision-making in real-world applications often involves uncertainty about the environment's model.

By Sterre Lutz, Dani\"el Vos, Matthijs T. J. Spaan, Anna Lukina

reinforcement-learning benchmarks safety

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

Hugging Face Trending Papers

Aug 3

Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies

Sequential decision-making in real-world applications often involves uncertainty about the environment's model. Uncertain Markov decision processes (UMDPs) represent the possible environments as a set of MDPs with shared states and actions but potentially different transition probabilities and rewards.

reinforcement-learning benchmarks safety

arXiv Machine Learning

Sep 22

Hierarchical Bayesian optimization of an aircraft-based multi-agent system-of-systems

The paper presents a hierarchical Bayesian optimization framework that uses Gaussian process meta-modeling to address the challenges of optimizing complex system-of-systems (SoS) architectures. It handles discrete architectural choices, conditional dependencies, and heterogeneous design variables, improving search efficiency and robustness over conventional surrogate-based methods. The approach is demonstrated on an aircraft-based multi-agent system for wildfire suppression, showing its applicability to large, diverse design spaces with limited simulation budgets.

By Paul Saves, Thierry Lefebvre, Nathalie Bartoli, Jasper Bussemaker, Nikolaos Kalliatakis, Nabih Naeem, Prajwal Prakasha

agents

One email a morning, machine-written

Related stories

General Value Functions for Remaining Useful Life and Failure-Mode Prediction

Data Driven Block Replacement Scheduling

Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies

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

Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies

Hierarchical Bayesian optimization of an aircraft-based multi-agent system-of-systems