Lauren Paul
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lauren Paul has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Bernhard Johannes Berger
Hamburg University of Technology, Hamburg, Germany
2 shared publications - Christina Plump
University of Bremen, Bremen, Germany
2 shared publications - Rolf Drechsler
Faculty 03 Mathematics and Computer Science, University of Bremen
2 shared publications
Latest Publications
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1135-1143
Can Explainability Metrics Improve Genetic Programming? Lessons from 2048
Genetic programming (GP) produces solutions that, while often less performant than neural networks, are uniquely amenable to analysis. In domains like game-playing, this explainability could reveal why certain policies succeed or fail—but such insights are rarely leveraged to improve the algorithms themselves. Here, we analyze a GP algorithm for 2048, testing whether structural, behavioral, or semantic metrics of evolved policies correlate with performance. While structural metrics showed no predictive power and behavioral features yielded ambiguous results, we identified a semantic feature that correlated with policy quality. Using this insight, we designed a mutation operator that improved performance. Though modest, this improvement suggests that explainability metrics can guide operator design, even when broader explanatory goals remain unmet. More broadly, our work highlights a potential advantage of GP: its solutions may be analyzable in ways that opaque methods like neural networks are not.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1135-1143
Open AccessCan Explainability Metrics Improve Genetic Programming? Lessons from 2048
Genetic programming (GP) produces solutions that, while often less performant than neural networks, are uniquely amenable to analysis. In domains like game-playing, this explainability could reveal why certain policies succeed or fail—but such insights are rarely leveraged to improve the algorithms themselves. Here, we analyze a GP algorithm for 2048, testing whether structural, behavioral, or semantic metrics of evolved policies correlate with performance. While structural metrics showed no predictive power and behavioral features yielded ambiguous results, we identified a semantic feature that correlated with policy quality. Using this insight, we designed a mutation operator that improved performance. Though modest, this improvement suggests that explainability metrics can guide operator design, even when broader explanatory goals remain unmet. More broadly, our work highlights a potential advantage of GP: its solutions may be analyzable in ways that opaque methods like neural networks are not.
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1640-1648
EvoAl - Codeless Domain-Optimisation
Applying optimisation techniques such as evolutionary computation to real-world tasks often requires significant adaptation. However, specific application domains do not typically demand major changes to existing optimisation methods. The decisive aspect is the inclusion of domain knowledge and configuration of established techniques to suit the problem. Separating the optimisation technique from the domain knowledge offers several advantages: First, it allows updating domain knowledge without necessitating reimplementation. Second, it improves identification and comparison of the optimisation methods employed. We present EvoAl, an open-source data-science research tool suite that focuses on optimisation research for real-world problems. EvoAl implements the separation of domain-knowledge and detaches implementation from configuration, facilitating optimisation with little programming effort, allowing direct comparability with other approaches (using EvoAl), and ensuring reproducibility. EvoAl also includes options for surrogate models, data models for complex search spaces, data validation, and benchmarking options for optimisation researchers.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1640-1648
Open AccessEvoAl - Codeless Domain-Optimisation
Applying optimisation techniques such as evolutionary computation to real-world tasks often requires significant adaptation. However, specific application domains do not typically demand major changes to existing optimisation methods. The decisive aspect is the inclusion of domain knowledge and configuration of established techniques to suit the problem. Separating the optimisation technique from the domain knowledge offers several advantages: First, it allows updating domain knowledge without necessitating reimplementation. Second, it improves identification and comparison of the optimisation methods employed. We present EvoAl, an open-source data-science research tool suite that focuses on optimisation research for real-world problems. EvoAl implements the separation of domain-knowledge and detaches implementation from configuration, facilitating optimisation with little programming effort, allowing direct comparability with other approaches (using EvoAl), and ensuring reproducibility. EvoAl also includes options for surrogate models, data models for complex search spaces, data validation, and benchmarking options for optimisation researchers.