Skip to main content
SpringerLink
Log in

Getting a Head Start on Program Synthesis with Genetic Programming

  • Conference paper
  • First Online:
Book cover Genetic Programming (EuroGP 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12691))

Included in the following conference series:

Abstract

We explore how to give Genetic Programming (GP) a head start to synthesize a programming problem. Our method uses a related problem and introduces a schedule that directs GP to solve the related problem first either fully or to some extent first, or at the same time. In addition, if the related problem’s solutions are written by students or evolved by GP, we explore the extent to which initializing the GP population with some of these solutions provides a head start. We find that having a population solve one programming problem before working to solve a related programming problem helps to a greater extent as the targeted problems and the intermediate problems themselves are selected to be more challenging.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agapitos, A., Lucas, S.M.: Learning recursive functions with object oriented genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 166–177. Springer, Heidelberg (2006). https://doi.org/10.1007/11729976_15

    Chapter  Google Scholar 

  2. Arcuri, A., White, D.R., Clark, J., Yao, X.: Multi-objective improvement of software using co-evolution and smart seeding. In: Li, X., et al. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 61–70. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89694-4_7

    Chapter  Google Scholar 

  3. Bajwa, A., Bell, A., Hemberg, E., O’Reilly, U.M.: Analyzing student code trajectories in an introductory programming MOOC. In: 2019 IEEE Learning With MOOCS (LWMOOCS), pp. 53–58. IEEE (2019)

    Google Scholar 

  4. Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 41–48 (2009)

    Google Scholar 

  5. Bladek, I., Krawiec, K.: Simultaneous synthesis of multiple functions using genetic programming with scaffolding. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, pp. 97–98 (2016)

    Google Scholar 

  6. Dempsey, I., O’Neill, M., Brabazon, A.: Foundations in Grammatical Evolution for Dynamic Environments, vol. 194. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00314-1

    Book  Google Scholar 

  7. Fenton, M., McDermott, J., Fagan, D., Forstenlechner, S., Hemberg, E., O’Neill, M.: PonyGE2: grammatical evolution in Python. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1194–1201 (2017)

    Google Scholar 

  8. Gerules, G., Janikow, C.: A survey of modularity in genetic programming. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 5034–5043. IEEE (2016)

    Google Scholar 

  9. Helmuth, T., Pantridge, E., Woolson, G., Spector, L.: Transfer learning of genetic programming instruction sets. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, pp. 241–242 (2020)

    Google Scholar 

  10. Helmuth, T., Spector, L.: Detailed problem descriptions for general program synthesis benchmark suite. School of Computer Science, University of Massachusetts Amherst, Technical report (2015)

    Google Scholar 

  11. Helmuth, T., Spector, L.: General program synthesis benchmark suite. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1039–1046. ACM (2015)

    Google Scholar 

  12. Hemberg, E., Kelly, J., O’Reilly, U.M.: On domain knowledge and novelty to improve program synthesis performance with grammatical evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1039–1046 (2019)

    Google Scholar 

  13. Hoang, T.H., Essam, D., McKay, R.I.B., Hoai, N.X.: Developmental evaluation in genetic programming: the TAG-based frame work. Int. J. Knowl.-Based Intell. Eng. Syst. 12(1), 69–82 (2008). https://doi.org/10.3233/KES-2008-12106. http://content.iospress.com/articles/international-journal-of-knowledge-based-and-intelligent-engineering-systems/kes00142

    Article  Google Scholar 

  14. Jaśkowski, W., Krawiec, K., Wieloch, B.: Multitask visual learning using genetic programming. Evol. Comput. 16(4), 439–459 (2008)

    Article  Google Scholar 

  15. Kelly, J., Hemberg, E., O’Reilly, U.-M.: Improving genetic programming with novel exploration - exploitation control. In: Sekanina, L., Hu, T., Lourenço, N., Richter, H., García-Sánchez, P. (eds.) EuroGP 2019. LNCS, vol. 11451, pp. 64–80. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16670-0_5

    Chapter  Google Scholar 

  16. Koza, J.R.: Evolution of subsumption using genetic programming. In: Proceedings of the First European Conference on Artificial Life, pp. 110–119 (1992)

    Google Scholar 

  17. Krawiec, K.: Behavioral Program Synthesis with Genetic Programming, vol. 618. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-27565-9

    Book  Google Scholar 

  18. Krawiec, K., Wieloch, B.: Functional modularity for genetic programming. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 995–1002 (2009)

    Google Scholar 

  19. Krawiec, K., Wieloch, B.: Automatic generation and exploitation of related problems in genetic programming. In: IEEE Congress on Evolutionary Computation, pp. 1–8. IEEE (2010)

    Google Scholar 

  20. Langdon, W.B., Nordin, J.P.: Seeding genetic programming populations. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 304–315. Springer, Heidelberg (2000). https://doi.org/10.1007/978-3-540-46239-2_23

    Chapter  Google Scholar 

  21. Lopez, U., Trujillo, L., Silva, S., Vanneschi, L., Legrand, P.: Unlabeled multi-target regression with genetic programming. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 976–984 (2020)

    Google Scholar 

  22. Lucas, S.M.: Exploiting reflection in object oriented genetic programming. In: Keijzer, M., O’Reilly, U.-M., Lucas, S., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 369–378. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24650-3_35

    Chapter  Google Scholar 

  23. Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–96. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0055930

    Chapter  Google Scholar 

  24. Ryan, C., Keijzer, M., Cattolico, M.: Favourable biasing of function sets using run transferable libraries. In: O’Reilly, U.M., Yu, T., Riolo, R., Worzel, B. (eds.) Genetic Programming Theory and Practice II. Genetic Programming, pp. 103–120. Springer, Boston (2005). https://doi.org/10.1007/0-387-23254-0_7

    Chapter  Google Scholar 

  25. Sasanka, R., Krommydas, K.: An evolutionary framework for automatic and guided discovery of algorithms. arXiv preprint arXiv:1904.02830 (2019)

  26. Scott, E.O., De Jong, K.A.: Automating knowledge transfer with multi-task optimization. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2252–2259. IEEE (2019)

    Google Scholar 

  27. Soderlund, J., Vickers, D., Blair, A.: Parallel hierarchical evolution of string library functions. In: Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 281–291. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45823-6_26

    Chapter  Google Scholar 

  28. Tanev, I., Kuyucu, T., Shimohara, K.: GP-induced and explicit bloating of the seeds in incremental GP improves evolutionary success. Genet. Program. Evolvable Mach. 15(1), 37–60 (2014). https://doi.org/10.1007/s10710-013-9192-y

    Article  Google Scholar 

  29. Thorhauer, A., Rothlauf, F.: On the locality of standard search operators in grammatical evolution. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 465–475. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10762-2_46

    Chapter  Google Scholar 

  30. Thrun, S.: Explanation-Based Neural Network Learning. Springer, Boston (1996). https://doi.org/10.1007/978-1-4613-1381-6

    Book  MATH  Google Scholar 

  31. Wan, M., Weise, T., Tang, K.: Novel loop structures and the evolution of mathematical algorithms. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 49–60. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20407-4_5

    Chapter  Google Scholar 

  32. Henrik Westerberg, C., Levine, J.: Investigation of different seeding strategies in a genetic planner. In: Boers, E.J.W. (ed.) EvoWorkshops 2001. LNCS, vol. 2037, pp. 505–514. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45365-2_52

    Chapter  MATH  Google Scholar 

  33. Yu, T., Clack, C.: Recursion, lambda-abstractions and genetic programming. In: Poli, R., Langdon, W.B., Schoenauer, M., Fogarty, T., Banzhaf, W. (eds.) Late Breaking Papers at EuroGP 1998: the First European Workshop on Genetic Programming, pp. 26–30. CSRP-98-10, The University of Birmingham, UK, Paris, France, 14–15 April 1998

    Google Scholar 

  34. Zheng, X., Qin, A., Gong, M., Zhou, D.: Self-regulated evolutionary multi-task optimization. IEEE Trans. Evol. Comput. 24, 16–28 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT, Cambridge, USA

    Jordan Wick, Erik Hemberg & Una-May O’Reilly

Authors
  1. Jordan Wick
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik Hemberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Una-May O’Reilly
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erik Hemberg .

Editor information

Editors and Affiliations

  1. Queen’s University, Kingston, ON, Canada

    Ting Hu

  2. University of Coimbra, Coimbra, Portugal

    Nuno Lourenço

  3. University of Trieste, Trieste, Italy

    Eric Medvet

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wick, J., Hemberg, E., O’Reilly, UM. (2021). Getting a Head Start on Program Synthesis with Genetic Programming. In: Hu, T., Lourenço, N., Medvet, E. (eds) Genetic Programming. EuroGP 2021. Lecture Notes in Computer Science(), vol 12691. Springer, Cham. https://doi.org/10.1007/978-3-030-72812-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-72812-0_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-72811-3

  • Online ISBN: 978-3-030-72812-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation