Pith. sign in

REVIEW 3 major objections 2 minor 52 references

Zobrist Hash-based Duplicate Detection in Symbolic Regression

T0 review · 3 major / 2 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Zobrist hash caching detects duplicate expressions in genetic programming and cuts runtime by up to 34 percent without hurting search quality.

desk verdict The abstract describes a sensible memoization trick for GP, but the received text is incoherent—plasma plots where the symbolic regression experiments should be—so there is nothing to referee yet. read the letter →

arxiv 2508.13859 v1 pith:FGXRMXD3 submitted 2025-08-19 cs.NE

Bogdan Burlacu This is my paper · ORCID
classification cs.NE
keywords symbolicregressiongeneticprogrammingZobristhashingtranspositiontableduplicatedetectioncachingOperonfitnessevaluation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Genetic programming applied to symbolic regression can evaluate the same expression tree many times over a run. This paper argues that many of those repeats are wasted work, and that a cheap tree-hashing scheme called Zobrist hashing can catch them: store each evaluated expression's fitness in a transposition table, and return the stored value when the same tree appears again. Implemented in the Operon framework, the approach reports up to 34% faster runs on a selection of real-world regression benchmarks, with no measurable loss in search quality. The practical payoff is that, if true, a small cache converts a hidden inefficiency in evolutionary search into extra computing budget.

What carries the argument

The carrying mechanism is a transposition table keyed by a Zobrist hash. A Zobrist hash is built by XORing random bitstrings assigned to each node or symbol of an expression tree, making tree hashes cheap to compute and incrementally updatable when subtrees change. The table maps a hash to a stored fitness value, so the duplicate check happens before fitness evaluation, turning repeated expressions into cache lookups.

What would settle it

Instrument the same Operon benchmark runs to count cache hits, misses, hash/probe overhead, and wall-clock time with and without the cache. If the measured hit rate is so low that the saved fitness evaluations do not outweigh the hashing and lookup overhead—or if the aggregate speedup does not reproduce on the reported problems—the central claim is refuted.

Watch

Extended reading notes

Core claim

The central claim is that a Zobrist-hash-keyed transposition table can serve as a duplicate-expression cache in GP-based symbolic regression, and that this cache speeds up the search. Zobrist hashing assigns random bitstrings to nodes and combines them with XOR so an expression tree gets a compact, incrementally updatable hash; when crossover or mutation recreates a previously evaluated tree, the hash matches a stored entry and the cached fitness is returned without re-evaluation. On the tested regression problems, the paper reports up to 34% wall-clock speedups and states there were no detrimental effects on search quality. The paper also claims that re-visiting and re-evaluating search-spa

Load-bearing premise

The speedup assumes the same expression trees are generated and re-evaluated often enough during a run that skipping them saves more time than computing Zobrist hashes and probing the cache costs; if duplicates are rare, the cache makes the run slower.

Editorial extensions

If this is right

  • Symbolic regression runs inside Operon complete up to 34% faster at the same search quality, so a fixed compute budget can afford larger populations or more generations.
  • The duplicate-detection mechanism is independent of the fitness function and tree operators, so it should transfer to other tree-based GP systems beyond Operon.
  • Because the cache records which expressions have already been seen, it gives the search algorithm structured information about visited regions that later strategies could exploit.
  • If duplicates are frequent, skipping them changes runtime but not the distribution of evaluated solutions, which is why search quality is reported unchanged.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The headline speedup is an upper bound; I would expect the gain to depend heavily on how often the search recreates the same trees, and the paper does not report hit rates, so an immediate extension is to measure cache hit ratio per problem and generation.
  • Because Zobrist hashes update incrementally when subtrees are swapped, the same table could double as a structural hashing scheme for subtree reuse or diversity metrics at little extra cost.
  • Cached 'already seen' information could support a tabu-like strategy that penalizes re-evaluating known expressions, pushing the population toward unexplored regions; the abstract hints at this by mentioning search-strategy adjustment.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The paper proposes a duplicate-detection cache for symbolic regression based on Zobrist hashing, implemented within the Operon genetic programming framework. The abstract claims that many expressions are re-evaluated during a GP run and that caching their fitness values yields up to 34% speedups on real-world regression problems without degrading search quality. The submitted full text, however, does not contain the symbolic-regression experiments, benchmark protocol, or any quantitative evidence for these claims. Instead, the visible body text and figures concern an unrelated induction-coil/plasma simulation (temperature, velocity, Dcoil, PHF). The central empirical claim is therefore unsupported by the manuscript as received.

