You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The names are open to bikeshedding. The idea is to let AD compute multiple (co)tangents in one go. This can avoid n executions of the primal function. In some cases the compiler might be able to optimise the replicated work, but I wouldn't want to rely on it in all cases.
I think this is fairly straightforward to implement: we just need to teach the AD passes that the (co)tangent of a primal variable of type t is not necessarily of type t, but can also be an array of type [n]t (where n is a constant in any instance of AD).
The text was updated successfully, but these errors were encountered:
I would like the following functions to be made available:
The names are open to bikeshedding. The idea is to let AD compute multiple (co)tangents in one go. This can avoid
n
executions of the primal function. In some cases the compiler might be able to optimise the replicated work, but I wouldn't want to rely on it in all cases.I think this is fairly straightforward to implement: we just need to teach the AD passes that the (co)tangent of a primal variable of type
t
is not necessarily of typet
, but can also be an array of type[n]t
(wheren
is a constant in any instance of AD).The text was updated successfully, but these errors were encountered: