Speaker
Description
I have been teaching AD etc. (numerical methods, programming, compilers) to students at various levels of academic maturity (ranging from 1st year BSc to PhD) for a few years now. Many topics covered feature considerable overlap in terms of data structures (e.g., matrices, graphs) and algorithms (e.g., basic linear algebra, graph traversal / transformation) appearing at the very core of the stories told. Wouldn't is be nice if there was a corresponding cover story that can be digested by everybody, including 1st year BSc students?
There is such a story and I intent to present its ``executive summary''. In particular, this talk is meant to illustrate the links of the story with the corresponding topics in AD, including vector modes, compression and elimination techniques for Jacobian accumulation and checkpointing for data flow reversal in adjoint mode.