Papers

Symbolic regression seeks to discover mathematical expressions that accurately describe observed data, yet standard genetic-programming approaches frequently suffer from premature convergence and diversity collapse as populations stagnate on local optima. AHISTER introduces a dynamic multi-branch evolutionary framework, a mathematical colosseum in which independent evolutionary branches first develop in isolation, then enter the arena under tournament-based asymmetric partitioning into intensification and diversification paths. A coordinating branch aggregates a real-time Hall of Fame from asynchronous sub-branches; a dual stagnation clock governs termination at both local and global levels.

↓ Read current draft (PDF)

Distributed evolutionary search across heterogeneous compute clusters poses two coupled challenges: where should newly generated work execute, and how much effort should each unit of work consume? DEBOHAC is a holonic cluster scheme designed for symbolic-regression workloads in which independent branches and their recursive sub-branches must be distributed across an arbitrary-depth tree of cooperating instances. Capacity flows upward as periodic situation reports that aggregate hierarchically; budget flows downward as the authority to evolve. Each instance independently runs a three-step orchestration cycle that instantiates the principle of subsidiarity at every level.

PDF will be linked here with the evaluation.

Evaluating evolved candidates is the dominant cost in symbolic regression at scale, and most of it is spent on candidates that will be discarded. CRESCENT scores a candidate in batches and stops as soon as it is statistically clear that the candidate is not competitive: a sample-size bound fixes the minimum number of rows, and a threshold drawn from the population's current error distribution decides at every batch boundary. The paper describes the mechanism and the experimental framework for isolating its contribution against a benchmark baseline.