Pith. sign in

REVIEW 3 cited by

A simple neural network module for relational reasoning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1706.01427 v1 pith:V2GNLY7J submitted 2017-06-05 cs.CL cs.LG

classification cs.CLcs.LG
keywords networksreasoningrelationalmoduleansweringcalledcapacitydataset
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Relational reasoning is a central component of generally intelligent behavior, but has proven difficult for neural networks to learn. In this paper we describe how to use Relation Networks (RNs) as a simple plug-and-play module to solve problems that fundamentally hinge on relational reasoning. We tested RN-augmented networks on three tasks: visual question answering using a challenging dataset called CLEVR, on which we achieve state-of-the-art, super-human performance; text-based question answering using the bAbI suite of tasks; and complex reasoning about dynamic physical systems. Then, using a curated dataset called Sort-of-CLEVR we show that powerful convolutional networks do not have a general capacity to solve relational questions, but can gain this capacity when augmented with RNs. Our work shows how a deep learning architecture equipped with an RN module can implicitly discover and learn to reason about entities and their relations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Spectral Rewiring for Exploration, Purification, and Model Merging

    cs.LG 2026-07 conditional novelty 6.5 of 10

    Subspace-Aligned Rewiring projects RL weight updates onto the base model’s SVD basis, retaining a compact rewiring matrix that preserves reasoning and improves exploration and multi-domain merging.

  2. Toward Manifest Relationality in Transformers via Symmetry Reduction

    cs.LG 2026-02 conditional novelty 6.0 of 10

    Transformer attention and parameter optimization can be rewritten on symmetry-reduced relational variables (Gram matrices and invariant parameter composites), removing coordinate redundancies by construction.

  3. Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning

    cs.CL 2025-05 conditional novelty 6.0 of 10

    MERRY integrates graph structure and entity/relation text via multi-perspective message passing, improving zero-shot knowledge graph completion and question answering over strong baselines.

Pith tools