Scarsity is the notion that the Jacobian J for a given function f: ℝn ↠ ℝm may have fewer than n*m degrees of freedom. A scarse J may be represented by a graph with a minimal edge count. So far, scarsity has been recognized only from a high-level application point of view, and no automatic exploitation has been attempted. We introduce an approach to recognize and use scarsity in computational graphs in a source transformation context. The goal is to approximate the minimal graph representation through a sequence of transformations including eliminations, reroutings, and normalizations, with a secondary goal of minimizing the transformation cost. The method requires no application-level insight and is implemented as a fully automatic transformation in OpenAD. This paper introduces the problem and a set of heuristics to approximate the minimal graph representation. We also present results on a set of test problems. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lyons, A., & Utke, J. (2008). On the practical exploitation of scarsity. In Lecture Notes in Computational Science and Engineering (Vol. 64 LNCSE, pp. 103–114). https://doi.org/10.1007/978-3-540-68942-3_10
Mendeley helps you to discover research relevant for your work.