paper-with-me

Papers

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

2024-08-20 · Yelleti Vivek, Sri Krishna Vadlamani, Vadlamani Ravi, P. Radha Krishna

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.

📄 PDF Abstract BibTeX arXiv:2408.10693

Code (0)

등록된 구현이 없습니다.

Tasks

Feature Engineeringfeature selection

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Online Sparse Feature Selection in Data Streams via Differential Evolution

2025-11-24 · Ruiyang Xu arxiv

The processing of high-dimensional streaming data commonly utilizes online streaming feature selection (OSFS) techniques. However, practical implementations often face challenges with data incompleteness due to equipment…

Feature Importance

A novel mutation operator based on the union of fitness and design spaces information for Differential Evolution

2015-10-08 · H. Sharifi Noghabi, H. Rajabi Mashhadi, K. Shojaei

Differential Evolution (DE) is one of the most successful and powerful evolutionary algorithms for global optimization problem. The most important operator in this algorithm is mutation operator which parents are selecte…

Evolutionary Algorithmsglobal-optimization

Differential Evolution with Generalized Mutation Operator for Parameters Optimization in Gene Selection for Cancer Classification

2015-10-08 · H. Sharifi Noghabi, H. Rajabi Mashhadi, K. Shojaei

Differential Evolution (DE) proved to be one of the most successful evolutionary algorithms for global optimization purposes in continuous problems. The core operator in DE is mutation which can provide the algorithm wit…

Cancer ClassificationEvolutionary Algorithmsfeature selectionGeneral Classification+1

Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution

2024-03-04 · Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen 외

Evolutionary algorithms, such as Differential Evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating …

Deep Reinforcement LearningEvolutionary AlgorithmsScheduling

Feature subset selection for Big Data via Chaotic Binary Differential Evolution under Apache Spark

2022-02-08 · Yelleti Vivek, Vadlamani Ravi, P. Radhakrishna

Feature subset selection (FSS) using a wrapper approach is essentially a combinatorial optimization problem having two objective functions namely cardinality of the selected-feature-subset, which should be minimized and …

Combinatorial Optimization