TPAM: A Simulation-Based Model for Quantitatively Analyzing Parameter Adaptation Methods

2020-10-05 · Ryoji Tanabe, Alex Fukunaga

While a large number of adaptive Differential Evolution (DE) algorithms have been proposed, their Parameter Adaptation Methods (PAMs) are not well understood. We propose a Target function-based PAM simulation (TPAM) framework for evaluating the tracking performance of PAMs. The proposed TPAM simulation framework measures the ability of PAMs to track predefined target parameters, thus enabling quantitative analysis of the adaptive behavior of PAMs. We evaluate the tracking performance of PAMs of widely used five adaptive DEs (jDE, EPSDE, JADE, MDE, and SHADE) on the proposed TPAM, and show that TPAM can provide important insights on PAMs, e.g., why the PAM of SHADE performs better than that of JADE, and under what conditions the PAM of EPSDE fails at parameter adaptation.

📄 PDF Abstract BibTeX arXiv:2010.01877

Code (0)

등록된 구현이 없습니다.

BanditPAM++: Faster $k$-medoids Clustering

2023-09-21 · NeurIPS 2023 11

Clustering is a fundamental task in data science with wide-ranging applications. In $k$-medoids clustering, cluster centers must be actual datapoints and arbitrary distance metrics may be used; these features allow for g…

Tensor Polynomial Additive Model

2024-06-05 · Yang Chen, Ce Zhu, Jiani Liu, Yipeng Liu

Additive models can be used for interpretable machine learning for their clarity and simplicity. However, In the classical models for high-order data, the vectorization operation disrupts the data structure, which may le…

Additive models Decision Making Interpretable Machine Learning model

Robust computation with rhythmic spike patterns

2019-01-23 · E. Paxon Frady, Friedrich T. Sommer

Information coding by precise timing of spikes can be faster and more energy-efficient than traditional rate coding. However, spike-timing codes are often brittle, which has limited their use in theoretical neuroscience …

Large Scale Clustering with Variational EM for Gaussian Mixture Models

2018-10-01 · Florian Hirschberger, Dennis Forster, Jörg Lücke

This paper represents a preliminary (pre-reviewing) version of a sublinear variational algorithm for isotropic Gaussian mixture models (GMMs). Further developments of the algorithm for GMMs with diagonal covariance matri…

Benchmarking Clustering Quantization

BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits

2020-12-01 · NeurIPS 2020 12 · Mo Tiwari, Martin J. Zhang, James Mayclin, Sebastian Thrun 외

Clustering is a ubiquitous task in data science. Compared to the commonly used k-means clustering, k-medoids clustering requires the cluster centers to be actual data points and supports arbitrary distance metrics, which…

Clustering Multi-Armed Bandits