Seppo Linnainmaa

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Seppo Ilmari Linnainmaa (born 28 September 1945) is a Finnish mathematician and computer scientist. He was born in Pori.[1] In 1974 he obtained the first doctorate ever awarded in computer science at the University of Helsinki.[2] In 1976, he became Assistant Professor. From 1984-1985 he was Visiting Professor at the University of Maryland, USA. From 1986-1989 he was Chairman of the Finnish Artificial Intelligence Society. From 1989–2007, he was Research Professor at the VTT Technical Research Centre of Finland. He retired in 2007.

Explicit, efficient error backpropagation in arbitrary, discrete, possibly sparsely connected, neural networks-like networks was first described in a 1970 master's thesis (Linnainmaa, 1970, 1976), albeit without reference to NNs,[3] when Linnainmaa introduced the reverse mode of automatic differentiation (AD), in order to efficiently compute the derivative of a differentiable composite function that can be represented as a graph, by recursively applying the chain rule to the building blocks of the function.[2][4][5][6] Linnainmaa published it first, following by Gerardi Ostrowski who used it in the context of certain process models in chemical engineering some five years earlier, but didn't published it before.

With faster computers emerging, the method has become heavily used in numerous applications. For example, backpropagation of errors in multi-layer perceptrons, a technique used in machine learning, is a special case of reverse mode AD[further explanation needed].

Notes[edit]

  1. ^ Ellonen, Leena, ed. (2008). Suomen professorit 1640–2007 (in Finnish). Helsinki: Professoriliitto. p. 405. ISBN 978-952-99281-1-8.
  2. ^ a b Griewank, Andreas (2012). Who Invented the Reverse Mode of Differentiation?. Optimization Stories, Documenta Matematica, Extra Volume ISMP (2012), 389-400.
  3. ^ Jürgen Schmidhuber, (2015). Who Invented Backpropagation?
  4. ^ Linnainmaa, Seppo (1970). The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis (in Finnish), Univ. Helsinki, 6-7.
  5. ^ Linnainmaa, Seppo (1976). Taylor expansion of the accumulated rounding error. BIT Numerical Mathematics, 16(2), 146-160.
  6. ^ Griewank, Andreas and Walther, A.. Principles and Techniques of Algorithmic Differentiation, Second Edition. SIAM, 2008.

External links[edit]