The University of Southampton
University of Southampton Institutional Repository

An axiomatic approach to differentiation of polynomial circuits

An axiomatic approach to differentiation of polynomial circuits
An axiomatic approach to differentiation of polynomial circuits
Reverse derivative categories (RDCs) have recently been shown to be a suitable semantic framework for studying machine learning algorithms. Whereas emphasis has been put on training methodologies, less attention has been devoted to particular model classes: the concrete categories whose morphisms represent machine learning models. In this paper we study presentations by generators and equations of classes of RDCs. In particular, we propose polynomial circuits as a suitable machine learning model class. We give an axiomatisation for these circuits and prove a functional completeness result. Finally, we discuss the use of polynomial circuits over specific semirings to perform machine learning with discrete values.

2352-2208
Wilson, Paul
dd7e263e-2ef5-4245-b0b2-a8ac5e3923fa
Zanasi, Fabio
5bc03cd7-0fb6-4e14-bae8-8bf0d5d4be38
Wilson, Paul
dd7e263e-2ef5-4245-b0b2-a8ac5e3923fa
Zanasi, Fabio
5bc03cd7-0fb6-4e14-bae8-8bf0d5d4be38

Wilson, Paul and Zanasi, Fabio (2023) An axiomatic approach to differentiation of polynomial circuits. Journal of Logical and Algebraic Methods in Programming, 135, [100892]. (doi:10.1016/j.jlamp.2023.100892).

Record type: Article

Abstract

Reverse derivative categories (RDCs) have recently been shown to be a suitable semantic framework for studying machine learning algorithms. Whereas emphasis has been put on training methodologies, less attention has been devoted to particular model classes: the concrete categories whose morphisms represent machine learning models. In this paper we study presentations by generators and equations of classes of RDCs. In particular, we propose polynomial circuits as a suitable machine learning model class. We give an axiomatisation for these circuits and prove a functional completeness result. Finally, we discuss the use of polynomial circuits over specific semirings to perform machine learning with discrete values.

Text
1-s2.0-S2352220823000469-main - Version of Record
Available under License Creative Commons Attribution.
Download (496kB)

More information

Accepted/In Press date: 22 June 2023
e-pub ahead of print date: 30 June 2023
Published date: October 2023
Additional Information: Publisher Copyright: © 2023 The Author(s)

Identifiers

Local EPrints ID: 484080
URI: http://eprints.soton.ac.uk/id/eprint/484080
ISSN: 2352-2208
PURE UUID: 5b2c3465-3ef0-4f90-9f50-45ce4485c46e
ORCID for Paul Wilson: ORCID iD orcid.org/0000-0003-3575-135X

Catalogue record

Date deposited: 09 Nov 2023 18:14
Last modified: 18 Mar 2024 03:49

Export record

Altmetrics

Contributors

Author: Paul Wilson ORCID iD
Author: Fabio Zanasi

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×