To keep this from being machine-dependent, I could say that the total computation for feedforward or for backprop shouldn't take more than x% longer than the underlying matrix multiplication.
This would help ensure that I'm aware of any situations where I'm adding a lot of overhead to the computation.
To keep this from being machine-dependent, I could say that the total computation for feedforward or for backprop shouldn't take more than x% longer than the underlying matrix multiplication.
This would help ensure that I'm aware of any situations where I'm adding a lot of overhead to the computation.