Improved Differential Evolution based Feature Selection through Quantum, Chaos, and Lasso

Yelleti Vivek, Sri Krishna Vadlamani, Vadlamani Ravi, P. Radha Krishna
{"title":"Improved Differential Evolution based Feature Selection through Quantum, Chaos, and Lasso","authors":"Yelleti Vivek, Sri Krishna Vadlamani, Vadlamani Ravi, P. Radha Krishna","doi":"arxiv-2408.10693","DOIUrl":null,"url":null,"abstract":"Modern deep learning continues to achieve outstanding performance on an\nastounding variety of high-dimensional tasks. In practice, this is obtained by\nfitting deep neural models to all the input data with minimal feature\nengineering, thus sacrificing interpretability in many cases. However, in\napplications such as medicine, where interpretability is crucial, feature\nsubset selection becomes an important problem. Metaheuristics such as Binary\nDifferential Evolution are a popular approach to feature selection, and the\nresearch literature continues to introduce novel ideas, drawn from quantum\ncomputing and chaos theory, for instance, to improve them. In this paper, we\ndemonstrate that introducing chaos-generated variables, generated from\nconsiderations of the Lyapunov time, in place of random variables in\nquantum-inspired metaheuristics significantly improves their performance on\nhigh-dimensional medical classification tasks and outperforms other approaches.\nWe show that this chaos-induced improvement is a general phenomenon by\ndemonstrating it for multiple varieties of underlying quantum-inspired\nmetaheuristics. Performance is further enhanced through Lasso-assisted feature\npruning. At the implementation level, we vastly speed up our algorithms through\na scalable island-based computing cluster parallelization technique.","PeriodicalId":501347,"journal":{"name":"arXiv - CS - Neural and Evolutionary Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Neural and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.10693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Modern deep learning continues to achieve outstanding performance on an astounding variety of high-dimensional tasks. In practice, this is obtained by fitting deep neural models to all the input data with minimal feature engineering, thus sacrificing interpretability in many cases. However, in applications such as medicine, where interpretability is crucial, feature subset selection becomes an important problem. Metaheuristics such as Binary Differential Evolution are a popular approach to feature selection, and the research literature continues to introduce novel ideas, drawn from quantum computing and chaos theory, for instance, to improve them. In this paper, we demonstrate that introducing chaos-generated variables, generated from considerations of the Lyapunov time, in place of random variables in quantum-inspired metaheuristics significantly improves their performance on high-dimensional medical classification tasks and outperforms other approaches. We show that this chaos-induced improvement is a general phenomenon by demonstrating it for multiple varieties of underlying quantum-inspired metaheuristics. Performance is further enhanced through Lasso-assisted feature pruning. At the implementation level, we vastly speed up our algorithms through a scalable island-based computing cluster parallelization technique.
通过量子、混沌和拉索改进基于差分进化的特征选择
现代深度学习不断在各种高维任务中取得出色的性能。在实践中,这是通过将深度神经模型与所有输入数据相匹配,并尽量减少特征工程来实现的,因此在很多情况下牺牲了可解释性。然而,在医学等应用中,可解释性至关重要,特征子集的选择就成了一个重要问题。二元差分进化论等元搜索算法是一种流行的特征选择方法,研究文献不断引入量子计算和混沌理论等新思想对其进行改进。在本文中,我们证明了在量子启发元heuristics中引入混沌生成的变量(由Lyapunov时间的考虑而生成)来代替随机变量,可以显著提高它们在高维医学分类任务中的性能,并且优于其他方法。通过 Lasso 辅助特征剪枝,性能得到了进一步提升。在实现层面,我们通过可扩展的岛式计算集群并行化技术大大加快了算法的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信