- Add specialized implementations of
log1p
,expm1
,log1pexp
, andlog1mexp
inFloating
instances.
Numeric.AD.Mode.Reverse.Double
now handles IEEE floating-point special values (e.g.,NaN
andInf
) correctly whenad
is compiled with+ffi
. Note that this increase in floating-point accuracy may come at a slight performance penalty in certain applications. If this negatively impacts your application, please mention this at #106.
-
Add a
Num (Scalar (Scalar t))
constraint toOn
'sMode
instance, which is required to make it typecheck with GHC 9.6.(Note that this constraint was already present implicitly due to superclass expansion, so this is not a breaking change. The only reason that it must be added explicitly with GHC 9.6 or later is due to 9.6 being more conservative with superclass expansion.)
- Support building with GHC 9.6.
- Fix a bug that would cause
Numeric.AD.Mode.Reverse.diff
andNumeric.AD.Mode.Reverse.Double.diff
to compute different answers under certain circumstances whenad
was compiled with the+ffi
flag.
- Allow building with
transformers-0.6.*
.
- The build-type has been changed from
Custom
toSimple
. To achieve this, thedoctests
test suite has been removed in favor of usingcabal-docspec
to run the doctests. - Expose
Dense
mode AD again. - Add a
Dense.Representable
mode, which is a variant ofDense
that exploitsRepresentable
functors rather thanTraversable
functors. Representable
can now also be useful as it can allow us tounjet
to convert a value of typeJet f a
safely back intoCofree f a
.- Improve
Reverse.Double
mode performance by increasing strictness and using an FFI-based tape. - Reverse mode AD uses
reifyTypeable
internally. This means the region parameter/infinitesimals that mark each tape areTypeable
, allowing you to do things like define instances ofException
that name the region parameter and perform similar shenanigans. - Drastically reduce code duplication in
Double
-based modes, enabling more of them. - Fixed a number of modes that were handling
(**)
improperly due to the aforementioned code duplication problem. - Add a
Tower.Double
mode (internally) that uses lazy lists of strict doubles. - Add a
Kahn.Double
mode (internally) that holds strict doubles in the graph. - Switch to using pattern synonyms internally for detecting "known" zeros.
- Drop support for versions of GHC before 8.0
- The
.Double
modes have been modified to exploit the fact that we can definitely check a Double for equality with 0. In future releases we may require a typeclass that offers the ability to check for known zeroes for all types you process. This will allow us to improve the quality of the results, but may require you to either write an small instance declaration if you are processing some esoteric data type of your own, or put on/off a newtype that indicates to skip known zero optimizations or to use Eq. If there are particularly common types with tricky cases, a futuread-instances
package might be the right way forward for them to find a home. - Add
Numeric.AD.Double
, which tries to mix and match between all the different AD modes to produce optimal results but uses the various.Double
specializations to reduce the amount of boxing and indirection on the heap. - Add
Numeric.AD.Halley.Double
. - Removed the
fooNoEq
variants fromNewton.Double
,Double
s always have anEq
instance.
- Change the fixity of
:-
inNumeric.AD.Jet
to be right-associative. Previously, it wasinfixl
, which made things likex :- y :- z
nearly unusable. - Fix backpropagation error in Kahn mode.
- Fix bugs in the
Erf
instance forForwardDouble
. - Add
Numeric.AD.Mode.Reverse.Double
, a variant ofNumeric.AD.Mode.Reverse
that is specialized toDouble
. - Re-export
Jet(..)
,headJet
,tailJet
andjet
fromNumeric.AD
.
-
Generalize the type of
stochasticGradientDescent
:-stochasticGradientDescent :: (Traversable f, Fractional a, Ord a) => (forall s. Reifies s Tape => f (Scalar a) -> f (Reverse s a) -> Reverse s a) -> [f (Scalar a)] -> f a -> [f a] +stochasticGradientDescent :: (Traversable f, Fractional a, Ord a) => (forall s. Reifies s Tape => e -> f (Reverse s a) -> Reverse s a) -> [e] -> f a -> [f a]
- Make the test suite pass when built against
musl
libc
.
- Add
Semigroup
instance forId
.
- Support
doctest-0.12
- Revamp
Setup.hs
to usecabal-doctest
. This makes it build withCabal-2.0
, and makes thedoctest
s work withcabal new-build
and sandboxes.
- GHC 8 support
- Fix Kahn mode's
**
implementation - Fix multiple problems in Erf and InvErf methods
- Added
NoEq
versions of several combinators that can be used whenEq
isn't available on the numeric type involved.
- Further improvements have been made in the performance of
Sparse
mode, at least asymptotically, when used on functions with many variables. Since this is the target use-case forSparse
in the first place, this seems like a good trade-off. Note: this results in an API change, but only in the API of anInternal
module, so this is treated as a minor version bump.
- Made drastic improvements in the performance of
Tower
andSparse
modes thanks to the help of Björn von Sydow. - Added constrained convex optimization.
- Incorporated some suggestions from herbie for improving floating point accuracy.
- Added
Newton.Double
modules for performance.
reflection
2 support
- Major bug fix for
grads
,jacobians
, and anything that usesSparse
mode inNumeric.AD
. Derivatives after the first two were previously incorrect.
- Support
nats
version 1
- Added
stochasticGradientDescent
.
- Removed broken
Directed
mode. - Added
Numeric.AD.Rank1
combinators and moved most infinitesimal handling back out of the modes and into anAD
wrapper.
- Fixed a bug in the type of
conjugateGradientAscent
andconjugateGradientDescent
that prevent users from being able to ever call it.
- Added the missing
instances.h
header file toextra-source-files
.
- An overhaul permitting monomorphic modes was completed by @alang9.
- Add a
ForwardDouble
monomorphic mode
- Added support for
erf
andinverf
, etc. fromData.Number.Erf
. - Split the infinitesimal and mode into two separate parameters to facilitate inlining and easier extension of the API.
- Build system improvements
- Removed unused LANGUAGE pragmas
- Added HLint configuration
- We now use exactly the same versions of the packages used to build
ad
when running the doctests.
- Renamed
Reverse
toKahn
andWengert
toReverse
. We use Arthur Kahn's topological sorting algorithm to sort the tape after the fact in Kahn mode, while the stock Reverse mode builds a Wengert list as it goes, which is more efficient in practice.
- Export of the
conjugateGradientDescent
andgradientDescent
fromNumeric.AD
conjugateGradientDescent
now stops before it starts returning NaN results.
- Renamed
Chain
toWengert
to reflect its use of Wengert lists for reverse mode. - Renamed
lift
toauto
to avoid conflict with the more prevalenttransformers
library. - Fixed a bug in
Numeric.AD.Forward.gradWith'
, which caused it to return the wrong value for the primal.
- Added a better "convergence" test for
findZero
- Compute
tan
andtanh
derivatives directly.
- Added
conjugateGradientDescent
andconjugateGradientAscent
toNumeric.AD.Newton
.
- Dependency bump
- Added
Chain
mode, which isReverse
using a linear tape that doesn't need to be sorted. - Added a suite of doctests.
- Bug fix in
Forward
mode. It was previously yielding incorrect results for anything that usedbind
orbind'
internally.
- Moved the contents of
Numeric.AD.Mode.Mixed
intoNumeric.AD
- Split off
Numeric.AD.Variadic
for the variadic combinators - Removed the
UU
,FU
,UF
, andFF
type aliases. - Stopped exporting the types for
Mode
andAD
from almost every module. ImportNumeric.AD.Types
if necessary. - Renamed
Tensors
toJet
- Dependency bump to be compatible with ghc 7.4.1 and mtl 2.1
- More aggressive zero tracking.
diff (**n) 0
for constant n anddiff (0**)
both now yield the correct answer for all modes.