EDC: Equation Discovery for Classification
Guus Toussaint, Arno Knobbe

TL;DR
This paper introduces EDC, a novel symbolic equation discovery framework for binary classification that finds interpretable analytical functions defining decision boundaries, outperforming existing methods in accuracy and flexibility.
Contribution
The paper presents a new ED-based classification method, EDC, with a configurable grammar for discovering interpretable decision boundary equations, advancing symbolic regression techniques into classification tasks.
Findings
EDC outperforms current ED-based classifiers in accuracy.
The proposed grammar captures complex decision boundaries effectively.
EDC achieves performance comparable to state-of-the-art classifiers.
Abstract
Equation Discovery techniques have shown considerable success in regression tasks, where they are used to discover concise and interpretable models (\textit{Symbolic Regression}). In this paper, we propose a new ED-based binary classification framework. Our proposed method EDC finds analytical functions of manageable size that specify the location and shape of the decision boundary. In extensive experiments on artificial and real-life data, we demonstrate how EDC is able to discover both the structure of the target equation as well as the value of its parameters, outperforming the current state-of-the-art ED-based classification methods in binary classification and achieving performance comparable to the state of the art in binary classification. We suggest a grammar of modest complexity that appears to work well on the tested datasets but argue that the exact grammar -- and thus the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
