Pith. sign in

REVIEW 1 cited by

The Backpropagation algorithm for a math student

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.09977 v3 pith:DSQND7UZ submitted 2023-01-22 cs.LG cs.NAcs.NEmath.NA

classification cs.LGcs.NAcs.NEmath.NA
keywords functiongradientjacobianfunctionslossmatrixparametersalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A Deep Neural Network (DNN) is a composite function of vector-valued functions, and in order to train a DNN, it is necessary to calculate the gradient of the loss function with respect to all parameters. This calculation can be a non-trivial task because the loss function of a DNN is a composition of several nonlinear functions, each with numerous parameters. The Backpropagation (BP) algorithm leverages the composite structure of the DNN to efficiently compute the gradient. As a result, the number of layers in the network does not significantly impact the complexity of the calculation. The objective of this paper is to express the gradient of the loss function in terms of a matrix multiplication using the Jacobian operator. This can be achieved by considering the total derivative of each layer with respect to its parameters and expressing it as a Jacobian matrix. The gradient can then be represented as the matrix product of these Jacobian matrices. This approach is valid because the chain rule can be applied to a composition of vector-valued functions, and the use of Jacobian matrices allows for the incorporation of multiple inputs and outputs. By providing concise mathematical justifications, the results can be made understandable and useful to a broad audience from various disciplines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adjoint sharding for very long context training of state space models

    cs.LG 2025-01 reject novelty 5.0 of 10

    The paper derives an adjoint-based gradient sharding algorithm for SSMs and claims up to 3X memory reduction, but provides no experimental evidence for the central empirical claims.

Pith tools