Weaves, Wires, and Morphisms: Formalizing and Implementing the Algebra of Deep Learning

• URL: http://arxiv.org/abs/2604.07242v1
• Date: Wed, 08 Apr 2026 16:07:15 GMT
• Title: Weaves, Wires, and Morphisms: Formalizing and Implementing the Algebra of Deep Learning
• Abstract summary: Ad-hoc notation, diagrams, and pseudocode poorly handle nonlinear broadcasting and the relationship between individual components and composed models.<n>This paper introduces a categorical framework for deep learning models that formalizes broadcasting through the novel axis-stride and array-broadcasted categories.
• Score: 0.42970700836450487
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite deep learning models running well-defined mathematical functions, we lack a formal mathematical framework for describing model architectures. Ad-hoc notation, diagrams, and pseudocode poorly handle nonlinear broadcasting and the relationship between individual components and composed models. This paper introduces a categorical framework for deep learning models that formalizes broadcasting through the novel axis-stride and array-broadcasted categories. This allows the mathematical function underlying architectures to be precisely expressed and manipulated in a compositional manner. These mathematical definitions are translated into human manageable diagrams and machine manageable data structures. We provide a mirrored implementation in Python (pyncd) and TypeScript (tsncd) to show the universal aspect of our framework, along with features including algebraic construction, graph conversion, PyTorch compilation and diagram rendering. This lays the foundation for a systematic, formal approach to deep learning model design and analysis.

Related papers

• Representing Higher-Order Networks: A Survey of Graph-Based Frameworks [2.2667044928324747]
  This book presents a comprehensive overview of mathematical notions that can be used to model higher-order networks.<n>It surveys foundational concepts, extensional frameworks, and newly introduced formalisms.<n>The aim is to help readers compare diverse higher-order network models and identify appropriate tools for theoretical study and practical applications.
  arXiv  Detail & Related papers  (2026-03-24T03:28:40Z)
• Riemannian Geometry Speaks Louder Than Words: From Graph Foundation Model to Next-Generation Graph Intelligence [51.30336200738606]
  There is strong agreement that Graph Foundation Models (GFMs) are essential for advancing graph learning.<n> considerable disagreement persists on how to build a powerful, general-purpose GFM analogous to Large Language Models (LLMs)
  arXiv  Detail & Related papers  (2026-03-23T05:49:19Z)
• Probabilistic Graphical Models: A Concise Tutorial [67.95025153592505]
  Probabilistic graphical modeling is a branch of machine learning that uses probability distributions to describe the world.<n>This tutorial provides a concise introduction to the formalisms, methods, and applications of this modeling framework.
  arXiv  Detail & Related papers  (2025-07-23T01:36:44Z)
• Scaling Laws and Representation Learning in Simple Hierarchical Languages: Transformers vs. Convolutional Architectures [49.19753720526998]
  We derive theoretical scaling laws for neural network performance on synthetic datasets.<n>We validate that convolutional networks, whose structure aligns with that of the generative process through locality and weight sharing, enjoy a faster scaling of performance.<n>This finding clarifies the architectural biases underlying neural scaling laws and highlights how representation learning is shaped by the interaction between model architecture and the statistical properties of data.
  arXiv  Detail & Related papers  (2025-05-11T17:44:14Z)
• Thinking like a CHEMIST: Combined Heterogeneous Embedding Model Integrating Structure and Tokens [42.203344899915464]
  We present a novel approach that decomposes molecules into substructures and computes descriptor-based representations for these fragments.<n>We use this substructure and descriptor data as input for language model and also propose a bimodal architecture that integrates this language model with graph-based models.
  arXiv  Detail & Related papers  (2025-02-25T08:53:18Z)
• DiagrammaticLearning: A Graphical Language for Compositional Training Regimes [39.26058251942536]
  A learning diagram compiles to a unique loss function on which component models are trained.<n>We show that a number of popular learning setups can be depicted as learning diagrams.
  arXiv  Detail & Related papers  (2025-01-02T19:44:36Z)
• Connector 0.5: A unified framework for graph representation learning [5.398580049917152]
  We introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models. We plan to build an efficient open-source framework that can provide deep graph embedding models to represent structural relations in graphs.
  arXiv  Detail & Related papers  (2023-04-25T23:28:38Z)
• OntoMath${}^{\mathbf{PRO}}$ 2.0 Ontology: Updates of the Formal Model [68.8204255655161]
  The main attention is paid to the development of a formal model for the representation of mathematical statements in the Open Linked Data cloud. The proposed model is intended for applications that extract mathematical facts from natural language mathematical texts and represent these facts as Linked Open Data. The model is used in development of a new version of the OntoMath$mathrmPRO$ ontology of professional mathematics is described.
  arXiv  Detail & Related papers  (2023-03-17T20:29:17Z)
• An Algebraic Framework for Stock & Flow Diagrams and Dynamical Systems Using Category Theory [2.030738254233949]
  In this chapter, rather than focusing on the underlying mathematics, we informally use communicable disease examples created by the implemented software of StockFlow.jl. We first characterize categorical stock & flow diagrams, and note the clear separation between the syntax of stock & flow diagrams and their semantics. Applying category theory, these frameworks can build large diagrams from smaller ones in a modular fashion.
  arXiv  Detail & Related papers  (2022-11-01T16:15:54Z)
• Graph Kernel Neural Networks [53.91024360329517]
  We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain. This allows us to define an entirely structural model that does not require computing the embedding of the input graph. Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
  arXiv  Detail & Related papers  (2021-12-14T14:48:08Z)
• S2RMs: Spatially Structured Recurrent Modules [105.0377129434636]
  We take a step towards exploiting dynamic structure that are capable of simultaneously exploiting both modular andtemporal structures. We find our models to be robust to the number of available views and better capable of generalization to novel tasks without additional training.
  arXiv  Detail & Related papers  (2020-07-13T17:44:30Z)
• Non-Parametric Graph Learning for Bayesian Graph Neural Networks [35.88239188555398]
  We propose a novel non-parametric graph model for constructing the posterior distribution of graph adjacency matrices. We demonstrate the advantages of this model in three different problem settings: node classification, link prediction and recommendation.
  arXiv  Detail & Related papers  (2020-06-23T21:10:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.