{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:14:10Z","timestamp":1754482450220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_13","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"201-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["P-Mixup: Improving Generalization Performance of\u00a0Evolutionary Feature Construction with\u00a0Pessimistic Vicinal Risk Minimization"],"prefix":"10.1007","author":[{"given":"Hengzhe","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Banzhaf","sequence":"additional","affiliation":[]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10710-020-09383-4","volume":"21","author":"W La Cava","year":"2020","unstructured":"La Cava, W., Moore, J.H.: Learning feature spaces for regression with genetic programming. Genet. Program Evolvable Mach. 21, 433\u2013467 (2020)","journal-title":"Genet. Program Evolvable Mach."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s12293-018-0274-5","volume":"11","author":"L Mu\u00f1oz","year":"2019","unstructured":"Mu\u00f1oz, L., Trujillo, L., Silva, S., Castelli, M., Vanneschi, L.: Evolving multidimensional transformations for symbolic regression with M3GP. Memetic Comput. 11, 111\u2013126 (2019)","journal-title":"Memetic Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Castelli, M., Silva, S.: Measuring bloat, overfitting and functional complexity in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 877\u2013884 (2010)","DOI":"10.1145\/1830483.1830643"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TEVC.2014.2306994","volume":"19","author":"J Ni","year":"2014","unstructured":"Ni, J., Rockett, P.: Tikhonov regularization as a complexity measure in multiobjective genetic programming. IEEE Trans. Evol. Comput. 19(2), 157\u2013166 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TEVC.2018.2881392","volume":"23","author":"Q Chen","year":"2018","unstructured":"Chen, Q., Zhang, M., Xue, B.: Structural risk minimization-driven genetic programming for enhancing generalization in symbolic regression. IEEE Trans. Evol. Comput. 23(4), 703\u2013717 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"2382","DOI":"10.1109\/TCYB.2020.3004361","volume":"52","author":"Q Chen","year":"2022","unstructured":"Chen, Q., Xue, B., Zhang, M.: Rademacher complexity for enhancing the generalization of genetic programming for symbolic regression. IEEE Trans. Cybernetics 52(4), 2382\u20132395 (2022)","journal-title":"IEEE Trans. Cybernetics"},{"issue":"1","key":"13_CR7","first-page":"2285","volume":"20","author":"PL Bartlett","year":"2019","unstructured":"Bartlett, P.L., Harvey, N., Liaw, C., Mehrabian, A.: Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks. J. Mach. Learn. Res. 20(1), 2285\u20132301 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"13_CR8","unstructured":"Jiang, Y., Neyshabur, B., Mobahi, H., Krishnan, D., Bengio, S.: Fantastic generalization measures and where to find them. In: International Conference on Learning Representations (2020). https:\/\/openreview.net\/forum?id=SJgIPJBFvH"},{"key":"13_CR9","first-page":"14608","volume":"35","author":"F Pinto","year":"2022","unstructured":"Pinto, F., Yang, H., Lim, S.N., Torr, P., Dokania, P.: Using mixup as a regularizer can surprisingly improve accuracy & out-of-distribution robustness. Adv. Neural. Inf. Process. Syst. 35, 14608\u201314622 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"13_CR10","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Bengio, Y., LeCun, Y. (eds.) 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, 7\u20139 May, 2015, Conference Track Proceedings (2015) http:\/\/arxiv.org\/abs\/1412.6572"},{"key":"13_CR11","unstructured":"Bousquet, O., Klochkov, Y., Zhivotovskiy, N.: Sharper bounds for uniformly stable algorithms. In: Conference on Learning Theory, pp. 610\u2013626. PMLR (2020)"},{"key":"13_CR12","unstructured":"Zhang, H., Cisse, M., Dauphin, Y.N., Lopez-Paz, D.: mixup: Beyond empirical risk minimization. In: International Conference on Learning Representations (2018)"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/TEVC.2021.3136667","volume":"26","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Zhou, A., Zhang, H.: An evolutionary forest for regression. IEEE Trans. Evol. Comput. 26(4), 735\u2013749 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhou, A., Chen, Q., Xue, B., Zhang, M.: SR-Forest: a genetic programming based heterogeneous ensemble learning method. IEEE Trans. Evolutionary Comput. (2023)","DOI":"10.1109\/TEVC.2023.3243172"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Tuite, C., Agapitos, A., O\u2019Neill, M., Brabazon, A.: Early stopping criteria to counteract overfitting in genetic programming. In: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 203\u2013204 (2011)","DOI":"10.1145\/2001858.2001971"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.swevo.2017.11.003","volume":"39","author":"S Silva","year":"2018","unstructured":"Silva, S., Vanneschi, L., Cabral, A.I., Vasconcelos, M.J.: A semi-supervised genetic programming method for dealing with noisy labels and hidden overfitting. Swarm Evol. Comput. 39, 323\u2013338 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-37207-0_7","volume-title":"Genetic Programming","author":"I Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves, I., Silva, S.: Balancing learning and overfitting in genetic programming with interleaved sampling of training data. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.\u015e, Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 73\u201384. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37207-0_7"},{"key":"13_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114929","volume":"177","author":"L Vanneschi","year":"2021","unstructured":"Vanneschi, L., Castelli, M.: Soft target and functional complexity reduction: a hybrid regularization method for genetic programming. Expert Syst. Appl. 177, 114929 (2021)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"13_CR19","first-page":"14632","volume":"23","author":"L Carratino","year":"2022","unstructured":"Carratino, L., Ciss\u00e9, M., Jenatton, R., Vert, J.P.: On mixup regularization. J. Mach. Learn. Res. 23(1), 14632\u201314662 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"13_CR20","unstructured":"Sajjadi, M., Javanmardi, M., Tasdizen, T.: Regularization with stochastic transformations and perturbations for deep semi-supervised learning. Advances in Neural Information Processing Systems 29 (2016)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Yun, S., Han, D., Oh, S.J., Chun, S., Choe, J., Yoo, Y.: Cutmix: regularization strategy to train strong classifiers with localizable features. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 6023\u20136032 (2019)","DOI":"10.1109\/ICCV.2019.00612"},{"key":"13_CR22","unstructured":"Hendrycks, D., Mu, N., Cubuk, E.D., Zoph, B., Gilmer, J., Lakshminarayanan, B.: Augmix: a simple data processing method to improve robustness and uncertainty. In: International Conference on Learning Representations (2019)"},{"issue":"5","key":"13_CR23","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/TEVC.2019.2890858","volume":"23","author":"J Su","year":"2019","unstructured":"Su, J., Vargas, D.V., Sakurai, K.: One pixel attack for fooling deep neural networks. IEEE Trans. Evol. Comput. 23(5), 828\u2013841 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2015.02.043","volume":"31","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Rockett, P.I.: The use of vicinal-risk minimization for training decision trees. Appl. Soft Comput. 31, 185\u2013195 (2015)","journal-title":"Appl. Soft Comput."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-014-9222-4","volume":"16","author":"J Ni","year":"2015","unstructured":"Ni, J., Rockett, P.: Training genetic programming classifiers by vicinal-risk minimization. Genet. Program Evolvable Mach. 16, 3\u201325 (2015)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TEVC.2011.2166158","volume":"16","author":"K Neshatian","year":"2012","unstructured":"Neshatian, K., Zhang, M., Andreae, P.: A filter approach to multiple feature construction for symbolic learning classifiers using genetic programming. IEEE Trans. Evol. Comput. 16(5), 645\u2013661 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101285","volume":"78","author":"J Ma","year":"2023","unstructured":"Ma, J., Gao, X., Li, Y.: Multi-generation multi-criteria feature construction using genetic programming. Swarm Evol. Comput. 78, 101285 (2023)","journal-title":"Swarm Evol. Comput."},{"key":"13_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100640","volume":"53","author":"M Virgolin","year":"2020","unstructured":"Virgolin, M., Alderliesten, T., Bosman, P.A.: On explaining machine learning models by evolving crucial and compact features. Swarm Evol. Comput. 53, 100640 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, Q., Xue, B., Zhang, M.: Shapley value based feature selection to improve generalization of genetic programming for high-dimensional symbolic regression. In: Australasian Conference on Data Science and Machine Learning, pp. 163\u2013176. Springer (2023)","DOI":"10.1007\/978-981-99-8696-5_12"},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1162\/evco_a_00224","volume":"27","author":"W La Cava","year":"2019","unstructured":"La Cava, W., Helmuth, T., Spector, L., Moore, J.H.: A probabilistic and multi-objective analysis of lexicase selection and $$\\varepsilon $$-lexicase selection. Evol. Comput. 27(3), 377\u2013402 (2019)","journal-title":"Evol. Comput."},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR32","first-page":"3361","volume":"35","author":"H Yao","year":"2022","unstructured":"Yao, H., Wang, Y., Zhang, L., Zou, J.Y., Finn, C.: C-mixup: improving generalization in regression. Adv. Neural. Inf. Process. Syst. 35, 3361\u20133376 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13040-017-0154-4","volume":"10","author":"RS Olson","year":"2017","unstructured":"Olson, R.S., La Cava, W., Orzechowski, P., Urbanowicz, R.J., Moore, J.H.: Pmlb: a large benchmark suite for machine learning evaluation and comparison. BioData Mining 10, 1\u201313 (2017)","journal-title":"BioData Mining"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1162\/evco.1995.3.1.17","volume":"3","author":"BT Zhang","year":"1995","unstructured":"Zhang, B.T., M\u00fchlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evol. Comput. 3(1), 17\u201338 (1995)","journal-title":"Evol. Comput."},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Chen, Q., Xue, B., Zhang, M.: Improving symbolic regression based on correlation between residuals and variables. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 922\u2013930 (2020)","DOI":"10.1145\/3377930.3390161"},{"issue":"6","key":"13_CR36","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TEVC.2016.2564158","volume":"20","author":"WY Chiu","year":"2016","unstructured":"Chiu, W.Y., Yen, G.G., Juan, T.K.: Minimum manhattan distance approach to multiple criteria decision making in multiobjective optimization problems. IEEE Trans. Evol. Comput. 20(6), 972\u2013985 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"13_CR37","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/TEVC.2012.2195319","volume":"17","author":"J Ni","year":"2012","unstructured":"Ni, J., Drieberg, R.H., Rockett, P.I.: The use of an analytic quotient operator in genetic programming. IEEE Trans. Evol. Comput. 17(1), 146\u2013152 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-99259-4_25","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"AGC de S\u00e1","year":"2018","unstructured":"de S\u00e1, A.G.C., Freitas, A.A., Pappa, G.L.: Automated selection and configuration of multi-label classification algorithms with grammar-based genetic programming. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 308\u2013320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_25"},{"issue":"1","key":"13_CR39","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10710-020-09391-4","volume":"22","author":"M Nicolau","year":"2021","unstructured":"Nicolau, M., Agapitos, A.: Choosing function sets with better generalisation performance for symbolic regression models. Genet. Program Evolvable Mach. 22(1), 73\u2013100 (2021)","journal-title":"Genet. Program Evolvable Mach."},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-45823-6_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"TH Chu","year":"2016","unstructured":"Chu, T.H., Nguyen, Q.U., O\u2019Neill, M.: Tournament selection based on statistical test in genetic programming. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 303\u2013312. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_28"},{"issue":"2","key":"13_CR41","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10710-023-09461-3","volume":"24","author":"FO de Fran\u00e7a","year":"2023","unstructured":"de Fran\u00e7a, F.O.: Alleviating overfitting in transformation-interaction-rational symbolic regression with multi-objective optimization. Genet. Program Evolvable Mach. 24(2), 13 (2023)","journal-title":"Genet. Program Evolvable Mach."},{"key":"13_CR42","first-page":"24912","volume":"34","author":"T Mundhenk","year":"2021","unstructured":"Mundhenk, T., Landajuela, M., Glatt, R., Santiago, C.P., Petersen, B.K., et al.: Symbolic regression via deep reinforcement learning enhanced genetic programming seeding. Adv. Neural. Inf. Process. Syst. 34, 24912\u201324923 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"13_CR43","first-page":"10269","volume":"35","author":"PA Kamienny","year":"2022","unstructured":"Kamienny, P.A., d\u2019Ascoli, S., Lample, G., Charton, F.: End-to-end symbolic regression with transformers. Adv. Neural. Inf. Process. Syst. 35, 10269\u201310281 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:04:10Z","timestamp":1725649450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}