.png){kind=icon}
返回
Memristor Parallel Computing for a Matrix-Friendly Genetic Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2022.3144419.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Matrix operation is easy to be paralleled by hardware, and the memristor network can realize a parallel matrix computing model with in-memory computing. This article proposes a matrix-friendly genetic algorithm (MGA), in which the population is represented by a matrix and the evolution of population is realized by matrix operations. Compared with the performance of a baseline genetic algorithm (GA) on solving the maximum value of the binary function, MGA can converge better and faster. In addition, MGA is more efficient because of its parallelism on matrix operations, and MGA runs 2.5 times faster than the baseline GA when using the NumPy library. Considering the advantages of the memristor in matrix operations, memristor circuits are designed for the deployment of MGA. This deployment method realizes the parallelization and in-memory computing (memristor is both memory and computing unit) of MGA. In order to verify the effectiveness of this deployment, a feature selection experiment of logistic regression (LR) on Sonar datasets is completed. LR with MGA-based feature selection uses 46 fewer features and achieves 11.9% higher accuracy.
Keyword:
Biological cells
Genetic algorithms
Memristors
Statistics
Sociology
Parallel processing
Computational modeling
Feature selection
genetic algorithms (GAs)
memristors
parallel computing
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
A Functional Hybrid Memristor Crossbar-Array/CMOS System for Data Storage and Neuromorphic Applications用于数据存储和神经形态应用的功能性混合忆阻器交叉阵列/CMOS系统.png)
NANO LETTERS
NANO LETTERSIF9.1
PREAI
分享收藏In situ learning using intrinsic memristor variability via Markov chain Monte Carlo sampling通过马尔可夫链蒙特卡罗采样使用本征忆阻器变异性进行原位学习NATURE ELECTRONICS
NATURE ELECTRONICSIF40.9
PREAI
分享收藏
分享收藏
查看更多内容