Functorial String Diagrams for Reverse-Mode Automatic Differentiation

07/28/2021
by   Mario Alvarez-Picallo, et al.
0

We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure. Using this new syntax we formulate an automatic differentiation algorithm for (applied) simply typed lambda calculus in the style of [Pearlmutter and Siskind 2008] and we prove for the first time its soundness. To give an efficient yet principled implementation of the AD algorithm we define a sound and complete representation of hierarchical string diagrams as a class of hierarchical hypergraphs we call hypernets.

READ FULL TEXT
research
10/18/2022

Deconstructing the Calculus of Relations with Tape Diagrams

Rig categories with finite biproducts are categories with two monoidal p...
research
05/30/2023

Hierarchical string diagrams and applications

This is a tutorial text giving an advanced introduction to the diagramma...
research
04/20/2018

Normal forms for planar connected string diagrams

In the graphical calculus of planar string diagrams, equality is generat...
research
03/14/2021

Diagrammatic Differentiation for Quantum Machine Learning

We introduce diagrammatic differentiation for tensor calculus by general...
research
10/13/2021

Representing Matrices Using Algebraic ZX-calculus

Elementary matrices play an important role in linear algebra application...
research
01/31/2022

Differentiating and Integrating ZX Diagrams

ZX-calculus has proved to be a useful tool for quantum technology with a...
research
02/07/2020

Intuitionistic Euler-Venn Diagrams (extended)

We present an intuitionistic interpretation of Euler-Venn diagrams with ...

Please sign up or login with your details

Forgot password? Click here to reset