Pith. sign in

REVIEW 1 cited by

Verification-Aided Learning of Neural Network Barrier Functions with Termination Guarantees

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 2403.07308 v1 pith:C5J4ZPYM submitted 2024-03-12 cs.LG cs.AIcs.SYeess.SY

classification cs.LGcs.AIcs.SYeess.SY
keywords barrierfunctionfunctionslearningframeworkverification-aidedfine-tuningguarantees
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Barrier functions are a general framework for establishing a safety guarantee for a system. However, there is no general method for finding these functions. To address this shortcoming, recent approaches use self-supervised learning techniques to learn these functions using training data that are periodically generated by a verification procedure, leading to a verification-aided learning framework. Despite its immense potential in automating barrier function synthesis, the verification-aided learning framework does not have termination guarantees and may suffer from a low success rate of finding a valid barrier function in practice. In this paper, we propose a holistic approach to address these drawbacks. With a convex formulation of the barrier function synthesis, we propose to first learn an empirically well-behaved NN basis function and then apply a fine-tuning algorithm that exploits the convexity and counterexamples from the verification failure to find a valid barrier function with finite-step termination guarantees: if there exist valid barrier functions, the fine-tuning algorithm is guaranteed to find one in a finite number of iterations. We demonstrate that our fine-tuning method can significantly boost the performance of the verification-aided learning framework on examples of different scales and using various neural network verifiers.

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. Sample Efficient Certification of Discrete-Time Control Barrier Functions

    eess.SY 2025-09 conditional novelty 6.0 of 10

    A Lipschitz-based verification method for discrete-time control barrier functions that reduces required samples by allowing coarser sampling away from the safety boundary, with sample complexity bounds and a numerical...

Pith tools