Pith. sign in

REVIEW 1 cited by

Learning Stability Certificates from Data

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 2008.05952 v2 pith:GIXUGCO2 submitted 2020-08-13 cs.LG cs.SYeess.SYstat.ML

Learning Stability Certificates from Data

classification cs.LG cs.SYeess.SYstat.ML
keywords certificatecertificateslearningstabilityalgorithmsboundscontroldata
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Many existing tools in nonlinear control theory for establishing stability or safety of a dynamical system can be distilled to the construction of a certificate function that guarantees a desired property. However, algorithms for synthesizing certificate functions typically require a closed-form analytical expression of the underlying dynamics, which rules out their use on many modern robotic platforms. To circumvent this issue, we develop algorithms for learning certificate functions only from trajectory data. We establish bounds on the generalization error - the probability that a certificate will not certify a new, unseen trajectory - when learning from trajectories, and we convert such generalization error bounds into global stability guarantees. We demonstrate empirically that certificates for complex dynamics can be efficiently learned, and that the learned certificates can be used for downstream tasks such as adaptive control.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Symplectic Inductive Bias for Data-Driven Target Reachability in Hamiltonian Systems

    math.OC 2026-04 unverdicted novelty 6.0

    Symplectic inductive bias combined with chain policies yields sufficient conditions for target reachability in Hamiltonian systems whose sample complexity depends on recurrence and geometry rather than ambient dimension.