Recurrent Relational Networks for Complex Relational Reasoning
Recurrent Relational Networks for Complex Relational Reasoning
Recurrent Relational Networks for Complex Relational Reasoning

Recurrent Relational Networks for Complex Relational Reasoning

Learn more about recurrent relational networks to train AI to mimic human behaviors.
Article
Reading time:
By
Rasmus Berg Palm, Ulrich Paquet, Ole Winther
TABLE OF CONTENTS

Discover Raffle Search

An AI search engine that simplifies data management, analysis, and insights for smarter business decisions and market strategies.

Explore our Research

Humans can abstractly reason about objects and their interactions, a capability not shared with state-of-the-art deep learning models. Relational networks, introduced by Santoro et al.(2017), add the capacity for relational reasoning to deep neural networks but are limited in the complexity of the reasoning tasks they can address.

We introduce recurrent relational networks, which increase the suite of solvable tasks to those that require an order of magnitude more steps of relational reasoning. We use recurrent relational networks to solve Sudoku puzzles and achieve state-of-the-art results by solving 96.6% of the hardest Sudoku puzzles, where relational networks fail to solve any.

We also apply our model to the BaBi textual QA dataset solving 19/20 tasks which is competitive with state-of-the-art sparse differentiable neural computers. The recurrent relational network is a general-purpose module that can augment any neural network model with the capacity to do many-step relational reasoning.

Download

Recurrent Relational Networks for Complex Relational Reasoning
Recurrent Relational Networks for Complex Relational Reasoning

Recurrent Relational Networks for Complex Relational Reasoning

Learn more about recurrent relational networks to train AI to mimic human behaviors.

Explore our Research

Humans can abstractly reason about objects and their interactions, a capability not shared with state-of-the-art deep learning models. Relational networks, introduced by Santoro et al.(2017), add the capacity for relational reasoning to deep neural networks but are limited in the complexity of the reasoning tasks they can address.

We introduce recurrent relational networks, which increase the suite of solvable tasks to those that require an order of magnitude more steps of relational reasoning. We use recurrent relational networks to solve Sudoku puzzles and achieve state-of-the-art results by solving 96.6% of the hardest Sudoku puzzles, where relational networks fail to solve any.

We also apply our model to the BaBi textual QA dataset solving 19/20 tasks which is competitive with state-of-the-art sparse differentiable neural computers. The recurrent relational network is a general-purpose module that can augment any neural network model with the capacity to do many-step relational reasoning.

Download

Don't miss any update!
SOC2 badge