ad: Automatic Differentiation
Forward-, reverse- and mixed- mode automatic differentiation combinators with a common API.
Type-level "branding" is used to both prevent the end user from confusing infinitesimals and to limit unsafe access to the implementation details of each Mode.
Each mode has a separate module full of combinators.
Numeric.AD.Mode.Forwardprovides basic forward-mode AD. It is good for computing simple derivatives.
Numeric.AD.Mode.Reverseuses benign side-effects to compute reverse-mode AD. It is good for computing gradients in one pass. It generates a tree-like tape that needs to be topologically sorted in the end.
Numeric.AD.Mode.Chainuses benign side-effects to compute reverse-mode AD. It is good for computing gradients in one pass. It generates a linear tape using
Numeric.AD.Mode.Sparsecomputes a sparse forward-mode AD tower. It is good for higher derivatives or large numbers of outputs.
Numeric.AD.Mode.Towercomputes a dense forward-mode AD tower useful for higher derivatives of single input functions.
Numeric.ADcomputes using whichever mode or combination thereof is suitable to each individual combinator.
While not every mode can provide all operations, the following basic operations are supported, modified as appropriate by the suffixes below:
gradcomputes the gradient (partial derivatives) of a function at a point.
jacobiancomputes the Jacobian matrix of a function at a point.
diffcomputes the derivative of a function at a point.
ducomputes a directional derivative of a function at a point.
hessiancomputes the Hessian matrix (matrix of second partial derivatives) of a function at a point.
The following suffixes alter the meanings of the functions above as follows:
'-- also return the answer
Withlets the user supply a function to blend the input with the output
Fis a version of the base function lifted to return a
smeans the function returns all higher derivatives in a list or f-branching
Tmeans the result is transposed with respect to the traditional formulation.
0means that the resulting derivative list is padded with 0s at the end.
[Skip to Readme]
|Versions||0.12, 0.13, 0.15, 0.17, 0.18, 0.19, 0.20, 0.21, 0.22, 0.23, 0.24, 0.27, 0.28, 0.30.0, 0.31.0, 0.32.0, 0.33.0, 0.40, 0.40.1, 0.44.0, 0.44.1, 0.44.2, 0.44.3, 0.44.4, 0.45.0, 0.46.0, 0.46.1, 0.46.2, 0.47.0, 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.0.5, 1.0.6, 1.1.0, 184.108.40.206, 1.1.1, 1.1.3, 1.2.0, 220.127.116.11, 18.104.22.168, 1.3, 22.214.171.124, 1.3.1, 1.4, 1.5, 126.96.36.199, 188.8.131.52, 3.0, 3.0.1, 3.1.1, 3.1.2, 3.1.3, 3.1.4, 3.2, 3.2.1, 3.2.2, 184.108.40.206, 3.3.1, 220.127.116.11, 3.4, 4.0, 18.104.22.168, 4.1, 4.2, 22.214.171.124, 4.2.1, 126.96.36.199, 4.2.2, 4.2.3, 4.2.4, 4.3, 4.3.1, 4.3.2, 188.8.131.52, 4.3.3, 4.3.4, 4.3.5|
|Dependencies||array (>=0.2 && <0.5), base (>=4.5 && <5), comonad (==3.0.*), containers (>=0.2 && <0.6), data-reify (==0.6.*), free (>=3.0 && <=3.2), reflection (>=1.1.6 && <1.2), tagged (>=0.4.2.1 && <0.5), template-haskell (>=2.5 && <2.9) [details]|
|Copyright||(c) Edward Kmett 2010-2012, (c) Barak Pearlmutter and Jeffrey Mark Siskind 2008-2009|
|Revised||Revision 1 made by HerbertValerioRiedel at Sun Jan 25 11:26:11 UTC 2015|
|Source repo||head: git clone git://github.com/ekmett/ad.git|
|Uploaded||by EdwardKmett at Tue Sep 4 18:30:02 UTC 2012|
|Distributions||LTSHaskell:4.3.5, NixOS:4.3.5, Stackage:4.3.5|
|Downloads||36991 total (120 in the last 30 days)|
|Rating||2.5 (votes: 3) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees