Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks
Studies recurrent computation as a route to algorithmic length generalization.
First public:
Cite this paper
ArXiv preprint
arXiv:2106.04537 · Initial submission: 2021-06-08
A published-version citation has not been verified for this entry. This does not mean the paper is unpublished.
Choose the version you used. The arXiv link may serve a revision; check the original paper for the exact result, assumptions and limitations you cite.
Read or reuse this entry
Plain-text Markdown · JSON record · Find in the full list
Our summary and categories are a reading aid, not the authors’ abstract. Use the original paper for research claims. Suggest a correction.