Presenting Neural Networks via Coherent Functors
Matthew Pugh, Jo Grundy, Corina Cirstea, Nick Harris

TL;DR
This paper introduces a novel approach to representing neural networks as coherent categories, framing inference as a formal extension problem within category theory, bridging machine learning and logical theories.
Contribution
It develops a categorical framework that models neural networks as coherent categories, enabling formal reasoning about network inference and architecture.
Findings
Neural networks can be represented as models of coherent theories.
Inference corresponds to a lifting problem in the 2-category of coherent categories.
Framework encompasses various architectures including sparse and convolutional networks.
Abstract
This paper develops a methodology for representing machine learning models as models of formal theories, grounded in the perspective that machine learning models are a form of database and that databases are models of theories in coherent logic. Two intermediate results support this approach: any functorial database schema has an associated -coherent theory whose models coincide with its instances, and data may be hard-coded into a coherent category such that any model of the resulting theory necessarily contains it. These tools are used to show that any dense feed-forward neural network architecture over the floating point numbers may be presented as a coherent category whose -models are the networks of that architecture, with inference arising as the precomposition functor along a coherent functor . This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
