Parallel Algorithms Align with Neural Execution

07/08/2023
by   Valerie Engelmayer, et al.
0

Neural algorithmic reasoners are parallel processors. Teaching them sequential algorithms contradicts this nature, rendering a significant share of their computations redundant. Parallel algorithms however may exploit their full computational power, therefore requiring fewer layers to be executed. This drastically reduces training times, as we observe when comparing parallel implementations of searching, sorting and finding strongly connected components to their sequential counterparts on the CLRS framework. Additionally, parallel versions achieve strongly superior predictive performance in most cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2022

Towards Parallel Learned Sorting

We introduce a new sorting algorithm that is the combination of ML-enhan...
research
10/12/2018

Parallelism in Randomized Incremental Algorithms

In this paper we show that many sequential randomized incremental algori...
research
09/03/2021

Comparative Analysis for Quick Sort Algorithm under four Different Modes of Execution

This work presents a comparison for the performance of sequential sortin...
research
12/12/2019

Theoretically-Efficient and Practical Parallel DBSCAN

The DBSCAN method for spatial clustering has received significant attent...
research
08/23/2018

Exploring Parallel Execution Strategies for Constraint Handling Rules - Work-in-Progress Report

Constraint Handling Rules (CHR) is a declarative rule-based formalism an...
research
03/31/2013

Parallel Computation Is ESS

There are enormous amount of examples of Computation in nature, exemplif...
research
06/07/2019

Lightweight Parallel Foundations: a model-compliant communication layer

We present the Lightweight Parallel Foundations (LPF), an interoperable ...

Please sign up or login with your details

Forgot password? Click here to reset