TL;DR
This paper presents a method to efficiently generate failure scenarios for learning-enabled controllers by dividing the input space based on failure likelihood, significantly speeding up failure discovery compared to traditional methods.
Contribution
The paper introduces a novel approach that leverages domain knowledge and data to create a generative model for rapid failure scenario identification in machine learning systems.
Findings
Achieved a thousand-fold speedup in failure scenario discovery
Effectively separates high and low failure probability regions
Validated approach on two experimental scenarios
Abstract
Machine learning models have prevalent applications in many real-world problems, which increases the importance of correctness in the behaviour of these trained models. Finding a good test case that can reveal the potential failure in these trained systems can help to retrain these models to increase their correctness. For a well-trained model, the occurrence of a failure is rare. Consequently, searching these rare scenarios by evaluating each sample in input search space or randomized search would be costly and sometimes intractable due to large search space, limited computational resources, and available time. In this paper, we tried to address this challenge of finding these failure scenarios faster than traditional randomized search. The central idea of our approach is to separate the input data space in region of high failure probability and region of low/minimal failure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsTest · SPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
