Sampling on Random Subspaces under Limited Data in the Context of Exploratory Landscape Analysis
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic global optimization of continuous functions via random walks on Grassmannians
We introduce a stochastic global optimization method based on random walks on Grassmannian manifolds. To minimize a continuous objective $\ell:\mathbb{R}^d\rightarrow\mathbb{R}$, the method repeatedly samples random $k$-…
High-Dimensional Optimization in Adaptive Random Subspaces
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random sub…
Vocal Bursts Intensity PredictionAdaptive and Oblivious Randomized Subspace Methods for High-Dimensional Optimization: Sharp Analysis and Lower Bounds
We propose novel randomized optimization methods for high-dimensional convex problems based on restrictions of variables to random subspaces. We consider oblivious and data-adaptive subspaces and study their approximatio…
subspace methodsMaximum Likelihood Estimation based on Random Subspace EDA: Application to Extrasolar Planet Detection
This paper addresses maximum likelihood (ML) estimation based model fitting in the context of extrasolar planet detection. This problem is featured by the following properties: 1) the candidate models under consideration…
Hashing-Based Undersampling Ensemble for Imbalanced Pattern Classification Problems
Undersampling is a popular method to solve imbalanced classification problems. However, sometimes it may remove too many majority samples which may lead to loss of informative samples. In this article, the hashing-based …
ClassificationGeneral Classificationimbalanced classification