AI engineering glossary · Calculus optimisation
What is computational graph?
Computational graph: A directed graph in which nodes are values or operations and edges show how results feed later steps. Automatic differentiation records one while a program runs, then walks it backward applying the chain rule to obtain gradients.
Computational graph: an example
For loss = (w*x - y)^2, the graph has multiply, subtract and square nodes; gradients flow backward through them to reach w.
Related terms
More Calculus optimisation terms
- Condition number
- Conjugate gradient method
- Constrained optimisation
- Constraint
- Continuity
- Convergence
- Convergence rate
- Convex function
Where you learn it
Computational graph is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.