Generalization bounds and sample complexity for remaining useful life prediction from complete degradation trajectories
Not on the map. Why?
Abstract (arXiv)
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(B2√p/n), where p is the model complexity and n the number of trajectories, and a minimax lower bound proves that the Theta(p/n) rate is unimprovable. revSecond, we quantify how domain knowledge accelerates learning: incorporating degradation physics reduces data requirements by up to two orders of magnitude for deep networks, a Bernstein-type analysis achieves the minimax-optimal O(p/n) rate under high signal-to-noise conditions, and closed-form penalties reveal when an incorrectly assumed physics model hurts rather than helps. Third, we characterise the impact of data quality: fleet variability induces an irreducible bias-variance tradeoff, while right-censored observations suffer an efficiency loss that depends critically on the degradation class. Closed-form expressions are provided for exponential, power-law, and stretched-exponential degradation. revCross-domain validation against published turbofan, battery, and bearing benchmarks confirms the theoretical predictions within a factor of 2-3 on average. The results yield practical guidelines for planning data collection, selecting model complexity, and evaluating physics model assumptions in prognostics applications.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 59 references that are in the map. First posted on arXiv 26 Jul 2026.
Builds on
6 of 59 references.
References · 6
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 76
- 2021Dual Aspect Self-Attention based on Transformer for Remaining Useful Life Predictioncited by 16
- 2023ChatGPT-Like Large-Scale Foundation Models for Prognostics and Health Management: A Survey and Roadmapscited by 8
- 2025Deep Domain Adaptation for Turbofan Engine Remaining Useful Life Prediction: Methodologies, Evaluation and Future Trendscited by 1
Built on by
Not cited yet.