Pith. sign in

REVIEW 1 cited by

A Step-by-step Introduction to the Implementation of Automatic Differentiation

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 2402.16020 v2 pith:YSLSWPMT submitted 2024-02-25 cs.LG

classification cs.LG
keywords automaticdifferentiationimplementationstudentsbasicconceptsdeepfurther
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Automatic differentiation is a key component in deep learning. This topic is well studied and excellent surveys such as Baydin et al. (2018) have been available to clearly describe the basic concepts. Further, sophisticated implementations of automatic differentiation are now an important part of popular deep learning frameworks. However, it is difficult, if not impossible, to directly teach students the implementation of existing systems due to the complexity. On the other hand, if the teaching stops at the basic concept, students fail to sense the realization of an implementation. For example, we often mention the computational graph in teaching automatic differentiation, but students wonder how to implement and use it. In this document, we partially fill the gap by giving a step by step introduction of implementing a simple automatic differentiation system. We streamline the mathematical concepts and the implementation. Further, we give the motivation behind each implementation detail, so the whole setting becomes very natural.

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. MPS-JuliQAOA: User-friendly, Scalable MPS-based Simulation for Quantum Optimization

    quant-ph 2025-08 unverdicted novelty 4.0 of 10

    MPS-JuliQAOA is a user-friendly MPS-based simulator that scales QAOA to 512 qubits and 20 rounds on 3-regular MaxCut problems.

Pith tools