arXiv — Machine Learning · · 4 min read

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

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2607.23454 (cs)
[Submitted on 26 Jul 2026]

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

View a PDF of the paper titled Generalization bounds and sample complexity for remaining useful life prediction from complete degradation trajectories, by Huy Hoang Le and Kim-Anh Nguyen
View PDF
Abstract: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 proves that the $\Theta(p/n)$ rate is unimprovable.} \rev{Second, 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. \rev{Cross-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.
Comments: This manuscript has been accepted for publication in Measurement Science and Technology. The final Version of Record is available at this https URL
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2607.23454 [cs.LG]
  (or arXiv:2607.23454v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2607.23454
arXiv-issued DOI via DataCite (pending registration)
Journal reference: Meas. Sci. Technol. 37(2026) 226203
Related DOI: https://doi.org/10.1088/1361-6501/ae7109
DOI(s) linking to related resources

Submission history

From: Huy Hoang Le [view email]
[v1] Sun, 26 Jul 2026 04:32:49 UTC (42 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Generalization bounds and sample complexity for remaining useful life prediction from complete degradation trajectories, by Huy Hoang Le and Kim-Anh Nguyen
  • View PDF
  • TeX Source

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning