2014
DOI: 10.1590/0101-7438.2014.034.03.0621
|View full text |Cite
|
Sign up to set email alerts
|

On Automatic Differentiation and Algorithmic Linearization

Abstract: ABSTRACT. We review the methods and applications of automatic differentiation, a research and development activity, which has evolved in various computational fields since the mid 1950's. Starting from very simple basic principles that are familiar from school, one arrives at various theoretical and practical challenges. The resulting activity encompasses mathematical research and software development; it is now often referred to as algorithmic differentiation. From a geometrical and algebraic point of view, d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 21 publications
(16 reference statements)
0
7
0
Order By: Relevance
“…We briefly describe AD as used in back-propagation. A detailed description of the working of automatic differentiation can be found in [34]- [36]. AD relies on the ability to decompose a program into a series of elementary operations (primitives) for which the derivatives are known and to which the chain rule can be applied [37].…”
Section: Pytorch Modellingmentioning
confidence: 99%
“…We briefly describe AD as used in back-propagation. A detailed description of the working of automatic differentiation can be found in [34]- [36]. AD relies on the ability to decompose a program into a series of elementary operations (primitives) for which the derivatives are known and to which the chain rule can be applied [37].…”
Section: Pytorch Modellingmentioning
confidence: 99%
“…In this paper, GAMC is equipped with the exponential schedule (15). Under schedule (15), GAMC and AM share similar convergence properties and complexity bounds asymptotically. Yet GAMC has faster mixing per step than AM due to exploitation of local geometric information in early phases of the chain.…”
mentioning
confidence: 99%
“…Yet GAMC has faster mixing per step than AM due to exploitation of local geometric information in early phases of the chain. The tuning parameter r in (15) regulates the frequency of geometric steps and therefore the ratio of mixing per step and computational cost per step. 4.5.…”
mentioning
confidence: 99%
See 2 more Smart Citations