Show simple item record

dc.contributor.authorChristianson, B.
dc.date.accessioned2011-11-28T16:01:31Z
dc.date.available2011-11-28T16:01:31Z
dc.date.issued1993
dc.identifier.citationChristianson , B 1993 , Reverse accumulation of functions containing gradients . in Procs of the Theory Institute on Combinatorial Challenges in Automatic Differentiation . Numerical Optimisation Centre Technical Report , vol. 278 .
dc.identifier.otherdspace: 2299/4337
dc.identifier.urihttp://hdl.handle.net/2299/7172
dc.description.abstractWe extend the technique of reverse accumulation so as to allow efficient extraction of gradients of scalar valued functions which are themselves constructed by composing operations which include taking derivatives of subsidiary functions. The technique described here relies upon augmenting the computational graph, and performs well when the highest order of derivative information required is at most fourth or fifth order. When higher order is required, an approach based upon interpolation of taylor series is likely to give better performance, and as a first step in this direction we introduce a transformation mapping reverse passes through an augmented graph onto taylor valued accumulations through a forward pass. The ideas are illustrated by application to a parameter free differentiable penalty function for constrained optimization problems.en
dc.format.extent156500
dc.language.isoeng
dc.relation.ispartofProcs of the Theory Institute on Combinatorial Challenges in Automatic Differentiation
dc.relation.ispartofseriesNumerical Optimisation Centre Technical Report
dc.titleReverse accumulation of functions containing gradientsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record