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

Enables multi-head, depth-wise residual retrieval in Transformers by expanding a single residual stream into multiple context-aware streams using causal depthwise convolutions. Improves pretraining convergence and downstream benchmark scores with minimal overhead, yielding notable iso-loss compute speedups in large MoE models.

A concise textbook-style book that explains foundational concepts and techniques for large language models, covering pre-training, generative models, prompting, alignment, inference, and reasoning. Structured as self-contained chapters for readers with some ML/NLP background or those seeking a principled introduction to LLM foundations.

Analyzes why self-evolving reasoning models collapse under repeated self-training and proposes R-Quest: a feedback-driven pipeline that trains solvers to reject invalid questions and uses a frozen base model to detect task-level repetition, filtering training data to sustain multi-round gains.