Categories of Differentiable Polynomial Circuits for Machine Learning

DOI10.1007/978-3-031-09843-7_5zbMath1514.68266arXiv2203.06430OpenAlexW4285246309MaRDI QIDQ6393524

Fabio Zanasi, Paul W. Wilson

Publication date: 12 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09843-7_5

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Preadditive, additive categories (18E05) String diagrams and graphical calculi (18M30)

Related Items (1)

An axiomatic approach to differentiation of polynomial circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards an algebraic theory of Boolean circuits.
• Multilayer feedforward networks are universal approximators
• A Survey of Graphical Languages for Monoidal Categories
• Props in Network Theory
• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
• Complete Sets of Logical Functions

This page was built for publication: Categories of Differentiable Polynomial Circuits for Machine Learning