Significance. If the mechanism were properly validated, the contribution would be a modest but useful engineering improvement: Zobrist transposition tables are a standard technique from game-tree search, and applying them to GP fitness memoization is a plausible way to reduce wasted evaluations. The paper does not provide machine-checked proofs, reproducible benchmark code, or parameter-free derivations; its value would rest entirely on the experimental demonstration. Because that demonstration is absent from the submitted body, the significance of the contribution cannot be assessed from this manuscript.

major comments (3)
  1. [Abstract vs. body (Figs. 1-4)] The central claim of 'up to 34% speedups without any detrimental effects on search quality' is not supported by the body. The visible experimental figures and captions concern plasma/coil simulations (temperature and velocity as functions of radius, Dcoil, PHF), not symbolic regression. There is no benchmark table, no runtime comparison, no fitness comparison, no number of runs, and no statistical test. The headline result is therefore unverifiable from the submitted manuscript.
  2. [Duplicate-frequency premise] The abstract asserts that 'many points in the search space are re-visited and re-evaluated multiple times', but the manuscript gives no measured duplicate frequency, cache hit rate, or overhead of Zobrist hash computation and cache probing. Without these quantities, the claimed speedup is not established. In a low-duplication or high-overhead regime, the cache would slow the run rather than speed it up, so the direction of the effect is an empirical question that the manuscript leaves unanswered.
  3. [Collision handling and correctness] Zobrist hashing is probabilistic: different expressions can collide. The 'no detrimental effects on search quality' claim requires either that collisions are checked by exact tree equivalence before reusing a cached fitness, or that the collision probability is shown to be negligible in a concrete way. The visible text does not describe any collision-verification step. Without this, a hash collision could silently associate the wrong fitness with an expression, directly undermining the no-harm guarantee.
minor comments (2)
  1. [File encoding] Much of the full text is corrupted or encoding-mangled, with replacement characters obscuring equations, section numbers, and prose. The file needs to be regenerated from a clean source before it can be evaluated.
  2. [Missing experimental protocol] No details are provided for the 'selection of real-world regression problems': dataset names, population size, number of generations, variation operators, or hardware. Even if the correct experimental section were present, these details would be needed to make the speedup reproducible.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: the central speedup and search-quality claims rest on external real-world regression benchmarks, not on self-referential definitions or load-bearing self-citations.

full rationale

The paper's claimed derivation chain is empirical: it asserts that GP re-evaluates duplicate expressions, proposes a Zobrist-hash cache to skip those re-evaluations, implements it in the Operon framework, and measures runtime on real-world regression problems. The headline result—'up to 34% speedups without any detrimental effects on search quality'—is a benchmark measurement against a baseline, not a quantity fitted to the benchmark and then renamed as a prediction. No equation defines the speedup in terms of the cache's own hit rate, and no fitted parameter is presented as an independent finding. The only likely self-citations are to the Operon framework and the author's prior implementation work; these are infrastructure references, not load-bearing justifications for the empirical result. The received full text is heavily corrupted and includes unrelated plasma/coil figure captions, so the experimental protocol, cache hit rates, and overhead measurements are not verifiable from the submitted artifact. That is a missing-support / verifiability problem, not a circularity problem. Under the hard rules, circularity requires exhibiting a specific reduction of a claimed result to its own inputs or to a self-citation chain, and none is present here.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central claim as stated in the abstract depends on three unstated premises: that identical expression trees recur frequently enough in GP runs to make caching profitable; that Zobrist hashes of expression trees can be maintained incrementally without prohibitive overhead or unacceptable collision rates; and that fitness values are deterministic so a cached value is always reusable. None of these are derived in the abstract, and the body text that would justify them is unreadable. No free parameters or invented entities appear in the abstract.

