relu method

Node relu()

Implementation

Node relu() {
  final out = Node(value > 0 ? value : 0, 'ReLU');
  out._parents = [this];
  out._backward.add(() {
    this.grad += (out.value > 0 ? 1.0 : 0.0) * out.grad;
    if (jacobian != null) {
      for (int i = 0; i < jacobian!.length; i++) {
        for (int j = 0; j < jacobian![i].length; j++) {
          jacobian![i][j] += (out.value > 0 ? 1.0 : 0.0);
        }
      }
    }
  });
  return out;
}