arXiv Machine Learning 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.

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

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