mlsanityData to 7 Oct 2026

Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits

arXiv 2101.10488 ↗First posted 26 Jan 2021cs.LO cs.LGcited by 10

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

  1. 2016An overview of gradient descent optimization algorithmscited by 1,021
  2. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  3. 2017Backprop as Functor: A compositional perspective on supervised learningcited by 44
  4. 2019LUTNet: Rethinking Inference in FPGA Soft Logiccited by 27
  5. 2019Reverse derivative categoriescited by 15
  6. 2020Learning Functors using Gradient Descentcited by 6
  7. 2019Differentiable Causal Computations via Delayed Tracecited by 5
  8. 2016Rewriting modulo symmetric monoidal structurecited by 4
  9. 2017Rewriting in Free Hypergraph Categoriescited by 1
  10. 2019The differential calculus of causal functionscited by 1

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 3; 2025: 2.

10 papers.