Erik Hemberg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Erik Hemberg has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Una-May O'Reilly
Massachusetts Institute of Technology, Cambridge, MA, USA
40 shared publications - Jamal Toutouh
ITIS Software, Universidad de Málaga, Malaga, Spain
11 shared publications - Abdullah Al-Dujaili
CSAIL MIT USA
7 shared publications - Mario Alejandro Hevia Fajardo
University of Birmingham, Birmingham, United Kingdom
4 shared publications - Steven Jorgensen
MIT, Cambridge, USA
4 shared publications Una-May O'Reilly
Massachusetts Institute of Technology
4 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9553-9556
Artificial Intelligence for Data Engineering and Management Of Networked Systems (AI4DEMONS)
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9553-9556
Open AccessArtificial Intelligence for Data Engineering and Management Of Networked Systems (AI4DEMONS)
- 25 August 2026
- Published by Springer Nature
- p. 475-492
Coevolutionary Federated Learning with Differential Privacy
- 25 August 2026
- Published by Springer Nature
- p. 475-492
Coevolutionary Federated Learning with Differential Privacy
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 681-690
Discrete Self-Adaptation in Competitive Coevolution for Constrained Hardware
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 681-690
Open AccessDiscrete Self-Adaptation in Competitive Coevolution for Constrained Hardware
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1120-1128
Evolutionary Computation for Tax-Minimizing Strategies in Special Economic Zones
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1120-1128
Open AccessEvolutionary Computation for Tax-Minimizing Strategies in Special Economic Zones
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (2) , 1-37
Policy Search through Genetic Programming and LLM-assisted Curriculum Learning
Curriculum learning (CL) consists in using a diverse set of user-provided test cases, with varying levels of difficulty and organized in a suitable progression, for learning a policy. The quality of test cases is important to allow optimization techniques as genetic programming (GP) to solve policy search problems. In this work, we evaluate large language models (LLMs) as providers of test cases for GP-based policy search. We consider two policy search tasks, a single-player and a multi-player game, and four LLMs differing in complexity and specialization, which we prompt in order to generate suitable test cases for the two games. We experimentally assess the intrinsic quality of LLM-generated test cases and their utility when inserted in a curriculum consumed by a GP optimization. We evaluate the robustness of the approach with respect to the way cases are scheduled in curricula and with respect to the policy representation, for which we use both graphs and linear programs evolved by GP. We observe that the effectiveness of LLM-assisted CL depends on both the choice of LLM and the design of the prompting and scheduling strategies. These findings highlight important considerations for leveraging LLMs in automated curriculum design for GP-based optimization.
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Evolutionary Learning and Optimization
- Vol. 6 (2) , 1-37
Open AccessPolicy Search through Genetic Programming and LLM-assisted Curriculum Learning
Curriculum learning (CL) consists in using a diverse set of user-provided test cases, with varying levels of difficulty and organized in a suitable progression, for learning a policy. The quality of test cases is important to allow optimization techniques as genetic programming (GP) to solve policy search problems. In this work, we evaluate large language models (LLMs) as providers of test cases for GP-based policy search. We consider two policy search tasks, a single-player and a multi-player game, and four LLMs differing in complexity and specialization, which we prompt in order to generate suitable test cases for the two games. We experimentally assess the intrinsic quality of LLM-generated test cases and their utility when inserted in a curriculum consumed by a GP optimization. We evaluate the robustness of the approach with respect to the way cases are scheduled in curricula and with respect to the policy representation, for which we use both graphs and linear programs evolved by GP. We observe that the effectiveness of LLM-assisted CL depends on both the choice of LLM and the design of the prompting and scheduling strategies. These findings highlight important considerations for leveraging LLMs in automated curriculum design for GP-based optimization.
- 3 June 2026
- Published by Springer Nature
- p. 329-351
Spatial Genetic Programming with the S1 Processing Board
- 3 June 2026
- Published by Springer Nature
- p. 329-351
Spatial Genetic Programming with the S1 Processing Board
- 28 April 2026
- Published by Springer Nature
- p. 122-139
A Hybrid LLM-Coevolution Framework to Generate Abusive Tax Strategies
- 28 April 2026
- Published by Springer Nature
- p. 122-139
A Hybrid LLM-Coevolution Framework to Generate Abusive Tax Strategies
- Open Access
- 9 January 2026
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 15 (1) , 36
Low-Cost Deep Learning for Building Detection with Application to Informal Urban Planning
This article studies the application of deep neural networks for automatic building detection in aerial RGB images. Special focus is put on accuracy robustness in both well-structured and poorly planned urban scenarios, which pose significant challenges due to occlusions, irregular building layouts, and limited contextual cues. The applied methodology considers several CNNs using only RBG images as input, and both validation and transfer capabilities are studied. U-Net-based models achieve the highest single-model accuracy, with an Intersection over Union () of 0.9101. A soft-voting ensemble of the best U-Net models further increases performance, reaching a best ensemble of 0.9665, improving over state-of-the-art building detection methods on standard benchmarks. The approach demonstrates strong generalization using only RGB imagery, supporting scalable, low-cost applications in urban planning and geospatial analysis.- 9 January 2026
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 15 (1) , 36
Open AccessLow-Cost Deep Learning for Building Detection with Application to Informal Urban Planning
This article studies the application of deep neural networks for automatic building detection in aerial RGB images. Special focus is put on accuracy robustness in both well-structured and poorly planned urban scenarios, which pose significant challenges due to occlusions, irregular building layouts, and limited contextual cues. The applied methodology considers several CNNs using only RBG images as input, and both validation and transfer capabilities are studied. U-Net-based models achieve the highest single-model accuracy, with an Intersection over Union () of 0.9101. A soft-voting ensemble of the best U-Net models further increases performance, reaching a best ensemble of 0.9665, improving over state-of-the-art building detection methods on standard benchmarks. The approach demonstrates strong generalization using only RGB imagery, supporting scalable, low-cost applications in urban planning and geospatial analysis. - Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-95
Runtime Bounds for a Coevolutionary Algorithm on Classes of Potential Games
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 85-95
Open AccessRuntime Bounds for a Coevolutionary Algorithm on Classes of Potential Games
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 559-562
Evolutionary and Coevolutionary Multi-Agent Design Choices and Dynamics
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 559-562
Open AccessEvolutionary and Coevolutionary Multi-Agent Design Choices and Dynamics