We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
A supervised learning algorithm searches over a set of functions A→B parametrised by a space P to find the best approximation to some ideal function f:A→B. It does this by taking examples (a,f(a))∈A×B, and updating the parameter according to some rule. We define a category where these update rules may be composed, and show that gradient descent---with respect to a fixed step size and an error function satisfying a certain property---defines a monoidal functor from a category of parametrised functions to this category of update rules. This provides a structural perspective on backpropagation, as well as a broad generalisation of neural networks.Air Force Office of Scientific Research (Award FA9550-14-1-0031)Air Force Office of Scientific Research (Award FA9550-17-1-0058
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.