{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:31Z","timestamp":1774732051790,"version":"3.50.1"},"reference-count":98,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P023991\/1"],"award-info":[{"award-number":["EP\/P023991\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Softw Eng"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Automated program repair techniques aim to aid software developers with the challenging task of fixing bugs. In heuristic-based program repair, a search space of mutated program variants is explored to find potential patches for bugs. Most commonly, every selection of a mutation operator during search is performed uniformly at random, which can generate many buggy, even uncompilable programs. Our goal is to reduce the generation of variants that do not compile or break intended functionality which waste considerable resources. In this paper, we investigate the feasibility of a reinforcement learning-based approach for the selection of mutation operators in heuristic-based program repair. Our proposed approach is programming language, granularity-level, and search strategy agnostic and allows for easy augmentation into existing heuristic-based repair tools. We conducted an extensive empirical evaluation of four operator selection techniques, two reward types, two credit assignment strategies, two integration methods, and three sets of mutation operators using 30,080 independent repair attempts. We evaluated our approach on 353 real-world bugs from the Defects4J benchmark. The reinforcement learning-based mutation operator selection results in a higher number of test-passing variants, but does not exhibit a noticeable improvement in the number of bugs patched in comparison with the baseline, uniform random selection. While reinforcement learning has been previously shown to be successful in improving the search of evolutionary algorithms, often used in heuristic-based program repair, it has yet to demonstrate such improvements when applied to this area of research.<\/jats:p>","DOI":"10.1007\/s10515-025-00501-z","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T13:09:08Z","timestamp":1742044148000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Reinforcement learning for mutation operator selection in automated program repair"],"prefix":"10.1007","volume":"32","author":[{"given":"Carol","family":"Hanna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aymeric","family":"Blot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justyna","family":"Petke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"501_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, T., Ledesma, N.R., Devanbu, P.: Synshine: Improved fixing of syntax errors. IEEE TSE (2022)","DOI":"10.1109\/TSE.2022.3212635"},{"issue":"3","key":"501_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2996355","volume":"49","author":"A Aleti","year":"2016","unstructured":"Aleti, A., Moser, I.: A systematic literature review of adaptive parameter control methods for evolutionary algorithms. ACM Comput. Surv. 49(3), 1 (2016)","journal-title":"ACM Comput. Surv."},{"key":"501_CR3","doi-asserted-by":"crossref","unstructured":"Ali, K.I., Brohi, K.: An adaptive learning automata for genetic operators allocation probabilities. FIT, pp. 55\u201359 (2013)","DOI":"10.1109\/FIT.2013.18"},{"key":"501_CR4","doi-asserted-by":"crossref","unstructured":"Anik, M.T.A., Ahmed, S.: A mixed mutation approach for evolutionary programming based on guided selection strategy. ICIEV (2013)","DOI":"10.1109\/ICIEV.2013.6572647"},{"issue":"2","key":"501_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"501_CR6","doi-asserted-by":"crossref","unstructured":"Awad, A., Hawash, A., Abdalhaq, B.: A genetic algorithm (GA) and swarm based binary decision diagram (BDD) reordering optimizer reinforced with recent operators. IEEE TEVC (2022)","DOI":"10.1109\/TEVC.2022.3170212"},{"key":"501_CR7","unstructured":"Barbosa, H.J.C., Medeiros, A.: On adaptive operator probabilities in real coded genetic algorithms. Workshop on Advances and Trends in Artificial Intelligence for Problem Solving (2000)"},{"key":"501_CR8","doi-asserted-by":"crossref","unstructured":"Bian, Z., Blot, A., Petke, J.: Refining fitness functions for search-based program repair. ICSE (2021)","DOI":"10.1109\/APR52552.2021.00008"},{"key":"501_CR9","doi-asserted-by":"crossref","unstructured":"B\u00f6hme, M., Soremekun, E.O., Chattopadhyay, S., Ugherughe, E., Zeller, A.: Where is the bug and how is it fixed? An experiment with practitioners. ESEC\/FSE, pp. 117\u2013128 (2017)","DOI":"10.1145\/3106237.3106255"},{"key":"501_CR10","unstructured":"Chen, L., Pei, Y., Pan, M., Zhang, T., Wang, Q., Furia, C.A.: Program repair with repeated learning. IEEE TSE (2022)"},{"key":"501_CR11","doi-asserted-by":"crossref","unstructured":"Connor, A., Harris, A., Cooper, N., Poshyvanyk, D.: Can we automatically fix bugs by learning edit operations? SANER, pp. 782\u2013792 (2022)","DOI":"10.1109\/SANER53432.2022.00096"},{"key":"501_CR12","doi-asserted-by":"crossref","unstructured":"Costa, L., Fialho, \u00c1., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. GECCO, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"501_CR13","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: International Conference on GA, pp. 61\u201369 (1989)"},{"key":"501_CR14","unstructured":"Defects4J: Defects4J \u2013 version 2.0.0. https:\/\/github.com\/rjust\/defects4j\/. Accessed 2rd Feb 2023 (2023)"},{"key":"501_CR15","first-page":"151","volume":"4335","author":"AE Eiben","year":"2007","unstructured":"Eiben, A.E., Horvath, M., Kowalczyk, W., Schut, M.C.: Reinforcement learning for online control of evolutionary algorithms. LNAI 4335, 151\u2013160 (2007)","journal-title":"LNAI"},{"key":"501_CR16","unstructured":"EvoSuite: Automatic Test Suite Generation for Java. https:\/\/www.evosuite.org\/. Accessed 2rd Feb 2023 (2023)"},{"key":"501_CR17","doi-asserted-by":"crossref","unstructured":"Fialho, \u00c1., Schoenauer, M., Sebag, M.: Analysis of adaptive operator selection techniques on the royal road and long K-path problems. GECCO (2009)","DOI":"10.1145\/1569901.1570009"},{"key":"501_CR18","doi-asserted-by":"crossref","unstructured":"Fialho, \u00c1., Schoenauer, M., Sebag, M.: Toward comparison-based adaptive operator selection. GECCO (2010)","DOI":"10.1145\/1830483.1830619"},{"key":"501_CR19","first-page":"176","volume":"5851","author":"\u00c1 Fialho","year":"2009","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms. LNTCS 5851, 176\u2013190 (2009)","journal-title":"LNTCS"},{"key":"501_CR20","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. GECCO, pp. 293\u2013300 (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"501_CR21","doi-asserted-by":"publisher","first-page":"4526","DOI":"10.1109\/TSE.2023.3305052","volume":"49","author":"C Geethal","year":"2023","unstructured":"Geethal, C., Bohme, M., Pham, V.T.: Human-in-the-loop automatic program repair. IEEE Trans. Softw. Eng. 49, 4526\u20134549 (2023). https:\/\/doi.org\/10.1109\/TSE.2023.3305052","journal-title":"IEEE Trans. Softw. Eng."},{"key":"501_CR22","doi-asserted-by":"crossref","unstructured":"Glickman, M.R., Glickman, M.R., Sycara, K.: Reasons for premature convergence of self-adapting mutation rates. IEEE CEC, pp. 62\u201369 (2000)","DOI":"10.1109\/CEC.2000.870276"},{"key":"501_CR23","doi-asserted-by":"crossref","unstructured":"Gopinath, D., Wang, K., Hua, J., Khurshid, S.: Repairing intricate faults in code using machine learning and path exploration. ICSME (2016)","DOI":"10.1109\/ICSME.2016.75"},{"key":"501_CR24","doi-asserted-by":"publisher","unstructured":"Guizzo, G., Blot, A., Callan, J., Petke, J., Sarro, F.: Refining fitness functions for search-based automated program repair: A case study with arja and arja-e. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12914 LNCS, pp. 159\u2013165 (2021) https:\/\/doi.org\/10.1007\/978-3-030-88106-1_12\/FIGURES\/1","DOI":"10.1007\/978-3-030-88106-1_12\/FIGURES\/1"},{"key":"501_CR25","doi-asserted-by":"crossref","unstructured":"Haraldsson, S.O., Woodward, J.R., Brownlee, A.E.I., Siggeirsdottir, K.: Fixing bugs in your sleep: how genetic improvement became an overnight success. GECCO, pp. 1513\u20131520 (2017)","DOI":"10.1145\/3067695.3082517"},{"key":"501_CR26","first-page":"23","volume":"496","author":"J Hesser","year":"1991","unstructured":"Hesser, J., M\u00e4inner, R.: Towards an optimal mutation probability for genetic algorithms. LNCS 496, 23\u201332 (1991)","journal-title":"LNCS"},{"key":"501_CR27","doi-asserted-by":"crossref","unstructured":"Hong, L., Drake, J.H., \u00d6zcan, E.: A step size based self-adaptive mutation operator for Evolutionary Programming. GECCO, pp. 1381\u20131387 (2014)","DOI":"10.1145\/2598394.2609873"},{"key":"501_CR28","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers Inc., 340 Pine Street, 6th Floor, San Francisco, CA 94104 (2004)"},{"key":"501_CR29","doi-asserted-by":"crossref","unstructured":"Jackson, D.: Mutation as a diversity enhancing mechanism in genetic programming. GECCO (2011)","DOI":"10.1145\/2001576.2001761"},{"key":"501_CR30","doi-asserted-by":"crossref","unstructured":"Ji, S., Choi, S.-M., Ko, S.-K., Kim, D., Im, H.: RepCoder: An automated program repair framework for probability-based program synthesis. ACM\/SIGAPP SAC (2022)","DOI":"10.1145\/3477314.3507083"},{"key":"501_CR31","doi-asserted-by":"crossref","unstructured":"Jiang, N., Lutellier, T., Tan, L.: Cure: Code-aware neural machine translation for automatic program repair. ICSE, pp. 1161\u20131173 (2021)","DOI":"10.1109\/ICSE43902.2021.00107"},{"key":"501_CR32","doi-asserted-by":"crossref","unstructured":"Jiang, J., Ren, L., Xiong, Y., Zhang, L.: Inferring program transformations from singular examples via big code. ASE (2019)","DOI":"10.1109\/ASE.2019.00033"},{"key":"501_CR33","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: Adaptive operator probabilities in a genetic algorithm that applies three operators. ACM SAC, pp. 233\u2013238 (1997)","DOI":"10.1145\/331697.331746"},{"key":"501_CR34","unstructured":"Julstrum, B.A.: What have you done for me lately? Adapting operator probabilities in a steady-state genetic algorithm. In: International Conference on GA, pp. 81\u201387 (1995)"},{"key":"501_CR35","doi-asserted-by":"publisher","unstructured":"Kang, S., Yoo, S.: Glad: Neural predicate synthesis to repair omission faults. In: Proceedings - International Conference on Software Engineering, pp. 320\u2013321 (2023) https:\/\/doi.org\/10.1109\/ICSE-COMPANION58688.2023.00087","DOI":"10.1109\/ICSE-COMPANION58688.2023.00087"},{"key":"501_CR36","doi-asserted-by":"crossref","unstructured":"Kim, D., Nam, J., Song, J., Kim, S.: Automatic patch generation learned from human-written patches. ICSE (2013)","DOI":"10.1109\/ICSE.2013.6606626"},{"key":"501_CR37","doi-asserted-by":"crossref","unstructured":"Kirbas, S., Windels, E., Mcbello, O., Kells, K., Pagano, M., Szalanski, R., Nowack, V., Winter, E., Counsell, S., Bowes, D., Hall, T., Haraldsson, S., Woodward, J.: On the introduction of automatic program repair in bloomberg. IEEE Software (2020)","DOI":"10.1109\/MS.2021.3071086"},{"issue":"2","key":"501_CR38","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00175355","volume":"4","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic programming as a means for programming computers by natural selection. Stat. Comput. 4(2), 87\u2013112 (1994)","journal-title":"Stat. Comput."},{"key":"501_CR39","doi-asserted-by":"crossref","unstructured":"Lajko, M., Csuvik, V., Vidacs, L.: Towards javascript program repair with generative pre-trained transformer (GPT-2). International Workshop on APR, pp. 61\u201368 (2022)","DOI":"10.1145\/3524459.3527350"},{"key":"501_CR40","unstructured":"LASER-UMASS: Artifact replication repository for the study on quality of automated program repair on real-world defects. https:\/\/github.com\/LASER-UMASS\/JavaRepair-replication-package. Accessed 2rd Feb 2023 (2020)"},{"key":"501_CR41","doi-asserted-by":"crossref","unstructured":"Le Goues, C., Pradel, M., Roychoudhury, A.: Automated program repair. Communications of the ACM (2019)","DOI":"10.1145\/3318162"},{"key":"501_CR42","doi-asserted-by":"crossref","unstructured":"Le Goues, C., Wemer, W., Forrest, S.: Representations and operators for improving evolutionary software repair. GECCO, pp. 959\u2013966 (2012)","DOI":"10.1145\/2330163.2330296"},{"issue":"1","key":"501_CR43","first-page":"54","volume":"38","author":"C Le Goues","year":"2012","unstructured":"Le Goues, C., Nguyen, T.V., Forrest, S., Weimer, W.: GenProg: A generic method for automatic software repair. IEEE TSE 38(1), 54\u201372 (2012)","journal-title":"IEEE TSE"},{"key":"501_CR44","doi-asserted-by":"crossref","unstructured":"Le, X.-B.D.: Towards efficient and effective automatic program repair. ASE (2016)","DOI":"10.1145\/2970276.2975934"},{"key":"501_CR45","first-page":"213","volume":"1","author":"XBD Le","year":"2016","unstructured":"Le, X.B.D., Lo, D., Le Goues, C.: History driven program repair. SANER 1, 213\u2013224 (2016)","journal-title":"SANER"},{"key":"501_CR46","doi-asserted-by":"crossref","unstructured":"Li, T., Meng, Y., Tang, L.: Scheduling of continuous annealing with a multi-objective differential evolution algorithm based on deep reinforcement learning. ASE (2023)","DOI":"10.1109\/TASE.2023.3244331"},{"key":"501_CR47","doi-asserted-by":"publisher","unstructured":"Liu, C., Cetin, P., Patodia, Y., Chakraborty, S., Ding, Y., Ray, B.: Automated Code Editing with Search-Generate-Modify (2024). https:\/\/doi.org\/10.1109\/TSE.2024.3376387. arXiv: 2306.06490","DOI":"10.1109\/TSE.2024.3376387"},{"key":"501_CR48","doi-asserted-by":"crossref","unstructured":"Liu, C., Lu, J., Li, G., Yuan, T., Li, L., Tan, F., Yang, J., You, L., Xue, J.: Detecting TensorFlow Program Bugs in Real-World Industrial Environment. ASE, pp. 55\u201366 (2021)","DOI":"10.1109\/ASE51524.2021.9678891"},{"key":"501_CR49","doi-asserted-by":"crossref","unstructured":"Liu, C., Yang, J., Tan, L., Hafiz, M.: R2Fix: Automatically generating bug fixes from bug reports. ICST (2013)","DOI":"10.1109\/ICST.2013.24"},{"key":"501_CR50","doi-asserted-by":"crossref","unstructured":"Marginean, A., Bader, J., Chandra, S., Harman, M., Jia, Y., Mao, K., Mols, A., Scott, A.: Sapfix: Automated end-to-end repair at scale. ICSE-SEIP (2019)","DOI":"10.1109\/ICSE-SEIP.2019.00039"},{"key":"501_CR51","doi-asserted-by":"crossref","unstructured":"Martinez, M., Monperrus, M.: ASTOR: A program repair library for Java (Demo). ISSTA, pp. 441\u2013444 (2016)","DOI":"10.1145\/2931037.2948705"},{"key":"501_CR52","doi-asserted-by":"crossref","unstructured":"Maturana, J., Fialho, \u00c1., Saubion, F., Schoenauer, M., Sebag, M.: Extreme compass and dynamic multi-armed bandits for adaptive operator selection. GEC, pp. 365\u2013372 (2009)","DOI":"10.1109\/CEC.2009.4982970"},{"key":"501_CR53","first-page":"256","volume":"5199","author":"J Maturana","year":"2008","unstructured":"Maturana, J., Saubion, F.: A compass to guide genetic algorithms. LNCS 5199, 256\u2013265 (2008)","journal-title":"LNCS"},{"key":"501_CR54","doi-asserted-by":"publisher","DOI":"10.1002\/9780470479216.CORPSY0491","author":"PE McKight","year":"2010","unstructured":"McKight, P.E., Najab, J.: Kruskal\u2013Wallis test. Corsini Encycl. Psychol. (2010). https:\/\/doi.org\/10.1002\/9780470479216.CORPSY0491","journal-title":"Corsini Encycl. Psychol."},{"key":"501_CR55","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2023.01.103","volume":"628","author":"H Moazen","year":"2023","unstructured":"Moazen, H., Molaei, S., Farzinvash, L., Sabaei, M.: PSO-ELPM: PSO with elite learning, enhanced parameter updating, and exponential mutation operator. Inf. Sci. 628, 70\u201391 (2023)","journal-title":"Inf. Sci."},{"issue":"2","key":"501_CR56","first-page":"637","volume":"48","author":"M Motwani","year":"2022","unstructured":"Motwani, M., Soto, M., Brun, Y., Just, R., Le Goues, C.: Quality of automated program repair on real-world defects. IEEE TSE 48(2), 637\u2013661 (2022)","journal-title":"IEEE TSE"},{"key":"501_CR57","doi-asserted-by":"crossref","unstructured":"Murata, T., Ishibuchi, H.: Positive and negative combination effects of crossover and mutation operators in sequencing problems. IEEE CEC, pp. 170\u2013175 (1996)","DOI":"10.1109\/ICEC.1996.542355"},{"key":"501_CR58","doi-asserted-by":"publisher","unstructured":"Parasaram, N., Barr, E.T., Mechtaev, S.: Rete: Learning namespace representation for program repair. In: Proceedings\u2014International Conference on Software Engineering, pp. 1264\u20131276 (2023) https:\/\/doi.org\/10.1109\/ICSE48619.2023.00112","DOI":"10.1109\/ICSE48619.2023.00112"},{"key":"501_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S10664-023-10344-5\/TABLES\/9","volume":"28","author":"J Petke","year":"2023","unstructured":"Petke, J., Alexander, B., Barr, E.T., Brownlee, A.E.I., Wagner, M., White, D.R.: Program transformation landscapes for automated program modification using gin. Empir. Softw. Eng. 28, 1\u201341 (2023). https:\/\/doi.org\/10.1007\/S10664-023-10344-5\/TABLES\/9","journal-title":"Empir. Softw. Eng."},{"key":"501_CR60","unstructured":"Pettinger, J.E.,  R.E.: Controlling genetic algorithms with reinforcement learning. GECCO (2002)"},{"key":"501_CR61","unstructured":"program-repair.org: Benchmarks for automated program repair. https:\/\/program-repair.org\/benchmarks.html. Accessed 2rd Feb 2023 (2023)"},{"key":"501_CR62","unstructured":"program-repair.org: Tools for automated program repair. https:\/\/program-repair.org\/tools.html. Accessed on 2rd Feb 2023 (2023)"},{"key":"501_CR63","doi-asserted-by":"crossref","unstructured":"Qi, Y., Mao, X., Lei, Y., Dai, Z., Wang, C.: The strength of random search on automated program repair. ICSE, pp. 254\u2013265 (2014)","DOI":"10.1145\/2568225.2568254"},{"key":"501_CR64","doi-asserted-by":"crossref","unstructured":"Qi, Y., Mao, X., Lei, Y.: Efficient automated program repair through fault-recorded testing prioritization. IEEE ICSM, pp. 180\u2013189 (2013)","DOI":"10.1109\/ICSM.2013.29"},{"key":"501_CR65","unstructured":"Randoop: Automatic unit test generation for Java. https:\/\/randoop.github.io\/randoop\/. Accessed 2rd Feb 2023 (2023)"},{"key":"501_CR66","first-page":"21","volume":"2","author":"NM Razali","year":"2011","unstructured":"Razali, N.M., Wah, Y.B.: Power comparisons of shapiro-wilk, kolmogorov-smirnov, lilliefors and anderson-darling tests. J. Stat. Model. Anal 2, 21\u201333 (2011)","journal-title":"J. Stat. Model. Anal"},{"key":"501_CR67","doi-asserted-by":"crossref","unstructured":"Schramm, L.: Improving performance of automatic program repair using learned heuristics. ESEC\/FSE (2017)","DOI":"10.1145\/3106237.3121281"},{"key":"501_CR68","doi-asserted-by":"crossref","unstructured":"Sharma, M., L\u00f3pez-Ib\u00e1\u00f1ez, M., Komninos, A., Kazakov, D.: Deep reinforcement learning based parameter control in differential evolution. GECCO, pp. 709\u2013717 (2019) arXiv:1905.08006","DOI":"10.1145\/3321707.3321813"},{"key":"501_CR69","doi-asserted-by":"crossref","unstructured":"Smigielska, M., Blot, A., Petke, J.: Uniform edit selection for genetic improvement: empirical analysis of mutation operator efficacy. International Workshop on GI, 1\u20138 (2021)","DOI":"10.1109\/GI52543.2021.00009"},{"key":"501_CR70","doi-asserted-by":"crossref","unstructured":"Smith, E.K., Barr, E.T., Le Goues, C., Brun, Y.: Is the cure worse than the disease? Overfitting in automated program repair. ESEC\/FSE, pp. 532\u2013543 (2015)","DOI":"10.1145\/2786805.2786825"},{"key":"501_CR71","doi-asserted-by":"publisher","unstructured":"Sobania, D., Briesch, M., Hanna, C., Petke, J.: An analysis of the automatic bug fixing performance of chatgpt. In: Proceedings - 2023 IEEE\/ACM International Workshop on Automated Program Repair, APR 2023, pp. 23\u201330 (2023) https:\/\/doi.org\/10.1109\/APR59189.2023.00012","DOI":"10.1109\/APR59189.2023.00012"},{"key":"501_CR72","doi-asserted-by":"crossref","unstructured":"Soria-Alcaraz, J.A., Ochoa, G., Carpio, M., Puga, H.: Evolvability metrics in adaptive operator selection. GECCO, pp. 1327\u20131334 (2014)","DOI":"10.1145\/2576768.2598220"},{"key":"501_CR73","doi-asserted-by":"crossref","unstructured":"Soto, M., Le Goues, C.: Using a probabilistic model to predict bug fixes. SANER 2018-March, pp. 221\u2013231 (2018)","DOI":"10.1109\/SANER.2018.8330211"},{"key":"501_CR74","doi-asserted-by":"crossref","unstructured":"Soto, M.: Improving patch quality by enhancing key components of automatic program repair. ASE, pp. 1230\u20131233 (2019)","DOI":"10.1109\/ASE.2019.00147"},{"key":"501_CR75","doi-asserted-by":"crossref","unstructured":"Stanczak, J.T., Mulawka, J.J., Verma, B.K.: Genetic algorithms with adaptive probabilities of operator selection. ICCIMA, pp. 464\u2013468 (1999)","DOI":"10.1109\/ICCIMA.1999.798575"},{"key":"501_CR76","volume-title":"Reinforcement Learning An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning An Introduction. MIT Press, Cambridge (2018)"},{"key":"501_CR77","unstructured":"Tassey, G.: The economic impacts of inadequate infrastructure for software testing. NIST (2002)"},{"key":"501_CR78","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. GECCO, pp. 1539\u20131546 (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"501_CR79","doi-asserted-by":"crossref","unstructured":"Tian, H., Liu, K., Li, Y., Kader, A., Koyuncu, A., Habib, A., Li, L., Wen, J., Klein, J., Bissyand\u00e9, T.F.: The best of both worlds: Combining learned embeddings with engineered features for accurate prediction of correct patches. ACM TOSEM 1 (2023)","DOI":"10.1145\/3576039"},{"key":"501_CR80","first-page":"461","volume":"1141","author":"A Tuson","year":"1996","unstructured":"Tuson, A., Ross, P.: Cost based operator rate adaptation: an investigation. LNCS 1141, 461\u2013469 (1996)","journal-title":"LNCS"},{"key":"501_CR81","doi-asserted-by":"crossref","unstructured":"Ullah, M.R., Chowdhury, N.S., Tawsif, F.M.: Impact of combining syntactic and semantic similarities on patch prioritization while using the insertion mutation operators. SEKE, pp. 190\u2013195 (2023)","DOI":"10.18293\/SEKE2022-047"},{"key":"501_CR82","doi-asserted-by":"crossref","unstructured":"Vafaee, F., Xiao, W., Nelson, P.C., Zhou, C.: Adaptively evolving probabilities of genetic operators. ICMLA, pp. 292\u2013299 (2008)","DOI":"10.1109\/ICMLA.2008.45"},{"key":"501_CR83","doi-asserted-by":"publisher","first-page":"100527","DOI":"10.1016\/j.ijcip.2022.100527","volume":"37","author":"M Valueian","year":"2022","unstructured":"Valueian, M., Vahidi-Asl, M., Khalilian, A.: SituRepair: incorporating machine-learning fault class prediction to inform situational multiple fault automatic program repair. Int. J. Critic. Infrastruct. Protect. 37, 100527 (2022)","journal-title":"Int. J. Critic. Infrastruct. Protect."},{"key":"501_CR84","doi-asserted-by":"crossref","unstructured":"Wei\u00df, C., Premraj, R., Zimmermann, T., Zeller, A.: How long will it take to fix this bug? MSR (2007)","DOI":"10.1109\/MSR.2007.13"},{"key":"501_CR85","doi-asserted-by":"crossref","unstructured":"Wen, M., Chen, J., Wu, R., Hao, D., Cheung, S.C.: Context-aware patch generation for better automated program repair. ICSE 2018-Janua, pp. 1\u201311 (2018)","DOI":"10.1145\/3180155.3180233"},{"key":"501_CR86","doi-asserted-by":"crossref","unstructured":"Whitacre, J.M., Pham, T.Q., Sarker, R.A.: Use of statistical outlier detection method in adaptive evolutionary algorithms. GECCO (2006)","DOI":"10.1145\/1143997.1144205"},{"key":"501_CR87","doi-asserted-by":"publisher","first-page":"107027","DOI":"10.1016\/j.infsof.2022.107027","volume":"151","author":"D Wu","year":"2022","unstructured":"Wu, D., Shen, B., Chen, Y., Jiang, H., Qiao, L.: Automatically repairing tensor shape faults in deep learning programs. Inf. Softw. Technol. 151, 107027 (2022)","journal-title":"Inf. Softw. Technol."},{"key":"501_CR88","doi-asserted-by":"publisher","unstructured":"Xia, C.S., Wei, Y., Zhang, L.: Automated program repair in the era of large pre-trained language models. In: Proceedings\u2014International Conference on Software Engineering, pp. 1482\u20131494 (2023) https:\/\/doi.org\/10.1109\/ICSE48619.2023.00129","DOI":"10.1109\/ICSE48619.2023.00129"},{"key":"501_CR89","doi-asserted-by":"crossref","unstructured":"Xia, C.S., Zhang, L.: Less training, more repairing please: Revisiting automated program repair via zero-shot learning. ESEC\/FSE, pp. 959\u2013971 (2022)","DOI":"10.1145\/3540250.3549101"},{"key":"501_CR90","first-page":"34","volume":"43","author":"J Xuan","year":"2018","unstructured":"Xuan, J., Martinez, M., Demarco, F., Cl\u00e9ment, M., Lamelas, S., Durieux, T., Berre, D.L., Monperrus, M.: Nopol: automatic repair of conditional statement bugs in java programs. IEEE TSE 43, 34\u201355 (2018)","journal-title":"IEEE TSE"},{"key":"501_CR91","doi-asserted-by":"crossref","unstructured":"Yu, Z., Martinez, M., Chen, Z., Bissyand\u00e9, T.F., Monperrus, M.: Learning the relation between code features and code transforms with structured prediction. IEEE TSE, pp. 1\u201329 (2023)","DOI":"10.1109\/TSE.2023.3275380"},{"key":"501_CR92","doi-asserted-by":"publisher","first-page":"129300","DOI":"10.1016\/J.ENERGY.2023.129300","volume":"284","author":"X Yu","year":"2023","unstructured":"Yu, X., Lu, Y.: Reinforcement learning-based multi-objective differential evolution for wind farm layout optimization. Energy 284, 129300 (2023). https:\/\/doi.org\/10.1016\/J.ENERGY.2023.129300","journal-title":"Energy"},{"key":"501_CR93","doi-asserted-by":"publisher","first-page":"110916","DOI":"10.1016\/J.ASOC.2023.110916","volume":"148","author":"X Yu","year":"2023","unstructured":"Yu, X., Zhou, J.: A robust method based on reinforcement learning and differential evolution for the optimal photovoltaic parameter extraction. Appl. Soft Comput. 148, 110916 (2023). https:\/\/doi.org\/10.1016\/J.ASOC.2023.110916","journal-title":"Appl. Soft Comput."},{"key":"501_CR94","doi-asserted-by":"publisher","first-page":"120185","DOI":"10.1016\/J.INS.2024.120185","volume":"661","author":"X Yu","year":"2024","unstructured":"Yu, X., Hu, Z., Luo, W., Xue, Y.: Reinforcement learning-based multi-objective differential evolution algorithm for feature selection. Inf. Sci. 661, 120185 (2024). https:\/\/doi.org\/10.1016\/J.INS.2024.120185","journal-title":"Inf. Sci."},{"key":"501_CR95","unstructured":"Yuan, Y., Banzhaf, W.: ARJA: Automated repair of java programs via multi-objective genetic programming. IEEE TSE (2018) arXiv:1712.07804"},{"key":"501_CR96","unstructured":"Zhang, Z., Tang, Q., Chica, M., Li, Z.: Reinforcement learning-based multiobjective evolutionary algorithm for mixed-model multimanned assembly line balancing under uncertain demand. IEEE Trans. on Cybernetics, pp. 1\u201314 (2023)"},{"issue":"4","key":"501_CR97","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.ins.2007.09.026","volume":"178","author":"H Zhang","year":"2008","unstructured":"Zhang, H., Lu, J.: Adaptive evolutionary programming based on reinforcement learning. Inf. Sci. 178(4), 971\u2013984 (2008)","journal-title":"Inf. Sci."},{"key":"501_CR98","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Sun, Z., Xiao, Y.A., Zhang, W., Yuan, K., Xiong, Y., Zhang, L.: A syntax-guided edit decoder for neural program repair. ESEC\/FSE, pp. 341\u2013353 (2021)","DOI":"10.1145\/3468264.3468544"}],"container-title":["Automated Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-025-00501-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10515-025-00501-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-025-00501-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T13:56:59Z","timestamp":1757512619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10515-025-00501-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,15]]},"references-count":98,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10515-025-00501-z","relation":{},"ISSN":["0928-8910","1573-7535"],"issn-type":[{"value":"0928-8910","type":"print"},{"value":"1573-7535","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,15]]},"assertion":[{"value":"30 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Justyna Petke is a Deputy-Editor-in-Chief of the ASE journal.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"31"}}