2026-09-18T19:02:41Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1230342026-06-06T00:56:08Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Una-May O'Reilly and Erik Hemberg.
Kelly, Jonathan Gregory.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-11-22T00:03:31Z
2019-11-22T00:03:31Z
2019
2019
https://hdl.handle.net/1721.1/123034
1127650166
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 65-68).
Low population diversity is recognized as a factor in premature convergence of evolutionary algorithms. We investigate program synthesis performance via grammatical evolution using novelty search -- substituting the conventional search objective -- based on synthesis quality, with a novelty objective. This prompts us to introduce a new selection method named knobelty which parametrically balances exploration and exploitation. We also recognize that programmers solve coding problems with the support of both programming and problem specfic knowledge. We attempt to transfer insights from such human expertise to genetic programming (GP) for solving automatic program synthesis. We draw upon manual and non-GP Artificial Intelligence methods to extract knowledge from synthesis problem definitions to guide the construction of the grammar that Grammatical Evolution uses and to supplement its fitness function. Additionally, we investigate the compounding impact of this knowledge and novelty search. The resulting approaches exhibit improvements in accuracy on a majority of problems in the field's benchmark suite of program synthesis problems.
by Jonathan Gregory Kelly.
M.Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
68 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Investigating genetic programming with novelty and domain knowledge for program synthesis
Thesis
application/pdf
2019-11-22T00:03:30Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e3348b10-dbbd-4728-8a6f-acfc03933b09">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Investigating genetic programming with novelty and domain knowledge for program synthesis</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Kelly, Jonathan Gregory.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Low population diversity is recognized as a factor in premature convergence of evolutionary algorithms. We investigate program synthesis performance via grammatical evolution using novelty search -- substituting the conventional search objective -- based on synthesis quality, with a novelty objective. This prompts us to introduce a new selection method named knobelty which parametrically balances exploration and exploitation. We also recognize that programmers solve coding problems with the support of both programming and problem specfic knowledge. We attempt to transfer insights from such human expertise to genetic programming (GP) for solving automatic program synthesis. We draw upon manual and non-GP Artificial Intelligence methods to extract knowledge from synthesis problem definitions to guide the construction of the grammar that Grammatical Evolution uses and to supplement its fitness function. Additionally, we investigate the compounding impact of this knowledge and novelty search. The resulting approaches exhibit improvements in accuracy on a majority of problems in the field's benchmark suite of program synthesis problems.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>