atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Neural Closure Certificates

AAAI 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Differentiable and symbolic reasoning · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes neural closure certificates: a data-driven method that trains a ReLU neural network as a closure certificate to formally verify unknown dynamical systems against omega-regular properties, with correctness under Lipschitz assumptions.

Problem

Verifying unknown (closed-form-free) controlled dynamical systems against omega-regular (liveness and safety) properties, where existing closure certificate methods need explicit models and SOS/SMT solvers.

Approach

Represent closure certificates as ReLU neural networks trained on grid samples with a loss built from a bilinear S-procedure reformulation of the implications; a Lipschitz-based margin argument (L*eps/2 <= eta) lifts sample-level zero loss to a formal guarantee over all states.

Key results

Limitations

Experimental setup

Datasets: simulated samples from known transition functions of three case-study systems

Benchmarks: Kuramoto oscillator two-room temperature model inverted pendulum

Metrics: loss zero on samples Lipschitz-based condition (20) satisfied training time

Builds on: closure certificates transition invariants neural barrier certificates

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy