Open ctongfei opened 5 years ago
For certain 2nd-order optimization algorithms, e.g. (Martens & Grosse, 2015 JMLR):
def backward[G[_]: Algebra, X, Y](dy: G[Y], y: Y, x: X): G[X]
where G[_] encapsulates backward computations. Trivially G = Id.
G[_]
G = Id
G[_] = Batched[_] naturally leads to Jacobian (#33).
G[_] = Batched[_]
For certain 2nd-order optimization algorithms, e.g. (Martens & Grosse, 2015 JMLR):
where
G[_]
encapsulates backward computations. TriviallyG = Id
.