Automata Learning for Neural Event ODEs: An Interpretable Model of Piecewise Dynamics

21 Sept 2023 (modified: 11 Feb 2024)Submitted to ICLR 2024EveryoneRevisionsBibTeX
Primary Area: neurosymbolic & hybrid AI systems (physics-informed, logic & formal reasoning, etc.)
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Keywords: Automata Learning, Neural ODEs, Domain Informed Machine Learning, Interpretable AI, Hybrid Systems, Piecewise ODEs, Active Learning, Event Detection Problem, Initial Value Problem, Discontinuous Dynamics
Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.
TL;DR: This paper presents a hybrid method combining automata learning and Neural Event ODEs for efficient and interpretable learning of black-box piecewise ODEs.
Abstract: Discrete events within a continuous system cause discontinuities in its derivatives. Given event specifications and state update functions, ODE solvers can integrate until an event, apply the update function, and restart the integration process to obtain a piecewise solution for the system. However, in many real-world scenarios, the event specifications are not readily available or vary across different black-box implementations. We present a method to learn the dynamics of a black-box ODE implementation that uses abstract automata learning and Neural Event ODEs. Without prior knowledge of the system, the method extracts the event specifications and state update functions, and generates a high-coverage training dataset through abstract automata learning. Additionally, our approach introduces a significantly more efficient training process for Neural Event ODEs that slices training trajectories into temporally consecutive pairs within continuous dynamics. Both contributions ensure well-posed initial values for each ODE slice. A~proof-of-concept implementation captures event specifications in an interpretable automaton and uses the trajectories from automata learning to efficiently train a simple feed-forward neural network by solving well-posed, single-step IVPs. During inference, the implementation detects the events and solves the IVP piecewise. Preliminary empirical results show significant improvements in training time and computational resource requirements while retaining all advantages of a piecewise solution.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Submission Number: 3584
Loading