Node Importance-Based Multi-Objective Genetic Programming for Enhanced Model Interpretability in Symbolic Regression

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

@InProceedings{DBLP:conf/cec/AnfarCZ25,

• author = "Mohamad Rimas {Mohamad Anfar} and Qi Chen and Mengjie Zhang",
• title = "Node Importance-Based Multi-Objective Genetic Programming for Enhanced Model Interpretability in Symbolic Regression",
• booktitle = "2025 IEEE Congress on Evolutionary Computation (CEC)",
• year = "2025",
• editor = "Yaochu Jin and Thomas Baeck",
• address = "Hangzhou, China",
• month = "8-12 " # jun,
• publisher = "IEEE",
• keywords = "genetic algorithms, genetic programming, Measurement, Analytical models, Machine learning algorithms, Computational modeling, Heuristic algorithms, Evolutionary computation, Predictive models, Prediction algorithms, Complexity theory, Interpretability, NSGA-II, Per-node Importance, Regression, XAI",
• isbn13 = "979-8-3315-3432-5",
• timestamp = "Mon, 30 Jun 2025 13:18:00 +0200",
• biburl = "https://dblp.org/rec/conf/cec/AnfarCZ25.bib",
• bibsource = "dblp computer science bibliography, https://dblp.org",
• URL = "https://doi.org/10.1109/CEC65147.2025.11042961",
• DOI = "10.1109/CEC65147.2025.11042961",
• abstract = "Interpretability is a critical requirement in high-stakes real-world applications. Genetic Programming (GP) is one of the most interpretable machine learning algorithms currently available. While certain datasets necessitate complex GP models to capture underlying patterns, others may not require such complexity. However, GP lacks a mechanism to dynamically assess the required model complexity during evolution. As a result, GP often evolves overly complex models that are challenging to analyse, thereby reducing interpretability. This paper introduces a novel algorithm designed to evolve compact multi-objective GP models without significantly compromising regression error, thereby enhancing interpretability. The proposed method employs NSGA-II to simultaneously minimise regression error and maximize a newly introduced per-node importance metric. This metric quantifies the contribution of each node in terms of error reduction. By leveraging this metric, the algorithm discards large GP models containing many low-importance nodes, effectively avoiding unnecessarily complex solutions. Experimental results on ten regression datasets demonstrate that the proposed method consistently evolves smaller GP models with better interpretability while maintaining competitive predictive performance, particularly on high-dimensional datasets.",
• notes = "also known as \cite{mohamad-anfar:2025:CEC} \cite{11042961}",

}

Genetic Programming entries for Mohamad Rimas Mohamad Anfar Qi Chen Mengjie Zhang

Citations