TorchLean API

NN.Proofs.RuntimeApprox.NF.BackwardOps.Primitive

Primitive NF Reverse Nodes #

Reverse-mode approximation nodes for scalar, elementwise, reduction, and activation operations. Each node packages the forward operation, the spec VJP, the rounded runtime VJP, and the local error bound proof used by graph-level backpropagation.

Reverse node for addition: z = a + b.

VJP is (δ ↦ (δ, δ)), with a special-case when a and b are the same context index.

Instances For

    Reverse node for subtraction: z = a - b.

    VJP is (δ ↦ (δ, -δ)), with a special-case when a and b are the same context index.

    Instances For

      Reverse node for multiplication: z = a * b.

      VJP is (δ ↦ (δ*b, δ*a)), with rounding-aware bounds produced by the NF backend.

      Instances For

        Reverse node for scaling by a constant: z = c * a.

        Instances For

          Reverse node for negation: z = -a.

          Instances For

            Reverse node for exp.

            Instances For

              Reverse node for tanh.

              Instances For

                Reverse node for sigmoid.

                Instances For

                  Reverse node for softplus.

                  Instances For

                    Reverse node for a log with an explicit stabilization parameter ε (to avoid log 0-style issues).

                    Instances For

                      Reverse node for the scalar softmax node, using the analytic ℝ derivative plus NF error bounds.

                      Instances For

                        Reverse node for ReLU, using the standard piecewise derivative/VJP.

                        Instances For

                          Reverse node for reduction sum, sending the upstream gradient back along the broadcasted shape.

                          Instances For