Lamarckian evolution of convolutional neural networks

9Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Convolutional neural networks belong to the most successful image classifiers, but the adaptation of their network architecture to a particular problem is computationally expensive. We show that an evolutionary algorithm saves training time during the network architecture optimization, if learned network weights are inherited over generations by Lamarckian evolution. Experiments on typical image datasets show similar or significantly better test accuracies and improved convergence speeds compared to two different baselines without weight inheritance. On CIFAR-10 and CIFAR-100 a 75% improvement in data efficiency is observed.

Cite

CITATION STYLE

APA

Prellberg, J., & Kramer, O. (2018). Lamarckian evolution of convolutional neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11102 LNCS, pp. 424–435). Springer Verlag. https://doi.org/10.1007/978-3-319-99259-4_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free