29th International Workshop on Evolutionary Rule-based Machine Learning
Webpage: https://iwlcs.organic-computing.de
Description
Modern machine learning systems, including generative AI and large language models (LLMs), offer significant potential for addressing real-world challenges across a wide range of applications. However, a notable limitation of the majority of these systems is their ``black-box'' nature. The decision-making process of these models is often difficult to interpret, making it challenging for users to understand how a model arrived at a particular decision. The interpretability of decisions is critical in many real-world applications such as in biomedicine, autonomous vehicles, law, finance, and critical infrastructure. Moreover, many modern systems require extensive memory, huge computational resources, and enormous training data, which can be resource-intensive and hinder their widespread adoption.
Evolutionary rule-based machine learning (ERL) stands out for its ability to provide interpretable decisions and knowledge encodings. The majority of ERL systems generate niche-based solutions, require less memory, and can be trained using comparatively small data sets. A key factor that makes these models interpretable is the generation of human-readable rules. Consequently, the decision-making process of the ERL systems is interpretable, which is an important step toward eXplainable AI (XAI).
The International Workshop on Evolutionary Rule-based Machine Learning (IWERL), previously known as the International Workshop on Learning Classifier Systems (IWLCS), stands as a cornerstone within the vibrant history of GECCO. Celebrating its 29th edition, IWERL is one of the pioneer and successful workshops at GECCO. This workshop plays an important role in nurturing the future of evolutionary rule-based machine learning. It serves as a beacon for the next generation of researchers, inspiring them to delve deep into evolutionary rule-based machine learning, with a particular focus on Learning Classifier Systems (LCSs).
ERL represents a collection of machine learning techniques that leverage the strengths of various metaheuristics to find an optimal set of rules to solve a problem. These methods have been developed using a diverse array of learning paradigms, including supervised learning, unsupervised learning, and reinforcement learning. ERL encompasses several prominent categories, such as Learning Classifier Systems, Ant-Miner, artificial immune systems, and fuzzy rule-based systems. The modes or model structures of these systems are optimized using evolutionary, symbolic, or swarm-based methods. The hallmark characteristic of the ERL models is their innate comprehensibility, which encompasses traits like explainability, transparency, and interpretability. This property has garnered significant attention within the machine learning community, aligning with the broader interest of Explainable AI.
This workshop is designed to provide a platform for sharing the research trends in the realm of ERL. It aims to highlight modern implementations of ERL systems for real-world applications and to show the effectiveness of ERL in creating flexible and eXplainable AI systems. Moreover, this workshop seeks to attract new interest in this alternative and often advantageous modelling paradigm.
Topics of interest include but are not limited to:
- Advances in ERL methods: local models, problem space partitioning, rule mixing, …
- Applications of ERL: medical, navigation, bioinformatics, computer vision, games, cyber-physical systems, …
- State-of-the-art analysis: surveys, sound comparative experimental benchmarks, carefully crafted reproducibility studies, …
- Formal developments in ERL: provably optimal parametrization, time bounds, generalization, …
- Comprehensibility of evolved rule sets: knowledge extraction, visualization, interpretation of decisions, eXplainable AI, …
- Advances in ERL paradigms: Michigan/Pittsburgh style, hybrids, iterative rule learning, …
- Hyperparameter optimization for ERL: hyperparameter selection, online self-adaptation, …
- Optimizations and parallel implementations: GPU acceleration, matching algorithms, …
- Generative AI and LLMs in ERL: integrating generative models and large language models for rule generation, natural language explanations, enhanced interpretability, …
Submission format
Full papers and extended abstracts:
- Full papers (8 pages + references): Must cover the ACM Open APC (see below for more information)
- Extended Abstracts (up to 4 pages): Are not eligible for APC - no fee paid by the authors for ACM Open Access. An Extended Abstract provides a summary of a work-in-progress, typically just enough for readers to understand the idea, scope, and potential impact. It often lacks full methodology, detailed results, or extensive references.
Important dates
- Submission opening: February 2, 2026
- Submission deadline:
March 27, 2026April 03, 2026 - Notification: April 24, 2026
- Camera-ready: May 5, 2026
- Author's mandatory registration: May 11, 2026
ACMs new Open Access publishing model for 2026 ACM Conferences
Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 2,600 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 76%).
Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a financial waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy. Keep in mind that waivers are rare and are granted based on specific criteria set by ACM.
Understanding that this change could present financial challenges, ACM has approved a temporary subsidy for 2026 to ease the transition and allow more time for institutions to join ACM Open. The subsidy will offer:
- $250 APC for ACM/SIG members
- $350 for non-members
This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.
This temporary subsidized pricing will apply to all conferences scheduled for 2026.
Additionally, SIGEVO will provide an additional subsidy of $125 to papers accepted to GECCO 2026 (and only for 2026) that are subject to APCs. This will make the final amounts to be paid:
- $125 (USD) for SIGEVO members
- $225 (USD) for non-members
It is IMPORTANT to mention that both forms of subsidy (by ACM and by SIGVO) only apply to GECCO 2026. Moreover, it is still to be determined how the SIGEVO subsidy will be implemented, either directly to the APC or in other forms.
Finally, we note that APC charges apply to accepted Full Papers, but Abstracts (1-2 pages), Extended Abstracts (1-4 pages) and Tutorials ARE NOT APC Eligible; i.e., an APC will not have to be paid for these types of contributions.
ACM Authorship and Peer Review Policies on Generative AI
GECCO follows the official ACM policies on authorship and peer review, including the use of generative AI tools.
Under ACM's Authorship policy, generative AI tools and technologies cannot be listed as authors of an ACM published Work. The use of generative AI tools and technologies for assistance must be fully disclosed in the manuscript's Acknowledgments section. Authors are fully accountable for the originality, accuracy, and integrity of all submitted material.
In accordance with ACM's Peer Review policy, reviewers must not upload or share submitted manuscripts or review materials with generative AI systems. Reviewers may use generative AI or tools with the sole purpose of improving the quality and readability of reviewer reports for the author.
ACM is actively developing tools to help identify improper AI use in submissions, and GECCO may employ available detection methods. Submissions found to violate ACM policies may be rejected.
-
Organizers
Michael Heider is a researcher at the Department of Computer Science at the University of Augsburg, Germany. He received his B.Sc. in Computer Science in 2016, his M.Sc. in Computer Science and Information-oriented Business Management in 2018, and his Ph.D. in Computer Science from the University of Augsburg in 2025, graduating with highest honors (summa cum laude). His main research is directed towards Learning Classifier Systems, especially using multiple solutions for batch learning (Pittsburgh-style), with a focus on regression tasks encountered in industrial settings. Those have a high regard for both accurate as well as comprehensive/explainable solutions. To achieve comprehensibility of predictions and model structures he focuses on compact and simple rule sets. Besides that, his research interests include (mechanistic) interpretability of optimization techniques and applied unsupervised learning (e.g. for data augmentation, anomaly detection, or feature extraction). He is an elected organizing committee member of the International Workshop on Learning Classifier Systems and its successors since 2021, as well as a programme committee member of (among others): GECCO, CEC, SemIIM.