Learning to Predict Code Review Rounds in Modern Code Review Using Multi-Objective Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8562

@InProceedings{chouchen:2025:GECCOcomp,

• author = "Moataz Chouchen and Issam Oukhay and Ali Ouni",
• title = "Learning to Predict Code Review Rounds in Modern Code Review Using Multi-Objective Genetic Programming",
• booktitle = "Proceedings of the 2025 Genetic and Evolutionary Computation Conference Companion",
• year = "2025",
• editor = "Aniko Ekart and Nelishia Pillay",
• pages = "599--602",
• address = "Malaga, Spain",
• series = "GECCO '25 Companion",
• month = "14-18 " # jul,
• organisation = "SIGEVO",
• publisher = "Association for Computing Machinery",
• publisher_address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, SBSE, code review, review rounds: Poster",
• isbn13 = "979-8-4007-1464-1",
• URL = "https://doi.org/10.1145/3712255.3726730",
• DOI = "doi:10.1145/3712255.3726730",
• size = "4 pages",
• abstract = "Code review is an essential practice for software quality assurance. However, code review can be cumbersome as patches often undergo multiple rounds to fix bugs, enforce coding standards, and improve structure before merging or abandonment. Predicting the number of review rounds can help developers prioritize tasks and streamline the process. Existing machine learning models for review round prediction suffer from key limitations. Their black-box nature makes them difficult to interpret, reducing trust and adoption. Additionally, they rely on data re-balancing techniques that introduce artificial points, causing concept shifts and reducing reliability. To address these issues, we propose MORRP, a novel Multi-Objective Review Rounds Prediction approach. MORRP is based on Multi-Objective Genetic Programming (MOGP) to predict review rounds. Our method evolves interpretable models while optimizing precision, recall, and specificity without relying on data re-balancing. We evaluate our approach on three large open-source projects: Eclipse, OpenDaylight, and OpenStack. Results show that MORRP achieves competitive performance, with a micro F1 score between 0.65 and 0.75, outperforming complex ML models like Random Forest and LightGBM.",
• notes = "GECCO-2025 GP A Recombination of the 34th International Conference on Genetic Algorithms (ICGA) and the 30th Annual Genetic Programming Conference (GP)",

}

Genetic Programming entries for Moataz Chouchen Issam Oukhay Ali Ouni

Citations