assumptions (3)
  • domain assumption Identical expression trees recur frequently enough across generations that caching yields net savings.
    The abstract motivates the work by asserting that 'many points in the search space are re-visited and re-evaluated multiple times', but gives no measured duplicate rate or cache hit rate; if recurrence is rare, cache overhead exceeds the savings and the speedup claim collapses.
  • domain assumption Zobrist hash values can be maintained incrementally for expression trees with negligible collision risk.
    The abstract states Zobrist hashing is 'frequently used in abstract board games for the efficient construction and subsequent update of transposition tables', but the collision behavior for expression-tree node assignments and the equality policy (syntactic vs. semantic) are not addressed in the abstract.
  • domain assumption Fitness of a cached expression remains valid when re-encountered.
    Caching assumes deterministic fitness on a fixed training set; incremental or coevolutionary fitness settings would invalidate reuse. The abstract does not discuss this.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Zobrist Hash-based Duplicate Detection in Symbolic Regression." pith.science (2026). https://pith.science/paper/FGXRMXD3

@misc{pith2026250813859,
  author       = {Pith},
  title        = {Pith review of: Zobrist Hash-based Duplicate Detection in Symbolic Regression},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FGXRMXD3}},
  note         = {Machine review of arXiv:2508.13859}
}
read the original abstract

Symbolic regression encompasses a family of search algorithms that aim to discover the best fitting function for a set of data without requiring an a priori specification of the model structure. The most successful and commonly used technique for symbolic regression is Genetic Programming (GP), an evolutionary search method that evolves a population of mathematical expressions through the mechanism of natural selection. In this work we analyze the efficiency of the evolutionary search in GP and show that many points in the search space are re-visited and re-evaluated multiple times by the algorithm, leading to wasted computational effort. We address this issue by introducing a caching mechanism based on the Zobrist hash, a type of hashing frequently used in abstract board games for the efficient construction and subsequent update of transposition tables. We implement our caching approach using the open-source framework Operon and demonstrate its performance on a selection of real-world regression problems, where we observe up to 34\% speedups without any detrimental effects on search quality. The hashing approach represents a straightforward way to improve runtime performance while also offering some interesting possibilities for adjusting search strategy based on cached information.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

