Copyright | (c) Edward Kmett 2010-2021 |
---|---|
License | BSD3 |
Maintainer | ekmett@gmail.com |
Stability | experimental |
Portability | GHC only |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Reverse-mode automatic differentiation using Wengert lists and Data.Reflection
This version is specialized to Double
enabling the entire
structure to be unboxed.
Synopsis
- data ReverseDouble s
- auto :: Mode t => Scalar t -> t
- grad :: Traversable f => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> f Double
- grad' :: Traversable f => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> (Double, f Double)
- gradWith :: Traversable f => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> f b
- gradWith' :: Traversable f => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> (Double, f b)
- jacobian :: (Traversable f, Functor g) => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (f Double)
- jacobian' :: (Traversable f, Functor g) => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (Double, f Double)
- jacobianWith :: (Traversable f, Functor g) => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (f b)
- jacobianWith' :: (Traversable f, Functor g) => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (Double, f b)
- hessian :: Traversable f => (forall s s'. (Reifies s Tape, Typeable s, Reifies s' Tape, Typeable s') => f (On (Reverse s (ReverseDouble s'))) -> On (Reverse s (ReverseDouble s'))) -> f Double -> f (f Double)
- hessianF :: (Traversable f, Functor g) => (forall s s'. (Reifies s Tape, Typeable s, Reifies s' Tape, Typeable s') => f (On (Reverse s (ReverseDouble s'))) -> g (On (Reverse s (ReverseDouble s')))) -> f Double -> g (f (f Double))
- diff :: (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> ReverseDouble s) -> Double -> Double
- diff' :: (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> ReverseDouble s) -> Double -> (Double, Double)
- diffF :: Functor f => (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> f (ReverseDouble s)) -> Double -> f Double
- diffF' :: Functor f => (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> f (ReverseDouble s)) -> Double -> f (Double, Double)
Documentation
data ReverseDouble s Source #
Instances
Gradient
grad :: Traversable f => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> f Double Source #
The grad
function calculates the gradient of a non-scalar-to-scalar function with reverse-mode AD in a single pass.
>>>
grad (\[x,y,z] -> x*y+z) [1,2,3]
[2.0,1.0,1.0]
>>>
grad (\[x,y] -> x**y) [0,2]
[0.0,NaN]
grad' :: Traversable f => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> (Double, f Double) Source #
The grad'
function calculates the result and gradient of a non-scalar-to-scalar function with reverse-mode AD ƒin a single pass.
>>>
grad' (\[x,y,z] -> x*y+z) [1,2,3]
(5.0,[2.0,1.0,1.0])
gradWith :: Traversable f => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> f b Source #
gradWith' :: Traversable f => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> ReverseDouble s) -> f Double -> (Double, f b) Source #
Jacobian
jacobian :: (Traversable f, Functor g) => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (f Double) Source #
The jacobian
function calculates the jacobian of a non-scalar-to-non-scalar function with reverse AD lazily in m
passes for m
outputs.
>>>
jacobian (\[x,y] -> [y,x,x*y]) [2,1]
[[0.0,1.0],[1.0,0.0],[1.0,2.0]]
jacobian' :: (Traversable f, Functor g) => (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (Double, f Double) Source #
The jacobian'
function calculates both the result and the Jacobian of a nonscalar-to-nonscalar function, using m
invocations of reverse AD,
where m
is the output dimensionality. Applying fmap snd
to the result will recover the result of jacobian
| An alias for gradF'
>>>
jacobian' (\[x,y] -> [y,x,x*y]) [2,1]
[(1.0,[0.0,1.0]),(2.0,[1.0,0.0]),(2.0,[1.0,2.0])]
jacobianWith :: (Traversable f, Functor g) => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (f b) Source #
'jacobianWith g f' calculates the Jacobian of a non-scalar-to-non-scalar function f
with reverse AD lazily in m
passes for m
outputs.
Instead of returning the Jacobian matrix, the elements of the matrix are combined with the input using the g
.
jacobian
==jacobianWith
(_ dx -> dx)jacobianWith
const
== (f x ->const
x<$>
f x)
jacobianWith' :: (Traversable f, Functor g) => (Double -> Double -> b) -> (forall s. (Reifies s Tape, Typeable s) => f (ReverseDouble s) -> g (ReverseDouble s)) -> f Double -> g (Double, f b) Source #
jacobianWith
g f' calculates both the result and the Jacobian of a nonscalar-to-nonscalar function f
, using m
invocations of reverse AD,
where m
is the output dimensionality. Applying fmap snd
to the result will recover the result of jacobianWith
Instead of returning the Jacobian matrix, the elements of the matrix are combined with the input using the g
.
jacobian'
==jacobianWith'
(_ dx -> dx)
Hessian
hessian :: Traversable f => (forall s s'. (Reifies s Tape, Typeable s, Reifies s' Tape, Typeable s') => f (On (Reverse s (ReverseDouble s'))) -> On (Reverse s (ReverseDouble s'))) -> f Double -> f (f Double) Source #
Compute the hessian via the jacobian of the gradient. gradient is computed in reverse mode and then the jacobian is computed in reverse mode.
However, since the
is square this is not as fast as using the forward-mode Jacobian of a reverse mode gradient provided by grad
f :: f a -> f ahessian
.
>>>
hessian (\[x,y] -> x*y) [1,2]
[[0.0,1.0],[1.0,0.0]]
hessianF :: (Traversable f, Functor g) => (forall s s'. (Reifies s Tape, Typeable s, Reifies s' Tape, Typeable s') => f (On (Reverse s (ReverseDouble s'))) -> g (On (Reverse s (ReverseDouble s')))) -> f Double -> g (f (f Double)) Source #
Compute the order 3 Hessian tensor on a non-scalar-to-non-scalar function via the reverse-mode Jacobian of the reverse-mode Jacobian of the function.
Less efficient than hessianF
.
>>>
hessianF (\[x,y] -> [x*y,x+y,exp x*cos y]) [1,2 :: Double]
[[[0.0,1.0],[1.0,0.0]],[[0.0,0.0],[0.0,0.0]],[[-1.1312043837568135,-2.4717266720048188],[-2.4717266720048188,1.1312043837568135]]]
Derivatives
diff :: (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> ReverseDouble s) -> Double -> Double Source #
Compute the derivative of a function.
>>>
diff sin 0
1.0
diff' :: (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> ReverseDouble s) -> Double -> (Double, Double) Source #
The diff'
function calculates the result and derivative, as a pair, of a scalar-to-scalar function.
>>>
diff' sin 0
(0.0,1.0)
>>>
diff' exp 0
(1.0,1.0)
diffF :: Functor f => (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> f (ReverseDouble s)) -> Double -> f Double Source #
Compute the derivatives of each result of a scalar-to-vector function with regards to its input.
>>>
diffF (\a -> [sin a, cos a]) 0
[1.0,0.0]
diffF' :: Functor f => (forall s. (Reifies s Tape, Typeable s) => ReverseDouble s -> f (ReverseDouble s)) -> Double -> f (Double, Double) Source #
Compute the derivatives of each result of a scalar-to-vector function with regards to its input along with the answer.
>>>
diffF' (\a -> [sin a, cos a]) 0
[(0.0,1.0),(1.0,0.0)]