Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits
Not on the map. Why?
Abstract (arXiv)
We introduce Reverse Derivative Ascent: a categorical analogue of gradient based methods for machine learning. Our algorithm is defined at the level of so-called reverse differential categories. It can be used to learn the parameters of models which are expressed as morphisms of such categories. Our motivating example is boolean circuits: we show how our algorithm can be applied to such circuits by using the theory of reverse differential categories. Note our methodology allows us to learn the parameters of boolean circuits directly, in contrast to existing binarised neural network approaches. Moreover, we demonstrate its empirical value by giving experimental results on benchmark machine learning datasets.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 10 of its 22 references that are in the map. First posted on arXiv 26 Jan 2021.
Builds on
10 of 22 references.
References · 10
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
- 2017Backprop as Functor: A compositional perspective on supervised learningcited by 44
- 2019LUTNet: Rethinking Inference in FPGA Soft Logiccited by 27
- 2019Reverse derivative categoriescited by 15
- 2020Learning Functors using Gradient Descentcited by 6
- 2019Differentiable Causal Computations via Delayed Tracecited by 5
- 2016Rewriting modulo symmetric monoidal structurecited by 4
- 2017Rewriting in Free Hypergraph Categoriescited by 1
- 2019The differential calculus of causal functionscited by 1
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 3; 2025: 2.
10 papers.
- 2021Categorical Foundations of Gradient-Based Learningcited by 44
- 2021Category Theory in Machine Learningcited by 36
- 2023Categorical Foundations of Explainable AI: A Unifying Theorycited by 7
- 2022Categories of Differentiable Polynomial Circuits for Machine Learningcited by 4
- 2024Pooling Image Datasets With Multiple Covariate Shift and Imbalancecited by 3
- 2024Deep Learning with Parametric Lensescited by 3
- 2024Towards a Categorical Foundation of Deep Learning: A Surveycited by 2
- 2021Generalized Optimization: A First Step Towards Category Theoretic Learning Theorycited by 1
- 2025Reverse Fa`a di Bruno's Formula for Cartesian Reverse Differential Categoriescited by 0
- 2025Convergence for Discrete Parameter Update Schemescited by 0
- 2025Convergence for Discrete Parameter Update Schemes3 Dec 2025
- 2025Reverse Fa`a di Bruno's Formula for Cartesian Reverse Differential Categories25 Sep 2025
- 2024Towards a Categorical Foundation of Deep Learning: A Survey7 Oct 2024
- 2024Deep Learning with Parametric Lenses30 Mar 2024
- 2024Pooling Image Datasets With Multiple Covariate Shift and Imbalance5 Mar 2024
- 2023Categorical Foundations of Explainable AI: A Unifying Theory27 Apr 2023
- 2022Categories of Differentiable Polynomial Circuits for Machine Learning12 Mar 2022
- 2021Generalized Optimization: A First Step Towards Category Theoretic Learning Theory20 Sep 2021
- 2021Category Theory in Machine Learning13 Jun 2021
- 2021Categorical Foundations of Gradient-Based Learning2 Mar 2021