52 extracted references · 32 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION fin.entry doi empty add.period 'skip if write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION new.sentence output.state after.block = 'skip output.state before.all = 'skip after.sentence 'output.state := if if FUNCTION not #0 #1 if FUNCTION and 'ski...

  2. [2]

    2022 Interpretable machine learning: Fundamental principles and 10 grand challenges

    Rudin C, Chen C, Chen Z, Huang H, Semenova L, Zhong C. 2022 Interpretable machine learning: Fundamental principles and 10 grand challenges . Statistics Surveys 16, 1 – 85. (10.1214/21-SS133 http://dx.doi.org/10.1214/21-SS133)

    doi:10.1214/21-ss133 2022

  3. [3]

    2022 Analytical Modeling of Exoplanet Transit Spectroscopy with Dimensional Analysis and Symbolic Regression

    Matchev KT, Matcheva K, Roman A. 2022 Analytical Modeling of Exoplanet Transit Spectroscopy with Dimensional Analysis and Symbolic Regression . The Astrophysical Journal 930, 33. (10.3847/1538-4357/ac610c http://dx.doi.org/10.3847/1538-4357/ac610c)

    work page doi:10.3847/1538-4357/ac610c 2022

  4. [4]

    , Kammerer, Lukas , Kronberger, Gabriel , Desmond, Harry , Ferreira, Pedro G

    Bartlett, Deaglan J. , Kammerer, Lukas , Kronberger, Gabriel , Desmond, Harry , Ferreira, Pedro G. , Wandelt, Benjamin D. , Burlacu, Bogdan , Alonso, David , Zennaro, Matteo . 2024 A precise symbolic emulator of the linear matter power spectrum . A&A 686, A209. (10.1051/0004-6361/202348811 http://dx.doi.org/10.1051/0004-6361/202348811)

    doi:10.1051/0004-6361/202348811 2024

  5. [5]

    2023 On the functional form of the radial acceleration relation

    Desmond H, Bartlett DJ, Ferreira PG. 2023 On the functional form of the radial acceleration relation . Monthly Notices of the Royal Astronomical Society 521, 1817–1831. (10.1093/mnras/stad597 http://dx.doi.org/10.1093/mnras/stad597)

    doi:10.1093/mnras/stad597 2023

  6. [6]

    2023 Rediscovering orbital mechanics with machine learning

    Lemos P, Jeffrey N, Cranmer M, Ho S, Battaglia P. 2023 Rediscovering orbital mechanics with machine learning . Machine Learning: Science and Technology 4, 045002. (10.1088/2632-2153/acfa63 http://dx.doi.org/10.1088/2632-2153/acfa63)

    doi:10.1088/2632-2153/acfa63 2023

  7. [7]

    2024 Symbolic Regression with a Learned Concept Library

    Grayeli A, Sehgal A, Costilla-Reyes O, Cranmer M, Chaudhuri S. 2024 Symbolic Regression with a Learned Concept Library . ArXiv abs/2409.09359

    arXiv 2024

  8. [8]

    2019 Symbolic regression in materials science

    Wang Y, Wagner N, Rondinelli JM. 2019 Symbolic regression in materials science . MRS communications 9, 793–805. (10.1557/mrc.2019.85 http://dx.doi.org/10.1557/mrc.2019.85)

    doi:10.1557/mrc.2019.85 2019

Show all 52 references
  1. [9]

    2022 Symbolic regression in materials science via dimension-synchronous-computation

    Wang C, Zhang Y, Wen C, Yang M, Lookman T, Su Y, Zhang TY. 2022 Symbolic regression in materials science via dimension-synchronous-computation . Journal of Materials Science & Technology 122, 77–83. (10.1016/j.jmst.2021.12.052 http://dx.doi.org/10.1016/j.jmst.2021.12.052)

    2022 doi

  2. [10]

    2024 Exploring the mathematic equations behind the materials science data using interpretable symbolic regression

    Wang G, Wang E, Li Z, Zhou J, Sun Z. 2024 Exploring the mathematic equations behind the materials science data using interpretable symbolic regression . Interdisciplinary Materials 3, 637–657. (10.1002/idm2.12180 http://dx.doi.org/10.1002/idm2.12180)

    2024 doi

  3. [11]

    2023 Is the machine smarter than the theorist: Deriving formulas for particle kinematics with symbolic regression

    Dong Z, Kong K, Matchev KT, Matcheva K. 2023 Is the machine smarter than the theorist: Deriving formulas for particle kinematics with symbolic regression . Phys. Rev. D 107, 055018. (10.1103/PhysRevD.107.055018 http://dx.doi.org/10.1103/PhysRevD.107.055018)

    2023 doi

  4. [12]

    2024 Symbolic regression for precision LHC physics

    Morales-Alvarado M, Conde D, Bendavid J, Sanz V, Ubiali M. 2024 Symbolic regression for precision LHC physics . In 38th conference on Neural Information Processing Systems

    2024

  5. [13]

    2023 Modeling and Control of Robotic Manipulators Based on Symbolic Regression

    Zhang Z, Chen Z. 2023 Modeling and Control of Robotic Manipulators Based on Symbolic Regression . IEEE Transactions on Neural Networks and Learning Systems 34, 2440–2450. (10.1109/TNNLS.2021.3106648 http://dx.doi.org/10.1109/TNNLS.2021.3106648)

    2023

  6. [14]

    2021 Controller design by symbolic regression

    Danai K, La Cava WG. 2021 Controller design by symbolic regression . Mechanical Systems and Signal Processing 151, 107348. (10.1016/j.ymssp.2020.107348 http://dx.doi.org/10.1016/j.ymssp.2020.107348)

    2021

  7. [15]

    2023 A flexible symbolic regression method for constructing interpretable clinical prediction models

    La Cava WG, Lee PC, Ajmal I, Ding X, Solanki P, Cohen JB, Moore JH, Herman DS. 2023 A flexible symbolic regression method for constructing interpretable clinical prediction models . npj Digital Medicine 6, Article number: 107. Silver 2023 HUMIES (10.1038/s41746-023-00833-8 htt...

    2023 doi

  8. [16]

    2021 Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients

    Petersen BK, Landajuela M, Mundhenk TN, Santiago CP, Kim S, Kim JT. 2021 Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients . In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, ...

    2021

  9. [17]

    2022 End-to-end symbolic regression with transformers

    Kamienny PA, d'Ascoli S, Lample G, Charton F. 2022 End-to-end symbolic regression with transformers . Advances in Neural Information Processing Systems 35, 10269–10281

    2022

  10. [18]

    2022 A Unified Framework for Deep Symbolic Regression

    Landajuela M, Lee CS, Yang J, Glatt R, Santiago CP, Aravena I, Mundhenk TN, Mulcahy G, Petersen BK. 2022 A Unified Framework for Deep Symbolic Regression . In Koyejo S, Mohamed S, Agarwal A, Belgrave D, Cho K, Oh A, editors, Advances in Neural Information Processing Systems 35...

    2022

  11. [19]

    2024 SymFormer: End-to-End Symbolic Regression Using Transformer-Based Architecture

    Vastl M, Kulhánek J, Kubalík J, Derner E, Babuška R. 2024 SymFormer: End-to-End Symbolic Regression Using Transformer-Based Architecture . IEEE Access 12, 37840–37849. (10.1109/ACCESS.2024.3374649 http://dx.doi.org/10.1109/ACCESS.2024.3374649)

    2024

  12. [20]

    2018 Learning equations for extrapolation and control

    Sahoo S, Lampert C, Martius G. 2018 Learning equations for extrapolation and control . In International Conference on Machine Learning p. 4442–4450. Pmlr

    2018

  13. [21]

    2013 Prioritized grammar enumeration: symbolic regression by dynamic programming

    Worm T, Chiu K. 2013 Prioritized grammar enumeration: symbolic regression by dynamic programming . In Blum C, Alba E, Auger A, Bacardit J, Bongard J, Branke J, Bredeche N, Brockhoff D, Chicano F, Dorin A, Doursat R, Ekart A, Friedrich T, Giacobini M, Harman M, Iba H, Igel C, J...

    2013

  14. [22]

    2018 A global MINLP approach to symbolic regression

    Cozad A, Sahinidis NV. 2018 A global MINLP approach to symbolic regression . Mathematical Programming 170, 97–119. Special Issue: International Symposium on Mathematical Programming, Bordeaux, July 2018 (10.1007/s10107-018-1289-x http://dx.doi.org/10.1007/s10107-018-1289-x)

    2018 doi

  15. [23]

    McConaghy T. 2011 p. 235–260. In FFX: Fast, Scalable, Deterministic Symbolic Regression Technology , p. 235–260. New York, NY: Springer New York. (10.1007/978-1-4614-1770-5\_13 http://dx.doi.org/10.1007/978-1-4614-1770-5\_13)

    2011 doi

  16. [24]

    Kammerer L, Kronberger G, Burlacu B, Winkler SM, Kommenda M, Affenzeller M. 2020 p. 79–99. In Symbolic Regression by Exhaustive Search: Reducing the Search Space Using Syntactical Constraints and Efficient Semantic Structure Deduplication , p. 79–99. Springer International Pub...

    2020 doi

  17. [25]

    1992 Genetic Programming: On the Programming of Computers by Means of Natural Selection

    Koza JR. 1992 Genetic Programming: On the Programming of Computers by Means of Natural Selection . Cambridge, MA, USA: MIT Press

    1992

  18. [26]

    2021 Contemporary Symbolic Regression Methods and their Relative Performance

    La Cava W, Orzechowski P, Burlacu B, de Franca F, Virgolin M, Jin Y, Kommenda M, Moore J. 2021 Contemporary Symbolic Regression Methods and their Relative Performance . In Vanschoren J, Yeung SK, editors, Proceedings of the Neural Information Processing Systems Track on Datase...

    2021

  19. [27]

    2024 SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert Interpretation

    de Franca FO, Virgolin M, Kommenda M, Majumder MS, Cranmer M, Espada G, Ingelse L, Fonseca A, Landajuela M, Petersen B, Glatt R, Mundhenk N, Lee CS, Hochhalter JD, Randall DL, Kamienny P, Zhang H, Dick G, Simon A, Burlacu B, Kasak J, Machado M, Wilstrup C, Cavaz WGL. 2024 SRBe...

    2024

  20. [28]

    2024 The Inefficiency of Genetic Programming for Symbolic Regression

    Kronberger G, Olivetti de Franca F, Desmond H, Bartlett DJ, Kammerer L. 2024 The Inefficiency of Genetic Programming for Symbolic Regression . In Affenzeller M, Winkler SM, Kononova AV, Trautmann H, Tušar T, Machado P, Bäck T, editors, Parallel Problem Solving from Nature – PP...

    2024

  21. [29]

    2015 An Efficient Structural Diversity Technique for Genetic Programming

    Burks AR, Punch WF. 2015 An Efficient Structural Diversity Technique for Genetic Programming . In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation GECCO '15 p. 991–998 New York, NY, USA. Association for Computing Machinery. (10.1145/2739480.275...

    2015

  22. [30]

    2021 Preserving Population Diversity Based on Transformed Semantics in Genetic Programming for Symbolic Regression

    Chen Q, Xue B, Zhang M. 2021 Preserving Population Diversity Based on Transformed Semantics in Genetic Programming for Symbolic Regression . Trans. Evol. Comp 25, 433–447. (10.1109/TEVC.2020.3046569 http://dx.doi.org/10.1109/TEVC.2020.3046569)

    2021

  23. [31]

    2020 Parameter identification for symbolic regression using nonlinear least squares

    Kommenda M, Burlacu B, Kronberger G, Affenzeller M. 2020 Parameter identification for symbolic regression using nonlinear least squares . Genetic Programming and Evolvable Machines 21, 471–501. Special Issue on Integrating numerical optimization methods with genetic programmin...

    2020 doi

  24. [32]

    2024 Revisiting Gradient-Based Local Search in Symbolic Regression

    Burlacu B, Winkler SM, Affenzeller M. 2024 Revisiting Gradient-Based Local Search in Symbolic Regression . In Winkler SM, Banzhaf W, Hu T, Lalejini A, editors, Genetic Programming Theory and Practice XXI Genetic and Evolutionary Computation p. 259–273 University of Michigan, U...

    2024 doi

  25. [33]

    2013 Exploration and exploitation in evolutionary algorithms: A survey

    Črepinšek M, Liu SH, Mernik M. 2013 Exploration and exploitation in evolutionary algorithms: A survey . ACM Comput. Surv. 45. (10.1145/2480741.2480752 http://dx.doi.org/10.1145/2480741.2480752)

    2013

  26. [34]

    2000 Finite population effects for ranking and tournament selection

    Prügel-Bennett A. 2000 Finite population effects for ranking and tournament selection . Complex Systems 12, 183–205

    2000

  27. [35]

    2011 Impacts of sampling strategies in tournament selection for genetic programming

    Xie H, Zhang M. 2011 Impacts of sampling strategies in tournament selection for genetic programming . Soft Computing 16, 615–633

    2011

  28. [36]

    1994 On the use of a directed acyclic graph to represent a population of computer programs

    Handley S. 1994 On the use of a directed acyclic graph to represent a population of computer programs . In Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence p. 154–159 vol.1. (10.1109/ICEC.1994.350024 http:/...

    1994

  29. [37]

    2004 Alternatives in Subtree Caching for Genetic Programming

    Keijzer M. 2004 Alternatives in Subtree Caching for Genetic Programming . In Keijzer M, O'Reilly UM, Lucas SM, Costa E, Soule T, editors, Genetic Programming 7th European Conference, EuroGP 2004, Proceedings vol. 3003 LNCS p. 328–337 Coimbra, Portugal. Springer-Verlag. (10.100...

    2004 doi

  30. [38]

    2025 Improving Genetic Programming for Symbolic Regression with Equality Graphs

    de Franca FO, Kronberger G. 2025 Improving Genetic Programming for Symbolic Regression with Equality Graphs . In Proceedings of the Genetic and Evolutionary Computation Conference GECCO '25 New York, NY, USA. Association for Computing Machinery. (10.1145/3712256.3726383 http:/...

    2025

  31. [39]

    2008 SCHEME: Caching subtrees in genetic programming

    Wong P, Zhang M. 2008 SCHEME: Caching subtrees in genetic programming . In 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) p. 2678–2685. (10.1109/CEC.2008.4631158 http://dx.doi.org/10.1109/CEC.2008.4631158)

    2008

  32. [40]

    1992 On the editing distance between unordered labeled trees

    Zhang K, Statman R, Shasha D. 1992 On the editing distance between unordered labeled trees . Information Processing Letters 42, 133–139. (10.1016/0020-0190(92)90136-J http://dx.doi.org/10.1016/0020-0190(92)90136-J)

    1992 doi

  33. [41]

    2019 Online Diversity Control in Symbolic Regression via a Fast Hash-based Tree Similarity Measure

    Burlacu B, Affenzeller M, Kronberger G, Kommenda M. 2019 Online Diversity Control in Symbolic Regression via a Fast Hash-based Tree Similarity Measure . In 2019 IEEE Congress on Evolutionary Computation (CEC) p. 2175–2182. (10.1109/CEC.2019.8790162 http://dx.doi.org/10.1109/CE...

    2019

  34. [42]

    2020 Operon C++: an efficient genetic programming framework for symbolic regression

    Burlacu B, Kronberger G, Kommenda M. 2020 Operon C++: an efficient genetic programming framework for symbolic regression . In Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion GECCO '20 p. 1562–1570 New York, NY, USA. Association for Computing M...

    2020

  35. [43]

    2019 The Parallel Hashmap

    Popovitch G. 2019 The Parallel Hashmap

    2019

  36. [44]

    2021 Scrambled Linear Pseudorandom Number Generators

    Blackman D, Vigna S. 2021 Scrambled Linear Pseudorandom Number Generators . ACM Trans. Math. Softw. 47. (10.1145/3460772 http://dx.doi.org/10.1145/3460772)

    2021 doi

  37. [45]

    2002 A fast and elitist multiobjective genetic algorithm: NSGA-II

    Deb K, Pratap A, Agarwal S, Meyarivan T. 2002 A fast and elitist multiobjective genetic algorithm: NSGA-II . IEEE Transactions on Evolutionary Computation 6, 182–197. (10.1109/4235.996017 http://dx.doi.org/10.1109/4235.996017)

    2002

  38. [46]

    2019 Minimum description length revisited

    Grünwald P, Roos T. 2019 Minimum description length revisited . International Journal of Mathematics for Industry 11. (10.1142/s2661335219300018 http://dx.doi.org/10.1142/s2661335219300018)

    2019 doi

  39. [47]

    2019 The Levenberg-Marquardt algorithm for nonlinear least squares curve-fitting problems

    Gavin HP. 2019 The Levenberg-Marquardt algorithm for nonlinear least squares curve-fitting problems . Department of Civil and Environmental Engineering Duke University August 3, 1–23

    2019

  40. [48]

    2008 Evolutionary Computation in the Chemical Industry

    Kordon A. 2008 Evolutionary Computation in the Chemical Industry . In Yu T, Davis D, Baydar C, Roy R, editors, Evolutionary Computation in Practice , Studies in Computational Intelligence , vol. 88, p. 245–262. Springer. (10.1007/978-3-540-75771-9\_11 http://dx.doi.org/10.1007...

    2008 doi

  41. [49]

    2021 Application of symbolic regression for constitutive modeling of plastic deformation

    Kabliman E, Kolody AH, Kronsteiner J, Kommenda M, Kronberger G. 2021 Application of symbolic regression for constitutive modeling of plastic deformation . Applications in Engineering Science 6, 100052. (10.1016/j.apples.2021.100052 http://dx.doi.org/10.1016/j.apples.2021.100052)

    2021

  42. [50]

    2018 Predicting friction system performance with symbolic regression and genetic programming with factor variables

    Kronberger G, Kommenda M, Promberger A, Nickel F. 2018 Predicting friction system performance with symbolic regression and genetic programming with factor variables . In Proceedings of the Genetic and Evolutionary Computation Conference GECCO '18 p. 1278–1285 New York, NY, USA...

    2018

  43. [51]

    2007 Battery data set

    Saha B, Goebel K. 2007 Battery data set . NASA AMES prognostics data repository

    2007

  44. [52]

    1950 Laws of flow in rough pipes

    Nikuradse J et al.. 1950 Laws of flow in rough pipes

    1950

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.