Open Dynamical Systems as Coalgebras for Polynomial Functors, with Application to Predictive Processing

Abstract

We present categories of open dynamical systems with general time evolution as categories of coalgebras opindexed by polynomial interfaces, and show how this extends the coalgebraic framework to capture common scientific applications such as ordinary differential equations, open Markov processes, and random dynamical systems. We then extend Spivak's operad Org to this setting, and construct associated monoidal categories whose morphisms represent hierarchical open systems; when their interfaces are simple, these categories supply canonical comonoid structures. We exemplify these constructions using the 'Laplace doctrine', which provides dynamical semantics for active inference, and indicate some connections to Bayesian inversion and coalgebraic logic.

arXiv commentIn Proceedings ACT 2022, arXiv:2307.15519

References in corpus (9)

• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Disintegration and Bayesian Inversion via String Diagrams
• Structured versus Decorated Cospans
• Bayesian Updates Compose Optically
• An Algebra of Resource Sharing Machines
• Directed Containers as Categories
• Poly: An abundant categorical setting for mode-dependent dynamics
• A reference for categorical structures on $\mathbf{Poly}$
• Compositional Active Inference I: Bayesian Lenses. Statistical Games

Cited by in corpus (2)

• Knowledge Engineering for Wind Energy
• Monoidal Structures on Generalized Polynomial Categories