Notes on Computational Graph and Jacobian Accumulation

12/30/2020
by   Yichong Zhou, et al.
0

The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these relations and differences, making plain their interconvertibility. By revealing different types of multiplication relations in algebraic expressions and their elimination dependencies in line-graph, we establish a theoretical limit on the efficiency of face elimination.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2023

Clones, polymorphisms and relations of arity omega

Polymorphisms of arity omega have recently been used in the proof of mod...
research
05/30/2023

Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints

Identifiability of data is one of the fundamental problems in data scien...
research
10/20/2020

Evaluation of Logic Programs with Built-Ins and Aggregation: A Calculus for Bag Relations

We present a scheme for translating logic programs, which may use aggreg...
research
08/08/2020

dxo: A System for Relational Algebra and Differentiation

We present dxo, a relational system for algebra and differentiation, wri...
research
05/19/2021

Wilf classes of non-symmetric operads

Two operads are said to belong to the same Wilf class if they have the s...
research
11/02/2022

A Note on the Ramanujan Machine

The Ramanujan Machine project detects new expressions related to constan...
research
01/12/2018

Relational Characterisations of Paths

Binary relations are one of the standard ways to encode, characterise an...

Please sign up or login with your details

Forgot password? Click here to reset