Pith. sign in

REVIEW 1 cited by

Joint Differentiable Optimization and Verification for Certified Reinforcement Learning

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 2201.12243 v2 pith:F46R2GUG submitted 2022-01-28 cs.LG cs.SYeess.SY

classification cs.LGcs.SYeess.SY
keywords learningverificationoptimizationreinforcementcontrollerdifferentiableformalframework
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In model-based reinforcement learning for safety-critical control systems, it is important to formally certify system properties (e.g., safety, stability) under the learned controller. However, as existing methods typically apply formal verification \emph{after} the controller has been learned, it is sometimes difficult to obtain any certificate, even after many iterations between learning and verification. To address this challenge, we propose a framework that jointly conducts reinforcement learning and formal verification by formulating and solving a novel bilevel optimization problem, which is differentiable by the gradients from the value function and certificates. Experiments on a variety of examples demonstrate the significant advantages of our framework over the model-based stochastic value gradient (SVG) method and the model-free proximal policy optimization (PPO) method in finding feasible controllers with barrier functions and Lyapunov functions that ensure system safety and stability.

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. Learning Verifiable Control Policies Using Relaxed Verification

    eess.SY 2025-04 conditional novelty 5.0 of 10

    A loss function built from differentiable reachable-set bounds lets neural control policies be trained to satisfy reach-avoid and invariance specifications, so a lightweight verifier can re-check them at run time.

Pith tools