Franz Rothlauf
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Franz Rothlauf has a total of 132 co-authors. Here are the top co-authors by number of shared publications:
- Dominik Sobania
PALUNO, University of Duisburg-Essen, Germany
27 shared publications - Martin Briesch
Johannes Gutenberg University Mainz Germany
14 shared publications - Alina Geiger
Johannes Gutenberg University Mainz, Mainz, Germany
8 shared publications Jörn Grahl
7 shared publicationsJella Pfeiffer
6 shared publications- Philipp Röchner
Johannes Gutenberg University Mainz Germany
6 shared publications
Latest Publications
- Open Access
- 9 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
Transformer Semantic Genetic Programming for d -dimensional Symbolic Regression Problems
Transformer Semantic Genetic Programming (TSGP) is a semantic search approach that uses a pre-trained transformer model as a variation operator to generate offspring programs with high semantic similarity to a given parent. Unlike other semantic GP approaches that rely on fixed syntactic transformations, TSGP aims to learn diverse structural variations that lead to solutions with similar semantics. We find that a single transformer model trained on millions of programs is able to generalize across symbolic regression problems of varying dimension. Evaluated on 24 real-world and synthetic datasets, TSGP significantly outperforms standard GP, SLIM_GSGP, Deep Symbolic Regression, and Denoising Autoencoder GP, achieving an average rank of 1.58 across all benchmarks. Moreover, TSGP produces more compact solutions than SLIM_GSGP, despite its higher accuracy. In addition, the target semantic distance is able to effectively adjust the step size in the semantic space: small values enable consistent improvement in fitness but often lead to larger programs, while larger values promote faster convergence and compactness. Thus, the target semantic distance provides an effective mechanism for balancing exploration and exploitation.
- 9 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
Open AccessTransformer Semantic Genetic Programming for d -dimensional Symbolic Regression Problems
Transformer Semantic Genetic Programming (TSGP) is a semantic search approach that uses a pre-trained transformer model as a variation operator to generate offspring programs with high semantic similarity to a given parent. Unlike other semantic GP approaches that rely on fixed syntactic transformations, TSGP aims to learn diverse structural variations that lead to solutions with similar semantics. We find that a single transformer model trained on millions of programs is able to generalize across symbolic regression problems of varying dimension. Evaluated on 24 real-world and synthetic datasets, TSGP significantly outperforms standard GP, SLIM_GSGP, Deep Symbolic Regression, and Denoising Autoencoder GP, achieving an average rank of 1.58 across all benchmarks. Moreover, TSGP produces more compact solutions than SLIM_GSGP, despite its higher accuracy. In addition, the target semantic distance is able to effectively adjust the step size in the semantic space: small values enable consistent improvement in fitness but often lead to larger programs, while larger values promote faster convergence and compactness. Thus, the target semantic distance provides an effective mechanism for balancing exploration and exploitation.
- Open Access
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
Identifying Differences in Cancer Registry Data: A Data-Driven Approach to Analyze Data Comparability
Background: Cancer registries collect information on cancer patients from medical institutions. Standardized data processing at these institutions and registries, which produces comparable data, is crucial for subsequent data analysis. Otherwise, processing artifacts can hide treatment effects. To ensure comparable data, coding guidelines exist, but they can be incomplete, outdated, open to interpretation, or applied inconsistently. These discrepancies can introduce systematic differences in the reported data. Current evaluations of data comparability assess whether institutions follow coding guidelines rather than whether the reported data is comparable. This approach can miss systematic differences even when institutions conform to guidelines.Methods: We propose a data-driven approach combining machine learning (ML) and statistical methods to detect systematic differences between datasets from reporting institutions. To identify task-agnostic differences, we predict the reporting institution using classifiers; good discriminability indicates multivariate differences between the datasets. Statistical tests identify significant differences among variables, and comparisons of empirical distributions reveal differences in variable values. To identify task-specific differences, we train an ML model on data from one institution and evaluate it on data from both institutions. A drop in performance indicates distributional differences between the institutions' datasets. Findings: We validated our data-driven approach using data from the Cancer Registry Rhineland-Palatinate (CR-RLP, Germany) and the Netherlands Cancer Registry (NCR). For the CR-RLP, we identified systematic differences across five coding variables, with one reporting institution reporting substantially higher proportions of unspecified or imprecise values than the other. For the NCR, we observed differences in morphology subtypes. Interpretation: Our data-driven approach reveals potential coding differences between datasets, variables, and variable values. These differences could stem from decentralized coder training, allowing greater variability in documentation, or responsibility for data reporting. Our approach can help improve processes, inform data pooling, and identify reporting institutions where data coding could benefit from reviews.
- 3 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessIdentifying Differences in Cancer Registry Data: A Data-Driven Approach to Analyze Data Comparability
Background: Cancer registries collect information on cancer patients from medical institutions. Standardized data processing at these institutions and registries, which produces comparable data, is crucial for subsequent data analysis. Otherwise, processing artifacts can hide treatment effects. To ensure comparable data, coding guidelines exist, but they can be incomplete, outdated, open to interpretation, or applied inconsistently. These discrepancies can introduce systematic differences in the reported data. Current evaluations of data comparability assess whether institutions follow coding guidelines rather than whether the reported data is comparable. This approach can miss systematic differences even when institutions conform to guidelines.Methods: We propose a data-driven approach combining machine learning (ML) and statistical methods to detect systematic differences between datasets from reporting institutions. To identify task-agnostic differences, we predict the reporting institution using classifiers; good discriminability indicates multivariate differences between the datasets. Statistical tests identify significant differences among variables, and comparisons of empirical distributions reveal differences in variable values. To identify task-specific differences, we train an ML model on data from one institution and evaluate it on data from both institutions. A drop in performance indicates distributional differences between the institutions' datasets. Findings: We validated our data-driven approach using data from the Cancer Registry Rhineland-Palatinate (CR-RLP, Germany) and the Netherlands Cancer Registry (NCR). For the CR-RLP, we identified systematic differences across five coding variables, with one reporting institution reporting substantially higher proportions of unspecified or imprecise values than the other. For the NCR, we observed differences in morphology subtypes. Interpretation: Our data-driven approach reveals potential coding differences between datasets, variables, and variable values. These differences could stem from decentralized coder training, allowing greater variability in documentation, or responsibility for data reporting. Our approach can help improve processes, inform data pooling, and identify reporting institutions where data coding could benefit from reviews.
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 762-770
ROIDS: Robust Outlier-Aware Informed Down-Sampling
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 762-770
Open AccessROIDS: Robust Outlier-Aware Informed Down-Sampling
- Open Access
- 21 May 2026
- Published by IOS Press
- Vol. 336, 1430-1434
Anonymization of Electronic Health Records by the Use of Dimensionality Reduction Techniques
Electronic health records (EHR) mostly consist of highly sensitive data, whose sharing is highly regulated due to privacy and security concerns. To address privacy protections, de-identification and anonymization techniques offer a more secure way of data transmission to ensure patient’s privacy. Principal components analysis (PCA) has emerged as an anonymization technique. The applicability of more diverse and complex dimensionality reduction (DR) techniques such as Factor Analysis of Mixed Data (FAMD), or Autoencoder (AE), remains largely unexplored. The objective of this study is an investigation into the potential of FAMD and AE as anonymizers for EHR. The goal of this study is to apply advanced DR methods on three EHR datasets of varying sizes. Subsequently, a supervised prediction task is performed on the anonymized EHR using an artificial neural network (ANN), and the performance of the prediction task is compared to the performance of the original, non-anonymized EHR. The findings indicate that the use of FAMD and AE in the anonymization of EHR results in a comparable performance to that of the original, non-anonymized EHR in a downstream prediction task. This study thus indicates the potential of advanced DR as an anonymization technique for EHR, thereby underscoring the necessity for further investigation.
- 21 May 2026
- Published by IOS Press
- Vol. 336, 1430-1434
Open AccessAnonymization of Electronic Health Records by the Use of Dimensionality Reduction Techniques
Electronic health records (EHR) mostly consist of highly sensitive data, whose sharing is highly regulated due to privacy and security concerns. To address privacy protections, de-identification and anonymization techniques offer a more secure way of data transmission to ensure patient’s privacy. Principal components analysis (PCA) has emerged as an anonymization technique. The applicability of more diverse and complex dimensionality reduction (DR) techniques such as Factor Analysis of Mixed Data (FAMD), or Autoencoder (AE), remains largely unexplored. The objective of this study is an investigation into the potential of FAMD and AE as anonymizers for EHR. The goal of this study is to apply advanced DR methods on three EHR datasets of varying sizes. Subsequently, a supervised prediction task is performed on the anonymized EHR using an artificial neural network (ANN), and the performance of the prediction task is compared to the performance of the original, non-anonymized EHR. The findings indicate that the use of FAMD and AE in the anonymization of EHR results in a comparable performance to that of the original, non-anonymized EHR in a downstream prediction task. This study thus indicates the potential of advanced DR as an anonymization technique for EHR, thereby underscoring the necessity for further investigation.
- Open Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (1) , 1-40
A Performance Analysis of Lexicase-Based and Traditional Selection Methods in GP for Symbolic Regression
In recent years, several new lexicase-based selection variants have emerged due to the success of standard lexicase selection in various application domains. For symbolic regression problems, variants that use an \(\epsilon\) -threshold or batches of training cases, among others, have led to performance improvements. Lately, especially variants that combine lexicase selection and down-sampling strategies have received a lot of attention. This article evaluates the most relevant lexicase-based selection methods as well as traditional selection methods in combination with different down-sampling strategies on a wide range of symbolic regression problems. In contrast to most work, we not only compare the methods over a given evaluation budget, but also over a given time budget as time is usually limited in practice. We find that for a given evaluation budget, \(\epsilon\) -lexicase selection in combination with a down-sampling strategy outperforms all other methods. If the given running time is very short, lexicase variants using batches of training cases perform best. Further, we find that the combination of tournament selection with informed down-sampling performs well in all studied settings.- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (1) , 1-40
Open AccessA Performance Analysis of Lexicase-Based and Traditional Selection Methods in GP for Symbolic Regression
In recent years, several new lexicase-based selection variants have emerged due to the success of standard lexicase selection in various application domains. For symbolic regression problems, variants that use an \(\epsilon\) -threshold or batches of training cases, among others, have led to performance improvements. Lately, especially variants that combine lexicase selection and down-sampling strategies have received a lot of attention. This article evaluates the most relevant lexicase-based selection methods as well as traditional selection methods in combination with different down-sampling strategies on a wide range of symbolic regression problems. In contrast to most work, we not only compare the methods over a given evaluation budget, but also over a given time budget as time is usually limited in practice. We find that for a given evaluation budget, \(\epsilon\) -lexicase selection in combination with a down-sampling strategy outperforms all other methods. If the given running time is very short, lexicase variants using batches of training cases perform best. Further, we find that the combination of tournament selection with informed down-sampling performs well in all studied settings. - Open Access
ROIDS: Robust Outlier-Aware Informed Down-Sampling
Informed down-sampling (IDS) is known to improve performance in symbolic regression when combined with various selection strategies, especially tournament selection. However, recent work found that IDS's gains are not consistent across all problems. Our analysis reveals that IDS performance is worse for problems containing outliers. IDS systematically favors including outliers in subsets which pushes GP towards finding solutions that overfit to outliers. To address this, we introduce ROIDS (Robust Outlier-Aware Informed Down-Sampling), which excludes potential outliers from the sampling process of IDS. With ROIDS it is possible to keep the advantages of IDS without overfitting to outliers and to compete on a wide range of benchmark problems. This is also reflected in our experiments in which ROIDS shows the desired behavior on all studied benchmark problems. ROIDS consistently outperforms IDS on synthetic problems with added outliers as well as on a wide range of complex real-world problems, surpassing IDS on over 80% of the real-world benchmark problems. Moreover, compared to all studied baseline approaches, ROIDS achieves the best average rank across all tested benchmark problems. This robust behavior makes ROIDS a reliable down-sampling method for selection in symbolic regression, especially when outliers may be included in the data set.
Open AccessROIDS: Robust Outlier-Aware Informed Down-Sampling
Informed down-sampling (IDS) is known to improve performance in symbolic regression when combined with various selection strategies, especially tournament selection. However, recent work found that IDS's gains are not consistent across all problems. Our analysis reveals that IDS performance is worse for problems containing outliers. IDS systematically favors including outliers in subsets which pushes GP towards finding solutions that overfit to outliers. To address this, we introduce ROIDS (Robust Outlier-Aware Informed Down-Sampling), which excludes potential outliers from the sampling process of IDS. With ROIDS it is possible to keep the advantages of IDS without overfitting to outliers and to compete on a wide range of benchmark problems. This is also reflected in our experiments in which ROIDS shows the desired behavior on all studied benchmark problems. ROIDS consistently outperforms IDS on synthetic problems with added outliers as well as on a wide range of complex real-world problems, surpassing IDS on over 80% of the real-world benchmark problems. Moreover, compared to all studied baseline approaches, ROIDS achieves the best average rank across all tested benchmark problems. This robust behavior makes ROIDS a reliable down-sampling method for selection in symbolic regression, especially when outliers may be included in the data set.
- 2 January 2026
- Published by Springer Nature
- p. 141-154
Biases of Algorithmic and Editorial Recommendations in Public Service Media
- 2 January 2026
- Published by Springer Nature
- p. 141-154
Biases of Algorithmic and Editorial Recommendations in Public Service Media
- Open Access
- 17 November 2025
- Published by International Conference on Information Systems Development
Let Me Entertain You: On the Bias of Editorial and Algorithmic Recommendations in Public Service Media
In today’s online world, bias is ubiquitous. In a Video-on-Demand (VOD) context, there are two main sources for bias: (1) content providers and their methods that generate recommendations; (2) user preferences. We use real world data from one of the largest German Public Service Media (PSM) platforms to study both possible causes by examining content recommendations and content consumption (classified as Education, Information, Culture, and Entertainment according to the regulations governing PSM operations). We find that Education and Entertainment content to be recommended disproportionately. Algorithmic personalized recommendations lead to a bias towards both Education and Entertainment for the recommendations. Editorial content recommendations favor Entertainment content. Additionally, we find that the bias introduced by the recommender systems to be larger than the one introduced by the viewer. We recommend testing an increased use of algorithmic recommendations as these might lead to a lower bias towards Entertainment content.
- 17 November 2025
- Published by International Conference on Information Systems Development
Open AccessLet Me Entertain You: On the Bias of Editorial and Algorithmic Recommendations in Public Service Media
In today’s online world, bias is ubiquitous. In a Video-on-Demand (VOD) context, there are two main sources for bias: (1) content providers and their methods that generate recommendations; (2) user preferences. We use real world data from one of the largest German Public Service Media (PSM) platforms to study both possible causes by examining content recommendations and content consumption (classified as Education, Information, Culture, and Entertainment according to the regulations governing PSM operations). We find that Education and Entertainment content to be recommended disproportionately. Algorithmic personalized recommendations lead to a bias towards both Education and Entertainment for the recommendations. Editorial content recommendations favor Entertainment content. Additionally, we find that the bias introduced by the recommender systems to be larger than the one introduced by the viewer. We recommend testing an increased use of algorithmic recommendations as these might lead to a lower bias towards Entertainment content.
- Open Access
We Need to Rethink Benchmarking in Anomaly Detection
Despite the continuous proposal of new anomaly detection algorithms and extensive benchmarking efforts, progress seems to stagnate, with only minor performance differences between established baselines and new algorithms. In this position paper, we argue that this stagnation is due to limitations in how we evaluate anomaly detection algorithms. Current benchmarking does not, for example, sufficiently reflect the diversity of anomalies in applications ranging from predictive maintenance to scientific discovery. Consequently, we need to rethink benchmarking in anomaly detection. In our opinion, anomaly detection should be studied using scenarios that capture the relevant characteristics of different applications. We identify three key areas for improvement: First, we need to identify anomaly detection scenarios based on a common taxonomy. Second, anomaly detection pipelines should be analyzed end-to-end and by component. Third, evaluating anomaly detection algorithms should be meaningful regarding the scenario's objectives.
Open AccessWe Need to Rethink Benchmarking in Anomaly Detection
Despite the continuous proposal of new anomaly detection algorithms and extensive benchmarking efforts, progress seems to stagnate, with only minor performance differences between established baselines and new algorithms. In this position paper, we argue that this stagnation is due to limitations in how we evaluate anomaly detection algorithms. Current benchmarking does not, for example, sufficiently reflect the diversity of anomalies in applications ranging from predictive maintenance to scientific discovery. Consequently, we need to rethink benchmarking in anomaly detection. In our opinion, anomaly detection should be studied using scenarios that capture the relevant characteristics of different applications. We identify three key areas for improvement: First, we need to identify anomaly detection scenarios based on a common taxonomy. Second, anomaly detection pipelines should be analyzed end-to-end and by component. Third, evaluating anomaly detection algorithms should be meaningful regarding the scenario's objectives.
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-32
Selection Methods in Genetic Programming: A Performance Analysis
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-32
Open AccessSelection Methods in Genetic Programming: A Performance Analysis