English

Sampling on Random Subspaces under Limited Data in the Context of Exploratory Landscape Analysis

Neural and Evolutionary Computing 2026-07-08 v1 Computational Engineering, Finance, and Science

Abstract

Classical space-filling designs often fail to provide reliable statistical results for Exploratory Landscape Analysis (ELA) when only limited evaluation budgets are available, as commonly occurs in high-dimensional problems or other resource-constrained settings, resulting in noisy and unstable landscape descriptors. To address this challenge, we propose an alternative sampling strategy for ELA based on random linear embeddings. Rather than sampling uniformly in the full decision space, we allocate the budget to randomly oriented low-dimensional subspaces and investigate whether this improves the robustness of the resulting landscape descriptors. We compare full-space and embedding-based sampling strategies across several classical ELA feature sets on the noiseless Black-Box Optimization Benchmarking (BBOB) test suite from the COmparing Continuous Optimizers (COCO) environment, in a 20-dimensional setting. Our results suggest that random linear embeddings constitute a promising alternative for budget-constrained ELA, although their effectiveness remains dependent on the feature class and the underlying problem.

Cite

@article{arxiv.2607.07854,
  title  = {Sampling on Random Subspaces under Limited Data in the Context of Exploratory Landscape Analysis},
  author = {Iván Olarte Rodríguez and Anja Jankovic and Thomas Bäck and Elena Raponi},
  journal= {arXiv preprint arXiv:2607.07854},
  year   = {2026}
}

Comments

17 pages, 6 figures, 1 table, Submitted and accepted at Parallel Problem Solving from Nature (PPSN) Conference 2026, Trento

R2 v1 2026-07-22T20:31:57.815Z