Sebastian Rojas Gonzalez
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
Sebastian Rojas Gonzalez has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Ivo Couckuyt
Ghent University, Ghent, Belgium
11 shared publications - Inneke Van Nieuwenhuyse
FlandersMake@UHasselt and Data Science Institute, Hasselt University, Hasselt, Belgium
6 shared publications - Alejandro Morales-Hernández
Research Group Logistics Hasselt University Belgium
5 shared publications - Juergen Branke
University of Warwick, Coventry, United Kingdom
5 shared publications - Bart Van Doninck
Flanders Make
3 shared publications - Jeroen Jordens
Flanders Make
3 shared publications
Latest Publications
- 24 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Prediction of reflection responses for randomized free-form antenna designs using a convolutional neural network
- 24 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Prediction of reflection responses for randomized free-form antenna designs using a convolutional neural network
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1457-1464
Peeling Back the Pixels: Stabilizing Latent Diffusion for Data-Efficient Generation of Pineapple Fields
While Latent Diffusion Models (LDMs) excel at synthetic data generation, they suffer from severe training instability on the small, homogeneous UAV datasets typical of precision agriculture. In this work, we investigate these architectural bottlenecks by training a Denoising Diffusion Probabilistic Model (DDPM) from scratch on constrained pineapple plantation imagery. Our systematic comparison reveals that continuous latent spaces (β-VAE) preserve complex crop structures, whereas discrete architectures (VQ-VAE) fail under scarce data conditions. Additionally, we demonstrate that replacing destabilizing global attention mechanisms with a purely convolutional U-Net backbone ensures smooth convergence in repetitive visual domains. Ultimately, combining this robust architecture with DDIM sampling yields a stable, highly efficient framework for low-data agricultural image synthesis. Code and models will be available at https://github.com/imagine-laboratory/Latent-Diffusion.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1457-1464
Open AccessPeeling Back the Pixels: Stabilizing Latent Diffusion for Data-Efficient Generation of Pineapple Fields
While Latent Diffusion Models (LDMs) excel at synthetic data generation, they suffer from severe training instability on the small, homogeneous UAV datasets typical of precision agriculture. In this work, we investigate these architectural bottlenecks by training a Denoising Diffusion Probabilistic Model (DDPM) from scratch on constrained pineapple plantation imagery. Our systematic comparison reveals that continuous latent spaces (β-VAE) preserve complex crop structures, whereas discrete architectures (VQ-VAE) fail under scarce data conditions. Additionally, we demonstrate that replacing destabilizing global attention mechanisms with a purely convolutional U-Net backbone ensures smooth convergence in repetitive visual domains. Ultimately, combining this robust architecture with DDIM sampling yields a stable, highly efficient framework for low-data agricultural image synthesis. Code and models will be available at https://github.com/imagine-laboratory/Latent-Diffusion.
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 213-216
Multiobjective Evolutionary Calibration of Uncertainty Quantification for Large Language Models
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 213-216
Open AccessMultiobjective Evolutionary Calibration of Uncertainty Quantification for Large Language Models
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 253-256
Evolutionary Multi-Objective Calibration of MC-Dropout Predictive Uncertainty Quantification for Diabetic Retinopathy
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 253-256
Open AccessEvolutionary Multi-Objective Calibration of MC-Dropout Predictive Uncertainty Quantification for Diabetic Retinopathy
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1465-1473
Evolutionary Optimization of Instruction-Tuned Large Language Model Inference Parameters for Spanish Text Simplification
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1465-1473
Open AccessEvolutionary Optimization of Instruction-Tuned Large Language Model Inference Parameters for Spanish Text Simplification
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1669-1687
Bayesian Optimization
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1669-1687
Open AccessBayesian Optimization
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 511-519
Bi-objective Stochastic Simulation Optimization on Integer Lattices via Scalarization
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 511-519
Open AccessBi-objective Stochastic Simulation Optimization on Integer Lattices via Scalarization
- 30 September 2025
- Published by Wiley in Journal of Multi-Criteria Decision Analysis
- Vol. 32 (3)
Bayesian Preference Elicitation for Decision Support in Multi‐Objective Optimization
We present a novel approach to help decision‐makers efficiently identify preferred solutions from the Pareto set of a multi‐objective optimization problem. Our method uses a Bayesian model to estimate the decision‐maker's utility function based on pairwise comparisons. Aided by this model, a principled elicitation strategy selects queries interactively to balance exploration and exploitation, guiding the discovery of high‐utility solutions. The approach is flexible: it can be used interactively or a posteriori after estimating the Pareto front through standard multi‐objective optimization techniques. Additionally, at the end of the elicitation phase, it generates a reduced menu of high‐quality solutions, simplifying the decision‐making process. Through experiments on test problems with up to nine objectives, our method demonstrates superior performance in finding high‐utility solutions with a small number of queries. We also provide an open‐source implementation of our method to support its adoption by the broader community.
- 30 September 2025
- Published by Wiley in Journal of Multi-Criteria Decision Analysis
- Vol. 32 (3)
Bayesian Preference Elicitation for Decision Support in Multi‐Objective Optimization
We present a novel approach to help decision‐makers efficiently identify preferred solutions from the Pareto set of a multi‐objective optimization problem. Our method uses a Bayesian model to estimate the decision‐maker's utility function based on pairwise comparisons. Aided by this model, a principled elicitation strategy selects queries interactively to balance exploration and exploitation, guiding the discovery of high‐utility solutions. The approach is flexible: it can be used interactively or a posteriori after estimating the Pareto front through standard multi‐objective optimization techniques. Additionally, at the end of the elicitation phase, it generates a reduced menu of high‐quality solutions, simplifying the decision‐making process. Through experiments on test problems with up to nine objectives, our method demonstrates superior performance in finding high‐utility solutions with a small number of queries. We also provide an open‐source implementation of our method to support its adoption by the broader community.
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1006-1024
Bayesian Optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1006-1024
Open AccessBayesian Optimization
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 363-366
Targeting Evaluation, Computation and Interaction Costs in Expensive Black-Box Multi-Objective Optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 363-366
Open AccessTargeting Evaluation, Computation and Interaction Costs in Expensive Black-Box Multi-Objective Optimization