Explorative Data Analysis of Time Series based AlgorithmFeatures of CMA-ES Variants

2021-04-16 · Jacob de Nobel, Hao Wang, Thomas Bäck

In this study, we analyze behaviours of the well-known CMA-ES by extracting the time-series features on its dynamic strategy parameters. An extensive experiment was conducted on twelve CMA-ES variants and 24 test problems taken from the BBOB (Black-Box Optimization Bench-marking) testbed, where we used two different cutoff times to stop those variants. We utilized the tsfresh package for extracting the features and performed the feature selection procedure using the Boruta algorithm, resulting in 32 features to distinguish either CMA-ES variants or the problems. After measuring the number of predefined targets reached by those variants, we contrive to predict those measured values on each test problem using the feature. From our analysis, we saw that the features can classify the CMA-ES variants, or the function groups decently, and show a potential for predicting the performance of those variants. We conducted a hierarchical clustering analysis on the test problems and noticed a drastic change in the clustering outcome when comparing the longer cutoff time to the shorter one, indicating a huge change in search behaviour of the algorithm. In general, we found that with longer time series, the predictive power of the time series features increase.

📄 PDF Abstract BibTeX arXiv:2104.08098

Code (0)

등록된 구현이 없습니다.

Tasks

Clusteringfeature selectionTime SeriesTime Series Analysis

Methods 이 논문이 사용한 방법론

Feature Selection Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables,…

An Ordinal Pattern Approach to Detect and to Model Leverage Effects and Dependence Structures Between Financial Time Series

2015-01-29

We introduce two types of ordinal pattern dependence between time series. Positive (resp. negative) ordinal pattern dependence can be seen as a non-paramatric and in particular non-linear counterpart to positive (resp. n…

Time Series Time Series Analysis

DeepSEE: Deep Disentangled Semantic Explorative Extreme Super-Resolution

2020-04-09 · Marcel C. Bühler, Andrés Romero, Radu Timofte

Super-resolution (SR) is by definition ill-posed. There are infinitely many plausible high-resolution variants for a given low-resolution natural image. Most of the current literature aims at a single deterministic solut…

Face Hallucination Super-Resolution

Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Sampling

2021-04-30 · Simen Eide, David S. Leslie, Arnoldo Frigessi

We consider the problem of recommending relevant content to users of an internet platform in the form of lists of items, called slates. We introduce a variational Bayesian Recurrent Neural Net recommender system that act…

Recommendation Systems Thompson Sampling Time Series Analysis

Variational Adaptive-Newton Method for Explorative Learning

2017-11-15 · Mohammad Emtiyaz Khan, Wu Lin, Voot Tangkaratt, Zuozhu Liu 외

We present the Variational Adaptive Newton (VAN) method which is a black-box optimization method especially suitable for explorative-learning tasks such as active learning and reinforcement learning. Similar to Bayesian …

Active Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+1

Gaze Distribution Analysis and Saliency Prediction Across Age Groups

2017-05-20 · Onkar Krishna, Kiyoharu Aizawa, Andrea Helo, Rama Pia

Knowledge of the human visual system helps to develop better computational models of visual attention. State-of-the-art models have been developed to mimic the visual attention system of young adults that, however, large…

Prediction Saliency Prediction