Reverse derivative ascent: A categorical approach to learning boolean circuits

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Wilson, P., & Zanasi, F. (2021). Reverse derivative ascent: A categorical approach to learning boolean circuits. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 333, pp. 247–260). Open Publishing Association. https://doi.org/10.4204/EPTCS.333.17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free