| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Downhill.Linear.Backprop
Contents
Synopsis
- backprop :: forall a v. (BasicVector a, BasicVector v) => BackGrad a v -> v -> a
- buildGraph :: forall a v. (BasicVector a, BasicVector v) => [Term a v] -> IO (SomeGraph BackFun a v)
Backpropagation
backprop :: forall a v. (BasicVector a, BasicVector v) => BackGrad a v -> v -> a Source #
Purity of this function depends on laws of arithmetic
and linearity law of Term. If your addition is approximately
associative, then this function is approximately pure. Fair?
Graph
buildGraph :: forall a v. (BasicVector a, BasicVector v) => [Term a v] -> IO (SomeGraph BackFun a v) Source #