Internal versus external balancing in the evaluation of graph-based number types

04/03/2019
by   Hanna Geppert, et al.
0

Number types for exact computation are usually based on directed acyclic graphs. A poor graph structure can impair the efficency of their evaluation. In such cases the performance of a number type can be drastically improved by restructuring the graph or by internally balancing error bounds with respect to the graph's structure. We compare advantages and disadvantages of these two concepts both theoretically and experimentally.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2020

Graph Structure of Neural Networks

Neural networks are often represented as graphs of connections between n...
research
05/23/2019

Graph regret bounds for Thompson Sampling and UCB

We study the stochastic multi-armed bandit problem with the graph-based ...
research
07/26/2017

The Advantage of Evidential Attributes in Social Networks

Nowadays, there are many approaches designed for the task of detecting c...
research
10/17/2019

Graph Embedding VAE: A Permutation Invariant Model of Graph Structure

Generative models of graph structure have applications in biology and so...
research
07/11/2018

On error representation in exact-decisions number types

Accuracy-driven computation is a strategy widely used in exact-decisions...
research
06/15/2012

Improving the Asymmetric TSP by Considering Graph Structure

Recent works on cost based relaxations have improved Constraint Programm...
research
06/20/2023

Structure-Aware Robustness Certificates for Graph Classification

Certifying the robustness of a graph-based machine learning model poses ...

Please sign up or login with your details

Forgot password? Click here to reset