Compositional policy learning in stochastic control systems with formal guarantees
Reinforcement learning has shown promising results in learning neural network policies for complicated control tasks. However, the lack of formal guarantees about the behavior of such policies remains an impediment to their deployment. We propose a novel method for learning a composition of neural n...
Saved in:
Main Authors: | ZIKELIC, Dorde, LECHNER, Mathias, Verma, Abhinav, CHATTERJEE, Krishnendu, HENZINGER, Thomas A. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9031 https://ink.library.smu.edu.sg/context/sis_research/article/10034/viewcontent/13726_compositional_policy_learning_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Learning control policies for stochastic systems with reach-avoid guarantees
by: ZIKELIC, Dorde, et al.
Published: (2023) -
Learning provably stabilizing neural controllers for discrete-time stochastic systems
by: ANSARIPOUR, Matin, et al.
Published: (2023) -
A learner-verifier framework for neural network controllers and certificates of stochastic systems
by: CHATTERJEE, Krishnendu, et al.
Published: (2023) -
Stochastic invariants for probabilistic termination
by: CHATTERJEE, Krishnendu, et al.
Published: (2017) -
Sound and complete certificates for quantitative termination analysis of probabilistic programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2022)