Efficient Higher Order Derivatives of Objective Functions Composed of Matrix Operations
Sebastian F. Walter

TL;DR
This paper introduces UTPM, a novel method combining existing techniques to efficiently compute higher-order derivatives of matrix functions, significantly reducing computation time and memory usage.
Contribution
The paper presents UTPM, a new approach that efficiently computes higher-order derivatives of matrix functions, inheriting properties of simplicity, efficiency, and multi-order derivative retrieval.
Findings
Achieves about 100x speedup over UTPS in derivative computation.
Requires less memory, enabling differentiation of large functions.
Demonstrates effectiveness on functions involving matrix inverse and trace.
Abstract
This paper is concerned with the efficient evaluation of higher-order derivatives of functions that are composed of matrix operations. I.e., we want to compute the -th derivative tensor , where is given as an algorithm that consists of many matrix operations. We propose a method that is a combination of two well-known techniques from Algorithmic Differentiation (AD): univariate Taylor propagation on scalars (UTPS) and first-order forward and reverse on matrices. The combination leads to a technique that we would like to call univariate Taylor propagation on matrices (UTPM). The method inherits many desirable properties: It is easy to implement, it is very efficient and it returns not only but yields in the process also the derivatives for . As performance test we compute the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Numerical methods for differential equations
