Sign inGet started
Paper · arXiv

Generalization bounds and sample complexity for remaining useful life prediction from complete degradation trajectories

Data-driven remaining useful life (RUL) prediction requires complete degradation trajectories for training, yet such run-to-failure data are scarce and expensive. Practitioners currently lack principled guidance on how many failure examples suffice for a given model and accuracy target. This paper develops a sample complexity framework for RUL prediction comprising seven main results organised around three themes. First, we establish fundamental learning rates: a distribution-free generalization bound shows that the uniform deviation of the mean squared error decreases as $O(B^{2}\sqrt{p/n})$, where $p$ is the model complexity and $n$ the number of trajectories, and a minimax lower bound ...

AuthorsHuy Hoang Le, Kim-Anh Nguyen
Primary categorycs.LG
Published26 July 2026
Last updated at source26 July 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/741e8480-9524-4196-96c1-134d1d267582" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.