atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Making Neural Programming Architectures Generalize via Recursion

ICLR 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Differentiable and symbolic reasoning · 96 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
make bubble sort recursive (partial: tail call to BUBBLESORT only) (ablation)NPI bubble sort · Bubble Sort, length 3accuracy: 6.7% -> 23%Mixed
full recursion (BUBBLESORT, BSTEP, LSHIFT tail-recursive) (ablation)NPI bubble sort · Bubble Sort, lengths 3-90accuracy: 0% to 100% at length 90 vs non-recursiveHelped
recursive traces for topological sortNPI topological sort · Topological Sort, 5-70 verticesaccuracy: 6.7% -> 100% at 5 vertices; 0% -> 100% at 70Helped
recursive traces for quicksortNPI quicksort · Quicksort, lengths 11-70accuracy: 73.3% -> 100% at length 11; 0% -> 100% at length 70Helped
recursive traces for bubble sort variantNPI bubble sort variant · Bubble Sort variant, length 8accuracy: 6.7% -> 100%Helped
recursive traces for grade-school addition (trained on 5 one-digit sums) (ablation)NPI addition · Grade-school addition, long sumsqualitative generalizationHelped
recursive traces for additionNPI addition · Grade-school addition, up to 5000 digitsgeneralizationNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy