.png){kind=icon}
返回
Evolutionary Machine Learning With Minions: A Case Study in Feature Selection
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2021.3099289.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many decisions in a machine learning (ML) pipeline involve nondifferentiable and discontinuous objectives and search spaces. Examples include feature selection, model selection, and hyperparameter tuning, where candidate solutions in an outer optimization loop must be evaluated via a learning subsystem. Evolutionary algorithms (EAs) are prominent gradient-free methods to handle such tasks. However, EAs are known to pose steep computational challenges, especially when dealing with large-instance datasets. As opposed to prior works that often fall back on parallel computing hardware to resolve this big data problem of EAs, in this article, we propose a novel algorithm-centric solution based on evolutionary multitasking. Our approach involves the creation of a band of minions, i.e., small data proxies to the main target task, that are constructed by subsampling a fraction of the large dataset. We then combine the minions with the main task in a single multitask optimization framework, boosting evolutionary search by using small data to quickly optimize for the large dataset. Our key algorithmic contribution in this setting is to allocate computational resources to each of the tasks in a principled manner. The article considers wrapper-based feature selection as an illustrative case study of the broader idea of using multitasking to speedup outer loop evolutionary configurations of any ML subsystem. The experiments reveal that multitasking can indeed speedup baseline EAs, by more than 40% on some datasets.
Keyword:
Task analysis
Optimization
Feature extraction
Search problems
Multitasking
Tuning
Sociology
Evolutionary machine learning (ML)
evolutionary multitasking (EMT)
feature selection
resource allocation
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
分享收藏Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification高维分类特征选择的变长粒子群算法
OAAI
OAAI分享收藏A genetic algorithm-based method for feature subset selection一种基于遗传算法的特征子集选择方法.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏PSO with surrogate models for feature selection: static and dynamic clustering-based methods具有用于特征选择的代理模型的PSO: 基于静态和动态聚类的方法MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification
PREAI
分享收藏
查看更多内容