Wilson, P;
Zanasi, F;
(2021)
Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits.
In: Spivak, DI and Vicary, J, (eds.)
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020.
(pp. pp. 247-260).
Electronic Proceedings in Theoretical Computer Science: Cambridge, MA, USA.
Preview |
Text
Zanasi_2101.10488.pdf - Published Version Download (237kB) | Preview |
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.
Type: | Proceedings paper |
---|---|
Title: | Reverse Derivative Ascent: A Categorical Approach to Learning Boolean Circuits |
Event: | 3rd Annual International Applied Category Theory Conference 2020 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.4204/EPTCS.333.17 |
Publisher version: | https://doi.org/10.4204/EPTCS.333.17 |
Language: | English |
Additional information: | This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10121523 |
Archive Staff Only
![]() |
View Item |