Coalgebras for categorical deep learning: Representability and universal approximation

๐Ÿ“… 2026-03-03
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work proposes a unified categorical framework for modeling symmetries and equivariant representations in deep learning through a coalgebraic formalism. By embedding invariant structures from the category of sets into the category of vector spaces via functors, and constructing compatible endofunctors to capture equivariance, the paper systematically introduces coalgebraic tools to bridge abstract symmetry specifications with concrete neural network implementations. Within this framework, the authors establish a universal approximation theorem for continuous equivariant functions, applicable to a broad class of symmetry groups. This result provides a rigorous theoretical foundation and realizability guarantee for equivariant deep learning architectures, thereby advancing the principled design of symmetry-aware neural models.

Technology Category

Machine Learning: Deep Neural Architectures and Foundation ModelsComputer Vision: Representation Learning for VisionCognitive Modeling & Cognitive Systems: Symbolic Representations

Application Category

Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphsUser Modeling, Personalization and Recommendation: Fairness-aware retrieval and rankingSemantics and Knowledge: Data modeling to support human-machine intelligence, including LLMs agents, intelligent system behavior, explanations, and user-friendly interactions
๐Ÿ“ Abstract
Categorical deep learning (CDL) has recently emerged as a framework that leverages category theory to unify diverse neural architectures. While geometric deep learning (GDL) is grounded in the specific context of invariants of group actions, CDL aims to provide domain-independent abstractions for reasoning about models and their properties. In this paper, we contribute to this program by developing a coalgebraic foundation for equivariant representation in deep learning, as classical notions of group actions and equivariant maps are naturally generalized by the coalgebraic formalism. Our first main result demonstrates that, given an embedding of data sets formalized as a functor from SET to VECT, and given a notion of invariant behavior on data sets modeled by an endofunctor on SET, there is a corresponding endofunctor on VECT that is compatible with the embedding in the sense that this lifted functor recovers the analogous notion of invariant behavior on the embedded data. Building on this foundation, we then establish a universal approximation theorem for equivariant maps in this generalized setting. We show that continuous equivariant functions can be approximated within our coalgebraic framework for a broad class of symmetries. This work thus provides a categorical bridge between the abstract specification of invariant behavior and its concrete realization in neural architectures.
Problem

Research questions and friction points this paper is trying to address.

coalgebra
equivariance
universal approximation
categorical deep learning
representation
Innovation

Methods, ideas, or system contributions that make the work stand out.

coalgebra
categorical deep learning
equivariant representation
universal approximation
functorial embedding
๐Ÿ”Ž Similar Papers
No similar papers found.
D
Dragan Maลกuloviฤ‡
University of Novi Sad, Faculty of Sciences, Department of Mathematics and Informatics