Pith. sign in

REVIEW 2 cited by

Formally Verifying Deep Reinforcement Learning Controllers with Lyapunov Barrier Certificates

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 2405.14058 v2 pith:WZUF2KQB submitted 2024-05-22 cs.AI cs.LGcs.SYeess.SY

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

Deep reinforcement learning (DRL) is a powerful machine learning paradigm for generating agents that control autonomous systems. However, the ``black box'' nature of DRL agents limits their deployment in real-world safety-critical applications. A promising approach for providing strong guarantees on an agent's behavior is to use Neural Lyapunov Barrier (NLB) certificates, which are learned functions over the system whose properties indirectly imply that an agent behaves as desired. However, NLB-based certificates are typically difficult to learn and even more difficult to verify, especially for complex systems. In this work, we present a novel method for training and verifying NLB-based certificates for discrete-time systems. Specifically, we introduce a technique for certificate composition, which simplifies the verification of highly-complex systems by strategically designing a sequence of certificates. When jointly verified with neural network verification engines, these certificates provide a formal guarantee that a DRL agent both achieves its goals and avoids unsafe behavior. Furthermore, we introduce a technique for certificate filtering, which significantly simplifies the process of producing formally verified certificates. We demonstrate the merits of our approach with a case study on providing safety and liveness guarantees for a DRL-controlled spacecraft.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Scalable Synthesis and Verification of String Stable Neural Certificates for Interconnected Systems

    eess.SY 2025-09 conditional novelty 7.0 of 10

    A CEGIS-based framework synthesizes and verifies discrete-time sISS certificates for neural controllers, giving formal string-stability guarantees for interconnected systems.

  2. Mining Verdict Boundaries for Neural Network Verification

    cs.LG 2026-07 conditional novelty 6.0 of 10

    BMiner speeds up Branch-and-Bound neural network verification by using exponential and gradient-guided search to skip subproblems on the way to each path's verdict boundary, cutting average verification time by 17–30%.

Pith tools