Metraipolis › archive › dc_ea40ed54725a
Random Symbolic Boosting: A Geometric Approach to Symbolic Regression — arXiv:2611.08753
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08753
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:34:32.469Z
- SHA-256 of the archived text
4d17f53c4fc0ed92745e515141ee73dba83b7561a3818a7fcfbbc666030f49ac- Stable URL of this page
https://metraipolis.com/documento/dc_ea40ed54725a
How to cite
Random Symbolic Boosting: A Geometric Approach to Symbolic Regression — arXiv:2611.08753 — arXiv (en), https://arxiv.org/abs/2611.08753 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea40ed54725a (Metraipolis archive dc_ea40ed54725a, sha256 4d17f53c4fc0ed92745e515141ee73dba83b7561a3818a7fcfbbc666030f49ac)
BibTeX
@misc{dcea40ed54725a,
title = {Random Symbolic Boosting: A Geometric Approach to Symbolic Regression — arXiv:2611.08753},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08753},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea40ed54725a; sha256 4d17f53c4fc0ed92745e515141ee73dba83b7561a3818a7fcfbbc666030f49ac},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08753. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Symbolic models offer interpretability, but their construction through generational evolution can be computationally expensive. This article presents Random Symbolic Boosting (RSB), a method that constructs explicit additive symbolic models via boosting over populations of randomly generated syntax trees, eliminating the need for generational evolution. The idea combines two observations: high-dimensional spaces can be spanned by enough linearly independent vectors, and the semantics of syntax trees can be directly manipulated as such vectors. It is shown that, for Ordinary Least Squares, the boosting process guarantees a monotonic reduction of the training error for both regression and classification. Furthermore, an adaptive geometric early stopping mechanism is introduced. It is based on the angle between the prediction and target vectors, is independent of the problems scale, and requires no adjustments across tasks. Evaluated on a standard benchmark for symbolic regression, the method is located at the Pareto-optimal point between predictive accuracy and training time, ranking first on the real-world datasets. Additionally, it was tested on a large tabular classification benchmark with 200 problems, achieving competitive results. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2611.08753 — 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-11-09T22:30:47.305Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).