Learnable Embeddings of Program Spaces

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{krawiec:2011:EuroGP,

• author = "Krzysztof Krawiec",
• title = "Learnable Embeddings of Program Spaces",
• booktitle = "Proceedings of the 14th European Conference on Genetic Programming, EuroGP 2011",
• year = "2011",
• month = "27-29 " # apr,
• editor = "Sara Silva and James A. Foster and Miguel Nicolau and Mario Giacobini and Penousal Machado",
• series = "LNCS",
• volume = "6621",
• publisher = "Springer Verlag",
• address = "Turin, Italy",
• pages = "166--177",
• organisation = "EvoStar",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-642-20406-7",
• DOI = "doi:10.1007/978-3-642-20407-4_15",
• abstract = "We consider a class of adaptive, globally-operating, semantic-based embeddings of programs into discrete multidimensional spaces termed prespaces. In the proposed formulation, the original space of programs and its prespace are bound with a learnable mapping, where the process of learning is aimed at improving the overall locality of the new representation with respect to program semantics. To learn the mapping, which is formally a permutation of program locations in the prespace, we propose two algorithms: simple greedy heuristics and an evolutionary algorithm. To guide the learning process, we use a new definition of semantic locality. In an experimental illustration concerning four symbolic regression domains, we demonstrate that an evolutionary algorithm is able to improve the embedding designed by means of greedy search, and that the learnt prespaces usually offer better search performance than the original program space.",
• notes = "Part of \cite{Silva:2011:GP} EuroGP'2011 held in conjunction with EvoCOP2011 EvoBIO2011 and EvoApplications2011",

}

Genetic Programming entries for Krzysztof Krawiec

Citations