Abadi Martín

Cheung Steven

Fernández Maribel

Girard Jean-Yves

Muroya Koko

Crossref

The Geometry of Computation-Graph Abstraction

The popular library TensorFlow (TF) has familiarised the mainstream of machine-learning community with programming language concepts such as data-flow computing and automatic differentiation. Additionally, it has introduced some genuinely new syntactic and semantic programming concepts. In this paper we study one such new concept, the ability to extract and manipulate the state of a computation graph. THis feature allows the convenient specification of parameterised models by freeing the programmer of the bureaucracy of parameter management, while still permitting the use of generic, model-independent, search and optimisation algorithms. We study this new language feature, which we call ‘graph abstraction’ in the context of the call-by-value lambda calculus, using the recently developed Dynamic Geometry of Interaction formalism. We give a simple type system guaranteeing the safety of graph abstraction, and we also show the safety of critical language properties such as garbage collection and the beta law. The semantic model suggests that the feature could be implemented in a general-purpose functional language reasonably efficiently

The Geometry of Computation-Graph Abstraction

Abstract

Similar works

Full text

Available Versions

Crossref

University of Birmingham Research Portal

University of Birmingham Research Portal