AIAny

A simple neural network module for relational reasoning

Isolates relational reasoning into a tiny plug-in module that scores pairwise object relations, bolting onto CNN/LSTM encoders to hit super-human 95.5% on CLEVR — and proving plain convnets lack this capacity on their own.

Introduction

The provocative result here is not the benchmark score — it is the demonstration that a high-capacity convolutional network, given a question about how two objects relate, simply cannot answer it, no matter how much you train it. Relation Networks identify the missing piece as a structural one: relational reasoning needs an architectural prior that forces the model to consider objects in pairs, rather than hoping it emerges from raw capacity.

Key Findings
  • The constraint is the feature. An RN computes a function over every pair of objects and sums the results. That hard-wired "look at all pairs" structure, not added parameters, is what lets the network reason about relations — a deliberate inductive bias, not more depth.
  • Plug-and-play, not a new model. The module bolts onto the back of existing CNN or LSTM encoders, consuming whatever object-like features they produce. The same module worked across vision, text, and physics with no task-specific surgery.
  • It exposed a real gap. On the curated Sort-of-CLEVR dataset, strong convnets handled non-relational questions fine but failed the relational ones — until an RN was attached. This isolated relational reasoning as a distinct, measurable deficiency.
  • Numbers that landed. Super-human 95.5% on CLEVR visual question answering, 18 of 20 bAbI text-reasoning tasks solved, plus inference of hidden links in dynamic physical systems.
How It Works

Objects are not labeled or detected explicitly; the RN treats spatial feature-map cells (or LSTM states) as a set of objects and learns to reason over their pairs. The quadratic all-pairs comparison is the whole trick — expensive, but it makes the relational computation unavoidable rather than optional.

Why It Still Matters / When to Skip

Great fit if you want the clean origin point for relational inductive biases — the idea that later flowed into graph networks, self-attention, and DeepMind's "relational inductive biases" line of work. Look elsewhere if you need a scalable production technique: the all-pairs cost grows quadratically with object count, and attention-based relational models have since absorbed and generalized most of what made RNs work.

Information

  • Websitear5iv.labs.arxiv.org
  • OrganizationsDeepMind
  • AuthorsAdam Santoro, David Raposo, David G. T. Barrett, Mateusz Malinowski, Razvan Pascanu, Peter Battaglia, Timothy Lillicrap
  • Published date2017/06/05

More Items

Performs native structural reasoning for proteins, small molecules and inorganic crystals by tokenizing coordinates, topologies and periodic connectivities into a unified structure-aware vocabulary. Treats structural tokens as addressable evidence to produce interpretable prediction traces and improves accuracy across biology, chemistry and materials benchmarks.

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.