David de la Hoz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
David de la Hoz has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Manrique
Universidad Politécnica de Madrid, Spain
1 shared publication - Dolores Barrios Rolania
ETSI Industriales, Universidad Politécnica de Madrid, Madrid, Spain
1 shared publication - Pablo Ramos Criado
Aturing Research, Salamanca, Spain
1 shared publication
Latest Publications
- 2 December 2024
- Published by MIT Press in Evolutionary Computation
- Vol. 32 (4) , 339-370
Estimation of Distribution Algorithm for Grammar-Guided Genetic Programming
Genetic variation operators in grammar-guided genetic programming are fundamental to guide the evolutionary process in search and optimization problems. However, they show some limitations, mainly derived from an unbalanced exploration and local-search trade-off. This paper presents an estimation of distribution algorithm for grammar-guided genetic programming to overcome this difficulty and thus increase the performance of the evolutionary algorithm. Our proposal employs an extended dynamic stochastic context-free grammar to encode and calculate the estimation of the distribution of the search space from some promising individuals in the population. Unlike traditional estimation of distribution algorithms, the proposed approach improves exploratory behavior by smoothing the estimated distribution model. Therefore, this algorithm is referred to as SEDA, smoothed estimation of distribution algorithm. Experiments have been conducted to compare overall performance using a typical genetic programming crossover operator, an incremental estimation of distribution algorithm, and the proposed approach after tuning their hyperparameters. These experiments involve challenging problems to test the local search and exploration features of the three evolutionary systems. The results show that grammar-guided genetic programming with SEDA achieves the most accurate solutions with an intermediate convergence speed.
- 2 December 2024
- Published by MIT Press in Evolutionary Computation
- Vol. 32 (4) , 339-370
Estimation of Distribution Algorithm for Grammar-Guided Genetic Programming
Genetic variation operators in grammar-guided genetic programming are fundamental to guide the evolutionary process in search and optimization problems. However, they show some limitations, mainly derived from an unbalanced exploration and local-search trade-off. This paper presents an estimation of distribution algorithm for grammar-guided genetic programming to overcome this difficulty and thus increase the performance of the evolutionary algorithm. Our proposal employs an extended dynamic stochastic context-free grammar to encode and calculate the estimation of the distribution of the search space from some promising individuals in the population. Unlike traditional estimation of distribution algorithms, the proposed approach improves exploratory behavior by smoothing the estimated distribution model. Therefore, this algorithm is referred to as SEDA, smoothed estimation of distribution algorithm. Experiments have been conducted to compare overall performance using a typical genetic programming crossover operator, an incremental estimation of distribution algorithm, and the proposed approach after tuning their hyperparameters. These experiments involve challenging problems to test the local search and exploration features of the three evolutionary systems. The results show that grammar-guided genetic programming with SEDA achieves the most accurate solutions with an intermediate convergence speed.