Scopus; WoS

Genetic Programming–A Preliminary Study of Knowledge Transfer in Mutation

Năm XB 2023 Tạp chí / Hội thảo Lecture Notes in Networks and Systems Volume 847 LNNS DOI / Link https://doi.org/10.1007/978-3-031-49529-8_28 ↗

Tác giả

Tóm tắt

In this research, we introduce two new variations of Genetic Programming (GP) that reusing transferred knowledge in the mutation operator. They are called FullTree.CM_1 and FullTree.CM_2 . Chromosomes of the best individuals learned from previous source problems will be reused as sub-trees of children generated by mutation while training GP for the target problem. FullTree.CM_1 takes k% good individuals in the last generation of a previous learned sub-task (source problem) into a POOL for reusing in the mutating process while FullTree.CM_2 re-uses k% good solutions from all previous learned sub-tasks. In order to analyzing the effectiveness of these schemes, we use three evaluation criteria including errors on training data, errors on testing data, and size of the learned solutions. Experimental results show that our schemes perform better than other previous transfer GP on the most of tested problem families with all of these three evaluation criteria. This is very promising and motivating for further research to improve GP based on transfer mutation.

Tài liệu tham khảo

[1] Pan, S.J., Yang, Q.: A survey on transfer learning. IEEE Trans. Knowl. Data Eng. 22(10), 1345–1359 (2010)

[2] Taylor, M.E., Stone, P.: Cross-domain transfer for reinforcement learning. In: 24th International Proceedings on Machine learning, pp. 879–886 (2007)

[3] Ramon, J., Driessens, K., Croonenborghs, T.: Transfer learning in reinforcement learning problems through partial policy recycling. In: 18th International Proceedings on Machine Learning, pp. 699–707. Springer, Heidelberg (2007)

[4] Dinh, T.T.H., Chu, T.H., Nguyen, Q.U.: Transfer learning in genetic programming. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1145–1151 (2015)

[5] Uy, N.Q., et al.: Semantic-based subtree crossover applied to dynamic problems. In: 3th International Conference on Knowledge and Systems Engineering, pp. 78–84 (2011)

[6] Hoang, T.H., et al.: Building on success in genetic programming: adaptive variation and developmental evaluation. In: 2nd International Proceedings on Advances in Computation and Intelligence, pp. 137–146. Springer, Heidelberg (2007)

[7] O’neill, D., et al.: Common subtrees in related problems: a novel transfer learning approach for genetic programming. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1287–1294 (2017)

[8] Helmuth, T., et al.: Genetic source sensitivity and transfer learning in genetic programming. In: 32 Proceedings on Artificial Life, pp. 303–311. MIT Press, Cambridge (2020)

[9] Koza, J.R.: Genetic programming II: automatic discovery of reusable programs. MIT press (1994)

← Quay lại danh sách bài báo