# Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks

Authors: Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, Tom Goldstein.

Studies recurrent computation as a route to algorithmic length generalization.

First public: 2021-06-08.
ArXiv initial submission: 2021-06-08.

[Original paper](https://arxiv.org/abs/2106.04537) · [Reading-list entry](https://latent-implicit-thinking.github.io/papers/2106.04537/)
[Preprint BibTeX](https://latent-implicit-thinking.github.io/papers/2106.04537/citation.bib) · [Preprint CSL-JSON](https://latent-implicit-thinking.github.io/papers/2106.04537/citation.csl.json) · [JSON record](https://latent-implicit-thinking.github.io/papers/2106.04537/record.json)

Summary and categories are editorial. Read the original paper to verify claims and limitations. A citation to a paper does not, by itself, establish that a later method builds on it.

Reading-list version 0.9.5; literature checked through 2026-10-18.