Pith. sign in

REVIEW 1 cited by

Measuring abstract reasoning in neural networks

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 1807.04225 v1 pith:KCITHJLY submitted 2018-07-11 cs.LG stat.ML

classification cs.LGstat.ML
keywords reasoningabstracttestdiffernetworksneuraltrainingchallenge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Whether neural networks can learn abstract reasoning or whether they merely rely on superficial statistics is a topic of recent debate. Here, we propose a dataset and challenge designed to probe abstract reasoning, inspired by a well-known human IQ test. To succeed at this challenge, models must cope with various generalisation `regimes' in which the training and test data differ in clearly-defined ways. We show that popular models such as ResNets perform poorly, even when the training and test sets differ only minimally, and we present a novel architecture, with a structure designed to encourage reasoning, that does significantly better. When we vary the way in which the test questions and training data differ, we find that our model is notably proficient at certain forms of generalisation, but notably weak at others. We further show that the model's ability to generalise improves markedly if it is trained to predict symbolic explanations for its answers. Altogether, we introduce and explore ways to both measure and induce stronger abstract reasoning in neural networks. Our freely-available dataset should motivate further progress in this direction.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Enhancing Transformers for Generalizable First-Order Logical Entailment

    cs.CL 2025-01 conditional novelty 6.0 of 10

    Transformers with relative positional encoding beat KGQA baselines, and adding logic-aware attention (TEGA) improves out-of-distribution performance on a new 55-type benchmark.

Pith tools