2021
DOI: 10.1016/j.asoc.2021.107198
|View full text |Cite
|
Sign up to set email alerts
|

Evolving simple and accurate symbolic regression models via asynchronous parallel computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…Future research can focus on finding the optimal balance in determining the number of neurons/codebooks. Genetic programming (GP) [9] autonomously generates models and searches for solutions, maintaining accuracy with increasing sizes. In this paper, the authors suggest a novel approach Asynchronous Parsimony Pressure Genetic Programming (APGP).…”
Section: Review Of Literaturementioning
confidence: 99%
“…Future research can focus on finding the optimal balance in determining the number of neurons/codebooks. Genetic programming (GP) [9] autonomously generates models and searches for solutions, maintaining accuracy with increasing sizes. In this paper, the authors suggest a novel approach Asynchronous Parsimony Pressure Genetic Programming (APGP).…”
Section: Review Of Literaturementioning
confidence: 99%
“…There are also cases where SR has been bound to reinforcement learning, and has been able to deal with dynamic tasks, with back-propagation capability [ 194 ] or even a dynamic process formulation [ 195 ]. Finally, since GP problems oftentimes require tons of computational time to complete, the evaluation time has been used as an estimate of model complexity and a new method is proposed to control it [ 196 ].…”
Section: Application In Science and Technologymentioning
confidence: 99%
“…In this section, the complexity of the proposed algorithm is analyzed in detail. Specifically, the study measures model complexity as the data complexity, model framework, the number of parameters and computational time (Sambo et al, 2021;Hu et al, 2021;Angerbauer et al, 2021).…”
Section: Model Complexitymentioning
confidence: 99%