Metraipolis › archive › dc_a8539aef98e8
Efficient Constant Optimization for Symbolic Regression with GPU-Accelerated Tree-Based Genetic Programming — arXiv:2609.03352
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03352
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T01:47:29.502Z
- SHA-256 of the archived text
da0b4cb816eb69c5d7305a4f4f8874778aa84fcd7fc26510251703878e45cb2b- Stable URL of this page
https://metraipolis.com/documento/dc_a8539aef98e8
How to cite
Efficient Constant Optimization for Symbolic Regression with GPU-Accelerated Tree-Based Genetic Programming — arXiv:2609.03352 — arXiv (en), https://arxiv.org/abs/2609.03352 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a8539aef98e8 (Metraipolis archive dc_a8539aef98e8, sha256 da0b4cb816eb69c5d7305a4f4f8874778aa84fcd7fc26510251703878e45cb2b)
BibTeX
@misc{dca8539aef98e8,
title = {Efficient Constant Optimization for Symbolic Regression with GPU-Accelerated Tree-Based Genetic Programming — arXiv:2609.03352},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03352},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a8539aef98e8; sha256 da0b4cb816eb69c5d7305a4f4f8874778aa84fcd7fc26510251703878e45cb2b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03352. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Constant optimization refines the numerical coefficients of candidate expressions in tree-based genetic programming for symbolic regression. But its per-generation cost has led modern GPU-accelerated frameworks to omit it or restrict it to lightweight forms. We present a GPU-resident, batched Levenberg--Marquardt solver that optimizes constants across a structurally heterogeneous population of expression trees using a fixed number of population-wide CUDA launches per iteration. Reverse-mode automatic differentiation assembles the per-tree Jacobian in one backward sweep, making the dominant per-iteration cost independent of the number of constants per tree, and a double-precision delivery guard guarantees that returned constants are never worse than their initial values. On early-generation populations, the solver sustains up to $5.1{\times}10^{5}$ trees per second on an NVIDIA A100; at a GPU-saturated benchmark configuration it delivers roughly $9.9{\times}$ the throughput of Operon running on a 64-core EPYC 7763, while matching fp64-reference quality. Integrated in-process into EvoGP, the solver enables end-to-end search to recover governing equations on $10$ of $18$ constructed problems versus 0 for stock EvoGP. Our code is at this https URL .
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-04 in cs.DC).
Categorie arXiv: Neural and Evolutionary Computing (cs.NE) ; Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG); Mathematical Software (cs.MS).
Pagina del lavoro: https://arxiv.org/abs/2609.03352 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T01:12:01.344Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).