pith. sign in

arxiv: 2307.11784 · v1 · pith:ERWD3QTDnew · submitted 2023-07-20 · 💻 cs.LG · cs.AI· cs.SE· cs.SY· eess.SY

What, Indeed, is an Achievable Provable Guarantee for Learning-Enabled Safety Critical Systems

classification 💻 cs.LG cs.AIcs.SEcs.SYeess.SY
keywords challengesguaranteesprovablelearning-enabledsafetysystemsverificationachievable
0
0 comments X
read the original abstract

Machine learning has made remarkable advancements, but confidently utilising learning-enabled components in safety-critical domains still poses challenges. Among the challenges, it is known that a rigorous, yet practical, way of achieving safety guarantees is one of the most prominent. In this paper, we first discuss the engineering and research challenges associated with the design and verification of such systems. Then, based on the observation that existing works cannot actually achieve provable guarantees, we promote a two-step verification method for the ultimate achievement of provable statistical guarantees.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.