forked from bjornbm/fad
-
Notifications
You must be signed in to change notification settings - Fork 1
/
FAD.hs
948 lines (769 loc) · 36.2 KB
/
FAD.hs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE Rank2Types #-}
{- |
Copyright : Copyright (C) 2008-2009 Barak A. Pearlmutter and Jeffrey Mark Siskind
License : BSD3
Maintainer : bjorn.buckwalter@gmail.com
Stability : experimental
Portability: GHC only?
Forward Automatic Differentiation via overloading to perform
nonstandard interpretation that replaces original numeric type with
corresponding generalized dual number type.
Credits:
Authors: Copyright 2008,
Barak A. Pearlmutter (<barak@cs.nuim.ie>) &
Jeffrey Mark Siskind (<qobi@purdue.edu>)
Work started as stripped-down version of higher-order tower code
published by Jerzy Karczmarczuk (<jerzy.karczmarczuk@info.unicaen.fr>)
which used a non-standard standard prelude.
Initial perturbation-confusing code is a modified version of
<http://cdsmith.wordpress.com/2007/11/29/some-playing-with-derivatives/>
Tag trick, called \"branding\" in the Haskell community, from
Björn Buckwalter (<bjorn.buckwalter@gmail.com>)
<http://thread.gmane.org/gmane.comp.lang.haskell.cafe/22308/>
Notes:
Each invocation of the differentiation function introduces a distinct
perturbation, which requires a distinct derivative-carrying number
type. In order to prevent these from being confused, tagging, called
branding in the Haskell community, is used. This seems to prevent
perturbation confusion, although it would be nice to have an actual
proof of this. The technique does require adding invocations of lift
at appropriate places when nesting is present, and degrades modularity
by exposing "forall" types in type signatures.
-}
{-
The \"pass in a lifter\" approach, discussed in the HOSC paper, was
rediscovered and implemented by David Roundy (<droundy@darcs.net>)
<http://thread.gmane.org/gmane.comp.lang.haskell.cafe/22308>
Unfortunately this would preclude writing in a natural style, and
is therefore not used here. It however could be combined with
tagging to allow dynamic nesting, if the type system would allow.
-}
-- Forward Automatic Differentiation
module Numeric.FAD (
-- * Derivative Towers: Higher-Order Generalized Dual Numbers
Tower, lift, primal,
-- * First-Order Differentiation Operators
-- $fodo
diffUU, diffUF, diffMU, diffMF,
diff2UU, diff2UF, diff2MU, diff2MF,
-- * Higher-Order Differentiation Operators
-- $hodo
diffsUU, diffsUF, diffsMU, diffsMF,
diffs0UU, diffs0UF, diffs0MU, diffs0MF,
-- * Common access patterns
diff, diff2, diffs, diffs0, grad, jacobian,
-- * building blocks for custom access patterns
fromTower, toTower, tangent,
-- * Optimization Routines
zeroNewton, inverseNewton, fixedPointNewton, extremumNewton,
argminNaiveGradient,
-- * unlift lifted functions
primalUU, primalUF, primalFU, primalFF,
-- * Miscellaneous
taylor, taylor2)
where
import Data.List (transpose)
import Data.Foldable (Foldable)
import qualified Data.Foldable (all)
import List.Util (zipWithDefaults, indexDefault)
import Data.Function (on)
-- To Do:
-- Add some more optimization routines
-- Add some examples
-- Add pointers into literature
-- Fix complex number issues (requires changes to standard prelude)
-- Optimize for efficiency
-- Address [x..] bug, see below
-- Notes:
-- This package implements forward automatic differentiation,
-- generalized to produce not only first derivatives, but a tower of
-- all higher-order derivatives. This is done by replacing a base (or
-- "primal") numberic type by a numeric type that holds the primal value
-- but also carries along the derivative(s). If we produced only
-- first derivatives, the augmented type would be a "Dual Number".
-- And Dual Numbers are tangent-vector bundles, in the terminology of
-- differential geometry. For the this reason, we call the accessor
-- for the first derivative "tangent". We also sometimes refer to the
-- augmented numbers as "bundles", since they bundle together a primal
-- value and some derivative information.
-- The multivariate case is handled as a list on inputs, but an
-- arbitrary functor on outputs. This asymmetry is because Haskell
-- provides fmap but not fzipWith.
-- The derivative towers can be truncated. Care is taken to preserve
-- said trunction whenever possible.
-- Other quirks:
-- would need diffUFF for f:R->[[R]] and diffUFFF for f:R->[Maybe [R]], etc.
-- type signature of diff stuff contaminates diff-using stuff, ick
-- Some care has been taken to ensure that correct interoperation with
-- complex numbers. Particular care must be taken with the
-- non-analytic functions, namely abs and signum. These are not
-- properly differentiable over the complex domain, but they do admit
-- directional derivatives (push-forwards) where both the primal and
-- tangents are complex. Unfortunately the Haskell numeric system is
-- modularized in a fashion that appears to make this impossible to
-- express. Instead, we detect the situation and handle it
-- appropriately.
-- Digression: the reason for this difficulty.
-- The relationship of interest, valid for both real and complex
-- valued x, is:
-- x = (abs x) * (signum x)
-- This gives rise to division in the formulas for abs and signum when
-- x is complex. For real x, (signum x) = 1/(signum x), so the
-- division can be replaced by multiplication. But not in the complex
-- case. And unfortunately, abs & signum are defined for Num, which
-- does not have division.
-- The "right" solution would be to have signumRecip defined for Num,
-- where (signumRecip x) * (signum x) = 1. This would allow things to
-- be defined so as to be correct in the case of complex numbers
-- without using division, and would be trivial in the real case where
-- signum x = signumRecip x. Moreover (magnitude (signum z)) == 1, so
-- we could use signumRecip = conjugate . signum for complex numbers.
-- Except that conjugate is defined only for complex numbers, which is
-- strange since it would just be the identity for real numbers.
-- | The 'Tower' type is a concrete representation of a higher-order
-- Dual number, meaning a number augmented with a tower of
-- derivatives. These generalize the Dual numbers of Clifford (1873),
-- which hold only a first derivative. They can be converted to
-- formal power series via division by the sequence of factorials.
newtype Tower tag a = Tower [a] deriving Show
-- Injectors and accessors for derivative towers
-- | The 'lift' function injects a primal number into the domain of
-- derivative towers, with a zero tower. If generalized dual numbers
-- were a monad, 'lift' would be 'return'.
lift :: (Eq a, Num a) => a -> Tower tag a
lift = (`bundle` zero)
-- | The 'bundle' function takes a primal number and a derivative
-- tower and returns a derivative tower with the given tower shifted
-- up one and the new primal inserted.
--
-- Property: @x = bundle (primal x) (tangentTower x)@
bundle :: (Eq a, Num a) => a -> Tower tag a -> Tower tag a
bundle x0 x' = toTower (x0:fromTower x')
-- The following forces its second argument's structure, which is very bad:
-- bundle x0 (Tower xs) = toTower (x0:xs)
-- | The zero element of a Tower Number tower algebra
zero :: (Eq a, Num a) => Tower tag a
zero = toTower []
-- | The 'apply' function applies a function to a number lifted from
-- the primal domain to the derivative tower domain, with unit
-- derivative, thus calculating the generalized push-forward, in the
-- differential geometric sense, of the given function at the given
-- point.
apply :: (Eq a, Num a) => (Tower tag a -> b) -> a -> b
apply = (. (`bundle` 1))
-- | The 'towerElt' function finds the i-th element of a derivative
-- | tower, where the 0-th element is the primal value, the 1-st
-- | element is the first derivative, etc.
towerElt :: (Eq a, Num a) => Int -> Tower tag a -> a
towerElt i (Tower xs) = xs !!!! i
where (!!!!) = indexDefault (Just 0)
-- | The 'fromTower' function converts a derivative tower to a list of
-- values with the i-th derivatives, i=0,1,..., possibly truncated
-- when all remaining values in the tower are zero.
fromTower :: Tower tag a -> [a]
fromTower (Tower xs) = xs
-- | The 'toTower' function converts a list of numbers into a
-- | derivative tower.
toTower :: [a] -> Tower tag a
toTower = Tower
-- | The 'primal' function finds the primal value from a derivative
-- | tower. The inverse of 'lift'.
primal :: (Eq a, Num a) => Tower tag a -> a
primal = towerElt 0
-- | The 'tangent' function finds the tangent value of a derivative
-- | tower, i.e., the first-order derivative.
tangent :: (Eq a, Num a) => Tower tag a -> a
tangent = towerElt 1
-- | The 'tangentTower' function finds the entire tower of tangent
-- values of a derivative tower, starting at the 1st derivative. This
-- is equivalent, in an appropriate sense, to taking the first
-- derivative.
tangentTower :: (Eq a, Num a) => Tower tag a -> Tower tag a
tangentTower (Tower []) = zero
tangentTower (Tower (_ : x')) = toTower x'
-- | The 'liftA1' function lifts a scalar numeric function from a base
-- numeric type to a function over derivative towers. Takes the
-- primal function and the derivative function as arguments. The
-- derivative function should return a scalar.
--
-- EXAMPLE: @liftA1 sin cos@
liftA1 :: (Eq a, Num a) =>
(a -> a)
-> (Tower tag a -> Tower tag a)
-> Tower tag a -> Tower tag a
liftA1 f = (liftA1_ f) . const
-- | The 'liftA2' function lifts a binary numeric function from a base
-- numeric type to a function over derivative towers. Takes the
-- primal function and the derivative function as arguments. The
-- derivative function should return the Jacobian matrix,
-- representated as a pair.
--
-- EXAMPLE: @liftA2 (*) (\\x y -> (y,x))@
liftA2 :: (Eq a, Num a) =>
(a -> a -> a)
-> (Tower tag a -> Tower tag a -> (Tower tag a, Tower tag a))
-> Tower tag a -> Tower tag a -> Tower tag a
liftA2 f = (liftA2_ f) . const
-- | The 'liftA1_' function lifts a scalar numeric function, like
-- 'liftA1', except the the derivative function is given access to the
-- output value. This eases recursion and reuse.
--
-- EXAMPLE: @liftA1_ exp const@
liftA1_ :: (Eq a, Num a) =>
(a -> a)
-> (Tower tag a -> Tower tag a -> Tower tag a)
-> Tower tag a -> Tower tag a
liftA1_ f df x = z
where z = bundle (f (primal x)) (tangentTower x * df z x)
-- | The 'liftA2_' function lifts a binary numeric function, like
-- 'liftA2', except the the derivative function is given access to the
-- output value. This eases recursion and reuse.
--
-- EXAMPLE: @liftA2_ (**) (\z x y -> (y*z\/x, z*log x))@
liftA2_ :: (Eq a, Num a) =>
(a -> a -> a)
-> (Tower tag a
-> Tower tag a
-> Tower tag a
-> (Tower tag a, Tower tag a))
-> Tower tag a -> Tower tag a -> Tower tag a
liftA2_ f df x y = z
where z = bundle z0 z'
z0 = f (primal x) (primal y)
z' = tangentTower x * dfdx + tangentTower y * dfdy
(dfdx, dfdy) = df z x y
-- | The 'liftA1disc' function lifts a scalar function with numeric
-- input and discrete output from the primal domain into the
-- derivative tower domain.
liftA1disc :: (Eq a, Num a) => (a -> c) -> Tower tag a -> c
liftA1disc = (. primal)
-- | The 'liftA2disc' function lifts a binary function with numeric
-- inputs and discrete output from into the derivative tower domain.
liftA2disc :: (Eq a, Num a) => (a -> a -> b) -> Tower tag a -> Tower tag a -> b
liftA2disc = (`on` primal)
-- | The 'liftLin' function lifts a scalar linear function from the
-- primal domain into the derivative tower domain. WARNING: The
-- restriction to linear functions is not enforced by the type system.
liftLin :: (a -> b) -> Tower tag a -> Tower tag b
liftLin f = toTower . map f . fromTower
-- | The 'liftLin2' function lifts a binary linear function from the
-- primal domain into the derivative tower domain. WARNING 1: The
-- restriction to linear functions is not enforced by the type system.
-- WARNING 2: Binary linear means linear in both arguments together,
-- not bilinear.
liftLin2 :: (Eq a, Num a, Eq b, Num b) =>
(a -> a -> b) -> Tower tag a -> Tower tag a -> Tower tag b
liftLin2 f = (toTower.) . (zipWithDefaults f 0 0 `on` fromTower)
-- Numeric operations on derivative towers.
instance (Eq a, Num a) => Num (Tower tag a) where
(+) = liftLin2 (+)
(-) = liftLin2 (-)
(*) (Tower []) _ = zero
(*) _ (Tower []) = zero
(*) x y = liftA2 (*) (flip (,)) x y
negate = liftLin negate
abs = liftA1 abs
(\x->let x0 = primal x
in
if x0==0
then error "not differentiable: abs(0)"
else if notComplex x0 -- would be good to verify nonComplex tower
then lift (signum x0)
else error "not differentiable: abs(complex)")
signum = liftA1 signum
(\x->let x0 = primal x
in
if x0==0
then error "not differentiable: signum(0)"
else if notComplex x0 -- would be good to verify nonComplex tower
then zero
else error "not differentiable: signum(complex)")
fromInteger = lift . fromInteger
notComplex x = s == 0 || s == 1 || s == -1
where s = signum x
-- Here is another problem with supporting complex numbers. This is a
-- show stopper for doing transparent forward AD on functions that are
-- explicitly over complex numbers.
-- The following will not work:
-- instance Complex a => Complex (Tower tag a) where
-- realPart = liftLin realPart
-- imagPart = liftLin imagPart
-- conjugate = liftLin conjugate
-- ...
-- This fails because Complex in the standard prelude is not abstract
-- enough. It is impossible to make (Tower (Complex a)) a complex
-- number; the system can only do (Complex (Tower a)). This makes it
-- impossible to take derivatives of complex functions, i.e., analytic
-- functions, using the same API as non-complex functions.
instance (Eq a, Fractional a) => Fractional (Tower tag a) where
recip = liftA1_ recip (const . negate . (^2))
fromRational = lift . fromRational
instance (Eq a, Floating a) => Floating (Tower tag a) where
pi = lift pi
exp = liftA1_ exp const
sqrt = liftA1_ sqrt (const . recip . (2*))
log = liftA1 log recip
-- The default case has a problem when the base is zero, e.g.,
-- diffUU (**2) 0 = NaN
-- which is wrong.
-- Special cases are needed to bypass avoidable division by 0 and log 0.
-- This is handled in two parts: first we deal with a constant zero exponent,
-- then we deal with all other constant exponents.
(**) x (Tower []) = 1
(**) x (Tower [0]) = 1
(**) x y@(Tower [y0]) = liftA1 (**y0) ((y*) . (**(y-1))) x
(**) x y = liftA2_ (**) (\z x y -> (y*z/x, z*log x)) x y
sin = liftA1 sin cos
cos = liftA1 cos (negate . sin)
tan = liftA1 tan (recip . (^2) . cos)
asin = liftA1 asin (recip . sqrt . (1-) . (^2))
acos = liftA1 acos (negate . recip . sqrt . (1-) . (^2))
atan = liftA1 atan (recip . (1+) . (^2))
sinh = liftA1 sinh cosh
cosh = liftA1 cosh sinh
asinh = liftA1 asinh (recip . sqrt . (1+) . (^2))
acosh = liftA1 acosh (recip . sqrt . (-1+) . (^2))
atanh = liftA1 atanh (recip . (1-) . (^2))
-- The RealFloat instance which follows is mainly to get atan2 to
-- work, which is by inheritance.
-- Note that atan2 is important in numeric code: to a first
-- approximation, no program should ever use atan, but always atan2
-- instead. In particular it is virtually impossible for "atan (y/x)"
-- to be correct; "atan2 y x" is almost certainly what is really meant.
{-
Warning! If we do not give a special definition of atan2 below,
instead allowing it to default, there are errors at branch points, in
particular at (atan2 1 0). These occur with "probability zero"
around the unit circule, so you might not notice them with random
testing.
*Numeric.FAD> let shouldBeOne a = diff (\a->atan2 (sin a) (cos a)) a
*Numeric.FAD> shouldBeOne (pi/2-1e-12)
1.0
*Numeric.FAD> shouldBeOne (pi/2)
1.0
*Numeric.FAD> shouldBeOne (pi/2+1e-12)
1.0
*Numeric.FAD> diff shouldBeOne (pi/2-1e-12)
0.0
*Numeric.FAD> diff shouldBeOne (pi/2)
-4.0 -- <<<<<<<<<<<<<<<< BUG IS HERE
*Numeric.FAD> diff shouldBeOne (pi/2+1e-12)
0.0
-}
instance (RealFloat a, RealFrac a) => RealFloat (Tower tag a) where
floatRadix = liftA1disc floatRadix
floatDigits = liftA1disc floatDigits
floatRange = liftA1disc floatRange
decodeFloat = liftA1disc decodeFloat
encodeFloat n i = bundle (encodeFloat n i)
(error "not differentiable: encodeFloat")
scaleFloat i = liftA1_ (scaleFloat i) (/)
isNaN = liftA1disc isNaN
isInfinite = liftA1disc isInfinite
isDenormalized = liftA1disc isDenormalized
isNegativeZero = liftA1disc isNegativeZero
isIEEE = liftA1disc isIEEE
atan2 = liftA2 atan2 (\x y->let r = recip (x^2+y^2) in (y*r, -x*r))
instance RealFrac a => RealFrac (Tower tag a) where
properFraction x = (z1, (bundle z2 (tangentTower x)))
where (z1,z2) = properFraction (primal x)
truncate = liftA1disc truncate
round = liftA1disc round
ceiling = liftA1disc ceiling
floor = liftA1disc floor
instance Real a => Real (Tower tag a) where
-- this would be a bug, as it would discard the tower:
-- toRational = liftA1disc toRational
toRational (Tower []) = 0
toRational (Tower [x0]) = toRational x0
toRational _ = error "toRational of Dual number with tower"
instance (Eq a, Num a) => Eq (Tower tag a) where
(==) = liftA2disc (==)
instance (Ord a, Eq a, Num a) => Ord (Tower tag a) where
compare = liftA2disc compare
{-
The [x..] bug:
> diff (\x->[x] !! 0) 7
1 -- Correct
> diff (\x->[x..] !! 0) 7
0 -- Incorrect!
-}
instance (Enum a, Eq a, Num a, Ord a) => Enum (Tower tag a) where
succ = liftA1 succ (const 1)
pred = liftA1 pred (const 1)
-- this would be a bug, as it would discard the tower:
-- fromEnum = liftA1disc fromEnum
fromEnum (Tower []) = 0
fromEnum (Tower [x0]) = fromEnum x0
fromEnum _ = error "fromEnum of Dual number with tower"
toEnum = lift . toEnum
enumFrom = iterate succ -- [n..]
enumFromThen n n' = iterate (+(n'-n)) n -- [n,n'..]
enumFromTo n m = takeWhile (<=m) (enumFrom n) -- [n..m]
enumFromThenTo n n' m -- [n,n'..m]
= takeWhile (if n' >= n then (<= m) else (>= m)) (enumFromThen n n')
instance Integral a => Integral (Tower tag a) where
-- this would be a bug, as it would discard the tower:
-- toInteger = liftA1disc toInteger
toInteger (Tower []) = 0
toInteger (Tower [x0]) = toInteger x0
toInteger _ = error "toInteger of Dual number with tower"
-- div, mod, etc., not implemented: not in general differentiable
quotRem a b = error "quotRem of Dual number"
-- First-Order Differentiation Operators
{- $fodo
These have two-letter suffices for the arity of the input and
output of the passed functions: U for univariate, meaning a number,
M for multivariate, meaning a list of numbers.
When the input is multivariate a directional derivative is
calculated; this requires an additional \"direction\" parameter. The
multivariate case is treated as a list (on input) and as a functor
of arbitrary shape, which includes lists as a special case, on
output.
Naming convention:
[@diff{U\/M}{U\/F}@] Derivative-taking operators that return a
primal/first-derivative pair, for all combinations of
scalar/nonscalar input & output
[@diff2{U\/M}{U\/F}@] Derivative-taking operators that calculate a
(primal, first-derivative) pair, for all combinations of
scalar/nonscalar input & output
-}
-- Perhaps these should be named things like
-- AD.Forward.D.uu
-- AD.Forward.D.um
-- AD.Forward.grad
-- AD.Forward.jacobian
-- | The 'diffUU' function calculates the first derivative of a
-- scalar-to-scalar function.
diffUU :: (Eq a, Num a, Eq b, Num b) => (forall tag. Tower tag a -> Tower tag b) -> a -> b
diffUU f = tangent . apply f
-- | The 'diffUF' function calculates the first derivative of
-- scalar-to-nonscalar function.
diffUF :: (Eq a, Num a, Eq b, Num b, Functor f) =>
(forall tag. Tower tag a -> f (Tower tag b)) -> a -> f b
diffUF f = fmap tangent . apply f
-- | The 'diffMU' function calculate the product of the Jacobian of a
-- nonscalar-to-scalar function with a given vector. Aka: directional
-- derivative.
diffMU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> Tower tag b) -> [a] -> [a] -> b
diffMU f xs = tangent . f . zipWithBundle xs
-- | The 'diffMF' function calculates the product of the Jacobian of a
-- nonscalar-to-nonscalar function with a given vector. Aka:
-- directional derivative.
diffMF :: (Eq a, Num a, Eq b, Num b, Functor f) =>
(forall tag. [Tower tag a] -> f (Tower tag b)) -> [a] -> [a] -> f b
diffMF f xs = fmap tangent . f . zipWithBundle xs
-- | The 'diff2UU' function calculates the value and derivative, as a
-- pair, of a scalar-to-scalar function.
diff2UU :: (Eq a, Num a, Eq b, Num b) => (forall tag. Tower tag a -> Tower tag b) -> a -> (b,b)
diff2UU f = dualToPair . apply f
-- | The 'diffUF2' function calculates the value and derivative, as a
-- pair, of a scalar-to-nonscalar function.
diff2UF :: (Eq a, Num a, Eq b, Num b, Functor f) =>
(forall tag. Tower tag a -> f (Tower tag b)) -> a -> (f b, f b)
diff2UF f = fdualsToPair . apply f
-- | The 'diffMU2' function calculates the value and directional
-- derivative, as a pair, of a nonscalar-to-scalar function.
diff2MU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> Tower tag b) -> [a] -> [a] -> (b,b)
diff2MU f xs = dualToPair . f . zipWithBundle xs
-- | The 'diffMF2' function calculates the value and directional
-- derivative, as a pair, of a nonscalar-to-nonscalar function.
diff2MF :: (Eq a, Num a, Eq b, Num b, Functor f) =>
(forall tag. [Tower tag a] -> f (Tower tag b))
-> [a] -> [a] -> (f b, f b)
diff2MF f xs = fdualsToPair . f . zipWithBundle xs
-- Some utility functions and classes for doing transposes and padding
-- of outputs. Variants handle things that are not shaped like lists,
-- but are pretty close.
zeroPad :: (Eq a, Num a) => [a] -> [a]
zeroPad = (++ repeat 0)
zeroPadF :: (Eq a, Num a, Functor f) => [f a] -> [f a]
zeroPadF fxs@(fx:_) = fxs ++ repeat (fmap (const 0) fx)
-- | The 'transposePad' function is like Data.List.transpose except
-- that it fills in missing elements with 0 rather than skipping them.
-- It can give a ragged output to a ragged input, but the lengths in
-- the output are nonincreasing.
transposePad :: (Eq a, Num a) => [[a]] -> [[a]]
transposePad = foldr (zipWithDefaults (:) 0 []) []
-- | The 'transposePadF' function is like Data.List.transpose except
-- that it fills in missing elements with 0 rather than skipping them,
-- and is generalized to Foldable Functors. Unlike transposePad, it
-- gives a "square" output to a ragged input.
transposePadF :: (Eq a, Num a, Foldable f, Functor f) => f [a] -> [f a]
transposePadF fx =
if Data.Foldable.all null fx
then []
else (fmap (!!!!0) fx) : (transposePadF (fmap (drop 1) fx))
where (!!!!) = indexDefault (Just 0)
-- The 'transposeF' function transposes w/ infinite zero row padding.
-- transposeF :: (Eq a, Num a, Functor f) => f [a] -> [f a]
-- transposeF = transF . fmap zeroPad
-- where transF x = (fmap (!!0) x) : (transF $ fmap (drop 1) x)
{- $hodo
Naming convention:
[@diffs{U\/M}{U\/F}@]: Derivative-taking operators that return a list
[primal, first-derivative, 2nd-derivative, ...], for all
combinations of scalar/nonscalar input & output.
-}
-- | The 'diffsUU' function calculates a list of derivatives of a
-- scalar-to-scalar function. The 0-th element of the list is the
-- primal value, the 1-st element is the first derivative, etc.
diffsUU :: (Eq a, Num a, Eq b, Num b) => (forall tag. Tower tag a -> Tower tag b) -> a -> [b]
diffsUU f = fromTower . apply f
-- | The 'diffsUF' function calculates an infinite list of derivatives
-- of a scalar-to-nonscalar function. The 0-th element of the list is
-- the primal value, the 1-st element is the first derivative, etc.
diffsUF :: (Eq a, Num a, Eq b, Num b, Functor f, Foldable f) =>
(forall tag. Tower tag a -> f (Tower tag b))
-> a -> [f b]
diffsUF f = transposePadF . fmap fromTower . apply f
-- | The 'diffsMU' function calculates an infinite list of derivatives
-- of a nonscalar-to-scalar function. The 0-th element of the list is
-- the primal value, the 1-st element is the first derivative, etc.
-- The input is a (possibly truncated) list of the primal, first
-- derivative, etc, of the input.
diffsMU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> Tower tag b)
-> [[a]] -> [b]
diffsMU f = fromTower . f . map toTower . transposePad
-- | The 'diffsMF' function calculates an infinite list of derivatives
-- of a nonscalar-to-nonscalar function. The 0-th element of the list
-- is the primal value, the 1-st element is the first derivative, etc.
-- The input is a (possibly truncated) list of the primal, first
-- derivative, etc, of the input.
diffsMF :: (Eq a, Num a, Eq b, Num b, Functor f, Foldable f) =>
(forall tag. [Tower tag a] -> f (Tower tag b))
-> [[a]] -> [f b]
diffsMF f = transposePadF . fmap fromTower . f . map toTower . transposePad
-- Variants of diffsXX names diffs0XX, which zero-pad the output list
-- | The 'diffs0UU' function is like 'diffsUU' except the output is zero padded.
diffs0UU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b)
-> a -> [b]
diffs0UU f = zeroPad . diffsUU f
-- | The 'diffs0UF' function is like 'diffsUF' except the output is zero padded.
diffs0UF :: (Eq a, Num a, Eq b, Num b, Functor f, Foldable f) =>
(forall tag. Tower tag a -> f (Tower tag b))
-> a -> [f b]
diffs0UF f = zeroPadF . diffsUF f
-- | The 'diffs0MU' function is like 'diffsMU' except the output is zero padded.
diffs0MU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> Tower tag b)
-> [[a]] -> [b]
diffs0MU f = zeroPad . diffsMU f
-- | The 'diffs0MF' function is like 'diffsMF' except the output is zero padded.
diffs0MF :: (Eq a, Num a, Eq b, Num b, Functor f, Foldable f) =>
(forall tag. [Tower tag a] -> f (Tower tag b))
-> [[a]] -> [f b]
diffs0MF f = zeroPadF . diffsMF f
-- Common access patterns
-- | The 'diff' function is a synonym for 'diffUU'.
diff :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b)
-> a -> b
diff = diffUU
-- | The 'diff2' function is a synonym for 'diff2UU'.
diff2 :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b)
-> a -> (b, b)
diff2 = diff2UU
-- | The 'diffs' function is a synonym for 'diffsUU'.
diffs :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b)
-> a -> [b]
diffs = diffsUU
-- | The 'diffs0' function is a synonym for 'diffs0UU'.
diffs0 :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b)
-> a -> [b]
diffs0 = diffs0UU
-- | The 'grad' function calculates the gradient of a
-- nonscalar-to-scalar function, using n invocations of forward AD,
-- where n is the input dimmensionality. NOTE: this is O(n)
-- inefficient as compared to reverse AD.
grad :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> Tower tag b)
-> [a] -> [b]
-- grad f = head . jacobian ((:[]) . f) -- Robot face, robot claw!
grad f xs = map (diffMU f xs) (identity xs)
-- | The 'jacobian' function calcualtes the Jacobian of a
-- nonscalar-to-nonscalar function, using n invocations of forward AD,
-- where n is the input dimmensionality.
jacobian :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. [Tower tag a] -> [Tower tag b])
-> [a] -> [[b]]
jacobian f xs = transpose $ map (diffMF f xs) (identity xs)
-- | The 'dualToPair' function converts a tower of derivatives to a
-- pair of the primal and the first derivative.
dualToPair :: (Eq a, Num a) => Tower tag a -> (a,a)
dualToPair x = (primal x, tangent x)
-- | The 'fdualsToPair' function converts a functor of derivative
-- towers to a pair: one with the functor holding the primal values,
-- the other with the functor holding the first derivatives.
fdualsToPair :: (Eq a, Num a, Functor f) => f (Tower tag a) -> (f a, f a)
fdualsToPair fxs = (fmap primal fxs, fmap tangent fxs)
-- | The 'zipWithBundle' function zip two lists of numbers into a list
-- of derivative towers with the given primal values andd first
-- derivatives. The two lists should have the same length.
zipWithBundle :: (Eq a, Num a) => [a] -> [a] -> [Tower tag a]
zipWithBundle = zipWithDefaults (\x0 x1->toTower [x0,x1]) e e
where e = error "zipWithBundle arguments, lengths differ"
-- | The 'primalUU' function lowers a function over dual numbers to a
-- function in the primal domain, where the function is
-- scalar-to-scalar.
primalUU :: (Eq a, Num a, Eq b, Num b) =>
(forall tag. Tower tag a -> Tower tag b) -> a -> b
primalUU f = primal . f . lift
-- | The 'primalUF' function lowers a function over dual numbers to a
-- function over primals, where the function is scalar-to-nonscalar.
primalUF :: (Eq a, Num a, Eq b, Num b, Functor fb) =>
(forall tag. Tower tag a -> fb (Tower tag b))
-> a -> (fb b)
primalUF f = fmap primal . f . lift
-- | The 'primalFU' function lowers a function over dual numbers to a
-- function over primals where the function is nonscalar-to-scalar.
primalFU :: (Eq a, Num a, Eq b, Num b, Functor fa) =>
(forall tag. fa (Tower tag a) -> Tower tag b)
-> (fa a) -> b
primalFU f = primal . f . fmap lift
-- | The 'primalFF' function lowers a function over dual numbers to a
-- function over primals where the function is nonscalar-to-nonscalar.
primalFF :: (Eq a, Num a, Eq b, Num b, Functor fa, Functor fb) =>
(forall tag. fa (Tower tag a) -> fb (Tower tag b))
-> (fa a) -> (fb b)
primalFF f = fmap primal . f . fmap lift
-- | The 'identity' function makes an identity matrix, represented as
-- list of lists of numbers. The dimensionality is taken from the
-- length of the argument list.
identity :: (Eq a, Num a) => [b] -> [[a]]
identity [] = error "cannot create 0-dimensional identity matrix"
identity xs = map (\i -> map (\j -> if i==j then 1 else 0) js) js
where js = zipWith const [0..] xs
-- | The 'show2d' function formats a vector or matrix (represented as
-- list or list of lists) for convenient examination.
show2d :: Show a => [a] -> String
show2d = ("["++) . (++"]\n") . (foldl1 $ (++) . (++"\n ")) . map show
-- Misc Derivative-Using Routines
-- | The 'taylor' function evaluate a Taylor series of the given
-- function around the given point with the given delta. It returns a
-- list of increasingly higher-order approximations.
--
-- EXAMPLE: @taylor exp 0 1@
taylor :: (Eq a, Fractional a) =>
(forall tag. Tower tag a -> Tower tag a)
-> a -> a -> [a]
taylor f x dx = scanl1 (+)
$ zipWith3 (\x y z -> x*y*z)
(diffsUU f x)
recipFactorials
(powers dx)
where
powers x = iterate (*x) 1
recipFactorials = scanl (/) 1 $ map fromIntegral [1..]
-- | The 'taylor2' function evaluates a two-dimensional Taylor series
-- of the given function. This is calculated by nested application of
-- the 'taylor' function, and the exported signature reflects this.
taylor2 :: (Eq a, Fractional a) =>
(forall tag0 tag.
Tower tag0 (Tower tag a)
-> Tower tag0 (Tower tag a)
-> Tower tag0 (Tower tag a))
-> a -> a -> a -> a -> [[a]]
taylor2 f x y dx dy =
[taylor (\y -> taylor (flip f (lift y)) (lift x) (lift dx) !! ix)
y dy
| ix <- map fst $ zip [0..] rowsListLen]
where rowsListLen = taylor (primalUU (flip f (lift (lift y)))) x dx
-- Optimization Routines
-- Perhaps these should be in a module, named things like
-- AD.Forward.Newton.findZero
-- AD.Forward.Newton.inverse
-- | The 'zeroNewton' function finds a zero of a scalar function using
-- Newton's method; its output is a stream of increasingly accurate
-- results. (Modulo the usual caveats.)
--
-- TEST CASE:
-- @take 10 $ zeroNewton (\\x->x^2-4) 1 -- converge to 2.0@
--
-- TEST CASE
-- :module Data.Complex Numeric.FAD
-- @take 10 $ zeroNewton ((+1).(^2)) (1 :+ 1) -- converge to (0 :+ 1)@
--
zeroNewton :: (Eq a, Fractional a) =>
(forall tag. Tower tag a -> Tower tag a)
-> a -> [a]
zeroNewton f x0 = iterate (\x -> let (y,y') = diff2UU f x in x - y/y') x0
-- | The 'inverseNewton' function inverts a scalar function using
-- Newton's method; its output is a stream of increasingly accurate
-- results. (Modulo the usual caveats.)
--
-- TEST CASE:
-- @take 10 $ inverseNewton sqrt 1 (sqrt 10) -- converge to 10@
--
inverseNewton :: (Eq a, Fractional a) =>
(forall tag. Tower tag a -> Tower tag a)
-> a -> a -> [a]
inverseNewton f x0 y = zeroNewton (\x -> (f x) - (lift y)) x0
-- | The 'fixedPointNewton' function find a fixedpoint of a scalar
-- function using Newton's method; its output is a stream of
-- increasingly accurate results. (Modulo the usual caveats.)
fixedPointNewton :: (Eq a, Fractional a) =>
(forall tag. Tower tag a -> Tower tag a)
-> a -> [a]
fixedPointNewton f x0 = zeroNewton (\x -> (f x) - x) x0
-- | The 'extremumNewton' function finds an extremum of a scalar
-- function using Newton's method; produces a stream of increasingly
-- accurate results. (Modulo the usual caveats.)
extremumNewton :: (Eq a, Fractional a) =>
(forall tag. forall tag1.
Tower tag1 (Tower tag a)
-> Tower tag1 (Tower tag a))
-> a -> [a]
extremumNewton f x0 = zeroNewton (diffUU f) x0
-- | The 'argminNaiveGradient' function performs a multivariate
-- optimization, based on the naive-gradient-descent in the file
-- @stalingrad\/examples\/flow-tests\/pre-saddle-1a.vlad@ from the
-- VLAD compiler Stalingrad sources. Its output is a stream of
-- increasingly accurate results. (Modulo the usual caveats.) The
-- gradient is calculated using Forward AD, which is O(n) inefficient
-- as compared to Reverse AD, where n is the input dimensionality.
argminNaiveGradient :: (Eq a, Fractional a, Ord a) =>
(forall tag. [Tower tag a] -> Tower tag a)
-> [a] -> [[a]]
argminNaiveGradient f x0 =
let
gf = grad f
loop x fx gx eta i =
-- should check gx = 0 here
let
x1 = zipWith (+) x (map ((-eta)*) gx)
fx1 = primalFU f x1
gx1 = gf x1
in
if eta == 0 then []
else if (fx1 > fx) then loop x fx gx (eta/2) 0
else if all (==0) gx then []
-- else if fx1 == fx then loop x1 fx1 gx1 eta (i+1)
else x1:(if (i==10)
then loop x1 fx1 gx1 (eta*2) 0
else loop x1 fx1 gx1 eta (i+1))
in
loop x0 (primalFU f x0) (gf x0) 0.1 0
-- BUGS! BUGS! BUGS! Or, test cases.
{-
shouldBe2 = diffUU (\x -> x*(diffUU (x*) 2)) 1 -- type error w/ or w/o tags
is2 = diffUU (\x -> x*(diffUU ((lift x)*) 2)) 1
shouldBe1 = diffUU (\x -> diffUU (x*) 2) 1 -- is 0 w/o tags, type error w/ tags
is1 = diffUU (\x -> diffUU ((lift x)*) 2) 1
constant_one x = diffUU (\y -> x + y) 1 -- fails type check w/ tags
-- Higher-Order derivatives via nesting, fails type check
ds :: (forall tag. Tower tag a -> Tower tag b) -> a -> [b]
ds f x = y:(ds (diffUU f) x)
where (y,y') = diff2UU f x
ds f x = (f x):(ds (diffUU f) x)
ds f x = y:y':(ds (diffUU (diffUU f)) x)
where (y,y') = diff2UU f x
-}