REVIEW 1 cited by
Stability-certified reinforcement learning: A control-theoretic perspective
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
Signed reviews
read the original abstract
We investigate the important problem of certifying stability of reinforcement learning policies when interconnected with nonlinear dynamical systems. We show that by regulating the input-output gradients of policies, strong guarantees of robust stability can be obtained based on a proposed semidefinite programming feasibility problem. The method is able to certify a large set of stabilizing controllers by exploiting problem-specific structures; furthermore, we analyze and establish its (non)conservatism. Empirical evaluations on two decentralized control tasks, namely multi-flight formation and power system frequency regulation, demonstrate that the reinforcement learning agents can have high performance within the stability-certified parameter space, and also exhibit stable learning behaviors in the long run.
Forward citations
Cited by 1 Pith paper
-
Verification of Neural Network Control Policy Under Persistent Adversarial Perturbation
A sufficient-condition algorithm certifies boundedness of a closed-loop neural-network control system under l-infinity-bounded persistent adversarial perturbation, without requiring Lipschitz continuity of the policy.
Discussion (0). Continue with ORCID to comment.