Pith. sign in

REVIEW 1 cited by

Optimizing Falsification for Learning-Based Control Systems: A Multi-Fidelity Bayesian Approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.08097 v1 pith:TBPYXRP7 submitted 2024-09-12 eess.SY cs.LGcs.SY

classification eess.SYcs.LGcs.SY
keywords optimizationbayesianfalsificationmulti-fidelityproblemsystemsapproachcomputationally
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Testing controllers in safety-critical systems is vital for ensuring their safety and preventing failures. In this paper, we address the falsification problem within learning-based closed-loop control systems through simulation. This problem involves the identification of counterexamples that violate system safety requirements and can be formulated as an optimization task based on these requirements. Using full-fidelity simulator data in this optimization problem can be computationally expensive. To improve efficiency, we propose a multi-fidelity Bayesian optimization falsification framework that harnesses simulators with varying levels of accuracy. Our proposed framework can transition between different simulators and establish meaningful relationships between them. Through multi-fidelity Bayesian optimization, we determine both the optimal system input likely to be a counterexample and the appropriate fidelity level for assessment. We evaluated our approach across various Gym environments, each featuring different levels of fidelity. Our experiments demonstrate that multi-fidelity Bayesian optimization is more computationally efficient than full-fidelity Bayesian optimization and other baseline methods in detecting counterexamples. A Python implementation of the algorithm is available at https://github.com/SAILRIT/MFBO_Falsification.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SMTL: A Stratified Logic for Expressive Multi-Level Temporal Specifications

    eess.SY 2025-01 reject novelty 5.0 of 10

    SMTL adds an abstraction-level operator to MTL, but its strict expressiveness proof is flawed and its simulation advantage is built into the specifications.

Pith tools