Struct GradEdge 

pub struct GradEdge<Op: GraphOp> {
    pub node: Option<Arc<GradNode<Op>>>,
    pub key: GlobalValKey<Op>,
    pub requires_grad: bool,
}

Edge from a grad node to one of its primal inputs.

node points to the parent operation that produced the input. None denotes a leaf eager value. key is the cotangent accumulation target for that input.

Examples

let edge = tidu::GradEdge::new(parent_node, input_key, requires_grad);

Fields

node: Option<Arc<GradNode<Op>>>

Parent grad node. None denotes a leaf input.

key: GlobalValKey<Op>

Gradient accumulation target for this input.

requires_grad: bool

Whether the input participates in gradient propagation.

Implementations

impl<Op: GraphOp> GradEdge<Op>

pub fn new( node: Option<Arc<GradNode<Op>>>, key: GlobalValKey<Op>, requires_grad: bool, ) -> Self

Create an eager backward edge.

Examples

let edge = tidu::GradEdge::new(parent_node, input_key, true);