{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:31:51Z","timestamp":1770748311444,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010661","name":"EC | Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["713010"],"award-info":[{"award-number":["713010"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"EC | Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["713010"],"award-info":[{"award-number":["713010"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"EC | Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["640554"],"award-info":[{"award-number":["640554"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["430054590"],"award-info":[{"award-number":["430054590"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-020-00255-1","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T17:05:38Z","timestamp":1605546338000},"page":"753-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Evolutionary training and abstraction yields algorithmic generalization of neural computers"],"prefix":"10.1038","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1363-7970","authenticated-orcid":false,"given":"Daniel","family":"Tanneberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Rueckert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"255_CR1","first-page":"1633","volume":"10","author":"ME Taylor","year":"2009","unstructured":"Taylor, M. E. & Stone, P. Transfer learning for reinforcement learning domains: a survey. J. Mach. Learn. Res. 10, 1633\u20131685 (2009).","journal-title":"J. Mach. Learn. Res."},{"key":"255_CR2","unstructured":"Silver, D. L., Yang, Q. & Li, L. Lifelong machine learning systems: beyond learning algorithms. In 2013 AAAI Spring Symposium: Lifelong Machine Learning Vol. 13, 49\u201355 (AAAI, 2013)."},{"key":"255_CR3","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-016-0043-6","volume":"3","author":"K Weiss","year":"2016","unstructured":"Weiss, K., Khoshgoftaar, T. M. & Wang, D. A survey of transfer learning. J. Big Data 3, 9 (2016).","journal-title":"J. Big Data"},{"key":"255_CR4","doi-asserted-by":"crossref","unstructured":"Parisi, G. I., Kemker, R., Part, J. L., Kanan, C. & Wermter, S. Continual lifelong learning with neural networks: a review. Neural Networks 113, 54\u201371 (2019).","DOI":"10.1016\/j.neunet.2019.01.012"},{"key":"255_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber, J. Deep learning in neural networks: an overview. Neural Networks 61, 85\u2013117 (2015).","journal-title":"Neural Networks"},{"key":"255_CR6","doi-asserted-by":"publisher","first-page":"529\u2013533","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V. et al. Human-level control through deep reinforcement learning. Nature 518, 529\u2013533 (2015).","journal-title":"Nature"},{"key":"255_CR7","doi-asserted-by":"publisher","first-page":"484\u2013489","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D. et al. Mastering the game of Go with deep neural networks and tree search. Nature 529, 484\u2013489 (2016).","journal-title":"Nature"},{"key":"255_CR8","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10618-019-00619-1","volume":"33","author":"HI Fawaz","year":"2019","unstructured":"Fawaz, H. I., Forestier, G., Weber, J., Idoumghar, L. & Muller, P.-A. Deep learning for time series classification: a review. Data Min. Knowl. Discov. 33, 917\u2013963 (2019).","journal-title":"Data Min. Knowl. Discov."},{"key":"255_CR9","doi-asserted-by":"crossref","unstructured":"Botvinick, M. et al. Reinforcement learning, fast and slow. Trends Cogn. Sci. 23, 408\u2013422 (2019).","DOI":"10.1016\/j.tics.2019.02.006"},{"key":"255_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s11263-019-01247-4","volume":"128","author":"L Liu","year":"2020","unstructured":"Liu, L. et al. Deep learning for generic object detection: a survey. Int. J. Compu. Vis. 128, 261\u2013318 (2020).","journal-title":"Int. J. Compu. Vis."},{"key":"255_CR11","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1126\/science.1192788","volume":"331","author":"JB Tenenbaum","year":"2011","unstructured":"Tenenbaum, J. B., Kemp, C., Griffiths, T. L. & Goodman, N. D. How to grow a mind: statistics, structure, and abstraction. Science 331, 1279\u20131285 (2011).","journal-title":"Science"},{"key":"255_CR12","doi-asserted-by":"crossref","unstructured":"Lake, B. M., Ullman, T. D., Tenenbaum, J. B. & Gershman, S. J. Building machines that learn and think like people. Behav. Brain Sci. 40, e253 (2017).","DOI":"10.1017\/S0140525X16001837"},{"key":"255_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cobeha.2018.11.005","volume":"29","author":"G Konidaris","year":"2019","unstructured":"Konidaris, G. On the necessity of abstraction. Curr. Opin. Behav. Sci. 29, 1\u20137 (2019).","journal-title":"Curr. Opin. Behav. Sci."},{"key":"255_CR14","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L. & Stein, C. Introduction to Algorithms (MIT Press, 2009)."},{"key":"255_CR15","unstructured":"Das, S., Giles, C. L. & Sun, G.-Z. Learning context-free grammars: capabilities and limitations of a recurrent neural network with an external stack memory. In Proc. 14th Anuual Conference of the Cognitive Science Society 791\u2013795 (The Cognitive Science Society, 1992)."},{"key":"255_CR16","unstructured":"Mozer, M. C. & Das, S. A connectionist symbol manipulator that discovers the structure of context-free languages. In Advances in Neural Information Processing Systems 863\u2013870 (1993)."},{"key":"255_CR17","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/72.279194","volume":"5","author":"Z Zeng","year":"1994","unstructured":"Zeng, Z., Goodman, R. M. & Smyth, P. Discrete recurrent neural networks for grammatical inference. IEEE Trans. Neural Netw. Learn. Syst. 5, 320\u2013330 (1994).","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"255_CR18","unstructured":"Graves, A., Wayne, G. & Danihelka, I. Neural turing machines. Preprint at https:\/\/arxiv.org\/abs\/1410.5401 (2014)."},{"key":"255_CR19","unstructured":"Joulin, A. & Mikolov, T. Inferring algorithmic patterns with stack-augmented recurrent nets. In Advances in Neural Information Processing Systems 190\u2013198 (2015)."},{"key":"255_CR20","doi-asserted-by":"publisher","first-page":"471\u2013476","DOI":"10.1038\/nature20101","volume":"538","author":"A Graves","year":"2016","unstructured":"Graves, A. et al. Hybrid computing using a neural network with dynamic external memory. Nature 538, 471\u2013476 (2016).","journal-title":"Nature"},{"key":"255_CR21","unstructured":"Neelakantan, A., Le, Q. V. & Sutskever, I. Neural programmer: inducing latent programs with gradient descent. In International Conference on Learning Representations (2016)."},{"key":"255_CR22","unstructured":"Kaiser, \u0141. & Sutskever, I. Neural GPUs learn algorithms. International Conference on Learning Representations (2016)."},{"key":"255_CR23","unstructured":"Zaremba, W., Mikolov, T., Joulin, A. & Fergus, R. Learning simple algorithms from examples. In International Conference on Machine Learning, 421\u2013429 (2016)."},{"key":"255_CR24","doi-asserted-by":"crossref","unstructured":"Greve, R. B., Jacobsen, E. J. & Risi, S. Evolving neural turing machines for reward-based learning. In Proceedings of the Genetic and Evolutionary Computation Conference 2016, 117\u2013124 (ACM, 2016).","DOI":"10.1145\/2908812.2908930"},{"key":"255_CR25","unstructured":"Trask, A. et al. Neural arithmetic logic units. In Advances in Neural Information Processing Systems 8035\u20138044 (2018)."},{"key":"255_CR26","unstructured":"Madsen, A. & Johansen, A. R. Neural arithmetic units. In International Conference on Learning Representations (2020)."},{"key":"255_CR27","unstructured":"Le, H., Tran, T. & Venkatesh, S. Neural stored-program memory. In International Conference on Learning Representations (2020)."},{"key":"255_CR28","unstructured":"Reed, S. & De Freitas, N. Neural programmer-interpreters. International Conference on Learning Representations (2016)."},{"key":"255_CR29","unstructured":"Kurach, K., Andrychowicz, M. & Sutskever, I. Neural random-access machines. International Conference on Learning Representations (2016)."},{"key":"255_CR30","unstructured":"Cai, J., Shin, R. & Song, D. Making neural programming architectures generalize via recursion. International Conference on Learning Representations (2017)."},{"key":"255_CR31","unstructured":"Dong, H. et al. Neural logic machines. In International Conference on Learning Representations (2019)."},{"key":"255_CR32","unstructured":"Velickovic, P., Ying, R., Padovano, M., Hadsell, R. & Blundell, C. Neural execution of graph algorithms. In International Conference on Learning Representations (2020)."},{"key":"255_CR33","unstructured":"Sukhbaatar, S., Weston, J., Fergus, R. et al. End-to-end memory networks. In Advances in Neural Information Processing Systems, 2440\u20132448 (2015)."},{"key":"255_CR34","unstructured":"Weston, J., Chopra, S. & Bordes, A. Memory networks. In International Conference on Learning Representations (2015)."},{"key":"255_CR35","unstructured":"Grefenstette, E., Hermann, K. M., Suleyman, M. & Blunsom, P. Learning to transduce with unbounded memory. In Advances in Neural Information Processing Systems 1828\u20131836 (2015)."},{"key":"255_CR36","unstructured":"Kumar, A. et al. Ask me anything: dynamic memory networks for natural language processing. In International Conference on Machine Learning 1378\u20131387 (2016)."},{"key":"255_CR37","unstructured":"Wayne, G. et al. Unsupervised predictive memory in a goal-directed agent. Preprint at https:\/\/arxiv.org\/abs\/1803.10760 (2018)."},{"key":"255_CR38","doi-asserted-by":"crossref","unstructured":"Merrild, J., Rasmussen, M. A. & Risi, S. HyperNTM: evolving scalable neural turing machines through HyperNEAT. In International Conference on the Applications of Evolutionary Computation 750\u2013766 (Springer, 2018).","DOI":"10.1007\/978-3-319-77538-8_50"},{"key":"255_CR39","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1162\/evco_a_00239","volume":"27","author":"S Khadka","year":"2019","unstructured":"Khadka, S., Chung, J. J. & Tumer, K. Neuroevolution of a modular memory-augmented neural network for deep memory problems. Evol. Comput. 27, 639\u2013664 (2019).","journal-title":"Evol. Comput."},{"key":"255_CR40","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Louradour, J., Collobert, R. & Weston, J. Curriculum learning. In International Conference on Machine Learning 41\u201348 (ACM, 2009).","DOI":"10.1145\/1553374.1553380"},{"key":"255_CR41","first-page":"949","volume":"15","author":"D Wierstra","year":"2014","unstructured":"Wierstra, D. et al. Natural evolution strategies. J. Mach. Learn. Res. 15, 949\u2013980 (2014).","journal-title":"J. Mach. Learn. Res."},{"key":"255_CR42","unstructured":"Tanneberg, D., Rueckert, E. & Peters, J. Learning algorithmic solutions to symbolic planning tasks with a neural computer architecture. Preprint at https:\/\/arxiv.org\/abs\/1911.00926 (2019)."},{"key":"255_CR43","first-page":"6","volume":"1","author":"P-Y Oudeyer","year":"2009","unstructured":"Oudeyer, P.-Y. & Kaplan, F. What is intrinsic motivation? A typology of computational approaches. Front. Neurorobotics 1, 6 (2009).","journal-title":"Front. Neurorobotics"},{"key":"255_CR44","doi-asserted-by":"crossref","unstructured":"Baldassarre, G. & Mirolli, M. Intrinsically motivated learning systems: an overview. In Intrinsically Motivated Learning in Natural and Artificial Systems 1\u201314 (Springer, 2013).","DOI":"10.1007\/978-3-642-32375-1_1"},{"key":"255_CR45","unstructured":"Mania, H., Guy, A. & Recht, B. Simple random search of static linear policies is competitive for reinforcement learning. In Advances in Neural Information Processing Systems 1803\u20131812 (2018)."},{"key":"255_CR46","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/106365602320169811","volume":"10","author":"KO Stanley","year":"2002","unstructured":"Stanley, K. O. & Miikkulainen, R. Evolving neural networks through augmenting topologies. Evol. Comput. 10, 99\u2013127 (2002).","journal-title":"Evol. Comput."},{"key":"255_CR47","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S. & Sutskever, I. Evolution strategies as a scalable alternative to reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/1703.03864 (2017)."},{"key":"255_CR48","unstructured":"Krogh, A. & Hertz, J. A. A simple weight decay can improve generalization. In Advances in Neural Information Processing Systems 950\u2013957 (1992)."},{"key":"255_CR49","unstructured":"Conti, E. et al. Improving exploration in evolution strategies for deep reinforcement learning via a population of novelty-seeking agents. In Advances in Neural Information Processing Systems 5027\u20135038 (2018)."},{"key":"255_CR50","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y. & Schapire, R. E. A decision-theoretic generalization of online learning and an application to boosting. Journal Comput. Syst. Sci. 55, 119\u2013139 (1997).","journal-title":"Journal Comput. Syst. Sci."},{"key":"255_CR51","first-page":"293","volume":"8","author":"L-J Lin","year":"1992","unstructured":"Lin, L.-J. Self-improving reactive agents based on reinforcement learning, planning and teaching. Mach. Learn. 8, 293\u2013321 (1992).","journal-title":"Mach. Learn."},{"key":"255_CR52","doi-asserted-by":"publisher","unstructured":"Tanneberg, D. The Neural Harvard Computer (Code Ocean, accessed 25 September 2020); https:\/\/doi.org\/10.24433\/CO.6921369.v1.","DOI":"10.24433\/CO.6921369.v1"}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-020-00255-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-020-00255-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-020-00255-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T04:08:05Z","timestamp":1670386085000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-020-00255-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":52,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1038\/s42256-020-00255-1","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"15 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}