crystalnet icon indicating copy to clipboard operation
crystalnet copied to clipboard

Published 20 hours ago • verified publisher icon lgarithm

Computation Graph

Open lgarithm opened this issue 7 years ago • 4 comments

A computation graph is a DAG, where each node is an operation. An operation can only be performed when all of its predecessors are finished.

Operations are supposed to be pure (idempotent). Which means the output of an operation should remain the same if all of its predecessors are unchanged.

lgarithm avatar May 01 '18 10:05 lgarithm

this should be done in conjunction with #50

lgarithm avatar May 14 '18 05:05 lgarithm

Hi, I think the args of every layers should also be stored in the graph~

zsdonghao avatar May 14 '18 12:05 zsdonghao

In the current design, the vertices (nodes) of the graph are parameters or operators, and for each operator node, there is an inbound edge from every input argument, so args naturally included.

lgarithm avatar May 14 '18 12:05 lgarithm

being developed as http://github.com/lgarithm/nn-graph-experimental

lgarithm avatar Oct 02 '19 12:10 lgarithm