This article proposes a context-free grammar to be used in grammar-guided genetic programming systems to automatically design feed-forward neural architectures. This grammar has three important features. The sentences that belong to the grammar are binary strings that directly encode all the valid neural architectures only. This rules out the appearance of illegal points in the search space. Second, the grammar has the property of being ambiguous and semantically redundant. Therefore, there are alternative ways of reaching the optimum. Third, the grammar starts by generating small networks. This way it can efficiently adapt to the complexity of the problem to be solved. From the results, it is clear that these three properties are beneficial to the convergence process of the grammar-guided genetic programming system. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Couchet, J., Manrique, D., & Porras, L. (2007). Grammar-guided neural architecture evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 437–446). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_44
Mendeley helps you to discover research relevant for your work.