Pith. sign in

REVIEW 1 cited by

Computing Lyapunov functions using deep neural networks

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 2005.08965 v2 pith:6O4O2WNQ submitted 2020-05-18 math.OC cs.NAmath.NA

classification math.OCcs.NAmath.NA
keywords lyapunovfunctionscompositionalcomputingdeepfunctionneuralnonlinear
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a deep neural network architecture and a training algorithm for computing approximate Lyapunov functions of systems of nonlinear ordinary differential equations. Under the assumption that the system admits a compositional Lyapunov function, we prove that the number of neurons needed for an approximation of a Lyapunov function with fixed accuracy grows only polynomially in the state dimension, i.e., the proposed approach is able to overcome the curse of dimensionality. We show that nonlinear systems satisfying a small-gain condition admit compositional Lyapunov functions. Numerical examples in up to ten space dimensions illustrate the performance of the training scheme.

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. Sequentially learning regions of attraction from data

    eess.SY 2025-05 conditional novelty 5.0 of 10

    Iteratively refining the tessellation and data converts locally failed piecewise affine Lyapunov certificates into nested level sets that jointly certify attraction to the equilibrium.

Pith tools