Instruction Set and Language for Symbolic Regression

๐Ÿ“… 2026-03-23
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work addresses the issue of structural redundancy in symbolic regression caused by multiple node labelings of expression-directed acyclic graphs (DAGs), which inflates the search space and leads to redundant fitness evaluations. To resolve this, the authors propose IsalSR, a novel framework that introduces, for the first time, a complete labeled DAG isomorphism invariant as a canonical representation. By encoding DAGs into strings via a two-level compact alphabet and generating a pruned canonical form, IsalSR uniquely normalizes all semantically equivalent expressions. This approach fundamentally eliminates structural redundancy, substantially compressing the search space and avoiding repeated evaluations. Consequently, it enhances both search efficiency and solution diversity, leading to improved overall algorithmic performance.

Technology Category

Search and Optimization: Mixed Discrete/Continuous SearchCognitive Modeling & Cognitive Systems: Symbolic RepresentationsConstraint Satisfaction and Optimization: Satisfiability

Application Category

Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphsSearch and Retrieval-Augmented AI: Web query analysis, representation and understandingSemantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
๐Ÿ“ Abstract
A fundamental but largely unaddressed obstacle in Symbolic regression (SR) is structural redundancy: every expression DAG with admits many distinct node-numbering schemes that all encode the same expression, each occupying a separate point in the search space and consuming fitness evaluations without adding diversity. We present IsalSR (Instruction Set and Language for Symbolic Regression), a representation framework that encodes expression DAGs as strings over a compact two-tier alphabet and computes a pruned canonical string -- a complete labeled-DAG isomorphism invariant -- that collapses all the equivalent representations into a single canonical form.
Problem

Research questions and friction points this paper is trying to address.

Symbolic Regression
Structural Redundancy
Expression DAG
Node-numbering Schemes
Search Space
Innovation

Methods, ideas, or system contributions that make the work stand out.

Symbolic Regression
Structural Redundancy
Canonical Representation
Expression DAG
Isomorphism Invariant
๐Ÿ”Ž Similar Papers
No similar papers found.
๐Ÿ’ผ Related Jobs
No related jobs found.
E
Ezequiel Lopez-Rubio
Department of Computer Languages and Computer Science, University of Mรกlaga
M
Mario Pascual-Gonzalez
Department of Computer Languages and Computer Science, University of Mรกlaga