IET Quantum Communication

Quantum computer based feature selection in machine learning

Gerhard Hellstern, Vanessa Dehn, Martin Zaefferer

Published Feb 5, 2024• 11 citations

Abstract

Abstract The problem of selecting an appropriate number of features in supervised learning problems is investigated. Starting with common methods in machine learning, the feature selection task is treated as a quadratic unconstrained optimisation problem (QUBO), which can be tackled with classical numerical methods as well as within a quantum computing framework. The different results in small problem instances are compared. According to the results of the authors’ study, whether the QUBO method outperforms other feature selection methods depends on the data set. In an extension to a larger data set with 27 features, the authors compare the convergence behaviour of the QUBO methods via quantum computing with classical stochastic optimisation methods. Due to persisting error rates, the classical stochastic optimisation methods are still superior.

DOI: 10.1049/qtc2.12086

Related papers

Quantum computer based Feature Selection in Machine Learning

Gerhard Hellstern, Vanessa Dehn, Martin Zaefferer

The problem of selecting an appropriate number of features in supervised learning problems is investigated in this paper. Starting with common methods in machine learning, we treat the feature selection task as a quadratic unconstrained optimization problem (QUBO), which can be tackled with classical numerical methods as well as within a quantum computing framework. We compare the different results in small-sized problem setups. According to the results of our study, whether the QUBO method outperforms other feature selection methods depends on the data set. In an extension to a larger data set with 27 features, we compare the convergence behavior of the QUBO methods via quantum computing with classical stochastic optimization methods. Due to persisting error rates, the classical stochastic optimization methods are still superior.

arXiv:2306.10591Jun 18, 20232 citations

Feature selection on quantum computers

Sascha Mücke, Raoul Heese, Sabine Müller +2 more

Abstract In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.

arXiv:2203.13261Quantum Machine IntelligenceFeb 20, 202361 citations

Parametric Quantum Feature Selection Methods for Fraud and Default Detection

Sutapa Samanta, Dagen Wang, Todd Hodges +1 more

Feature selection plays an important role in improving the efficiency of machine learning models for credit card fraud and default detection. We formulate the feature selection problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which we solve using quantum annealers. We propose three new formulations based on this framework that improve the efficiency and flexibility of machine learning models. We benchmark the proposed methods, existing approaches from the literature, and also compare with classical feature-selection methods such as Random Forest feature importance and a combination of mutual information and Spearman correlation. Extensive experiments show that feature selection using quantum computers consistently performs better than the classical methods. Our experiments show the promise of using quantum computers in machine learning tasks in financial risk assessment applications.

Proceedings of the AAAI Symposium SeriesNov 23, 20252 citations

Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

Pomeroy, Chloe, Aleksandar Pramov, Karishma Thakrar +1 more

This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.

arXiv:2507.15063Jul 20, 20250 citations

A Collaborative Framework for Quantum Optimisation and Quantum Neural Networks: Credit Feature Selection and Image Classification

Long, JiaNing, Xuechen Liang

This paper investigates the efficacy of quantum computing in two distinct machine learning tasks: feature selection for credit risk assessment and image classification for handwritten digit recognition. For the first task, we address the feature selection challenge of the German Credit Dataset by formulating it as a Quadratic Unconstrained Binary Optimization (QUBO) problem, which is solved using quantum annealing to identify the optimal feature subset. Experimental results show that the resulting credit scoring model maintains high classification precision despite using a minimal number of features. For the second task, we focus on classifying handwritten digits 3 and 6 in the MNIST dataset using Quantum Neural Networks (QNNs). Through meticulous data preprocessing (downsampling, binarization), quantum encoding (FRQI and compressed FRQI), and the design of QNN architectures (CRADL and CRAML), we demonstrate that QNNs can effectively handle high-dimensional image data. Our findings highlight the potential of quantum computing in solving practical machine learning problems while emphasizing the need to balance resource expenditure and model efficacy.

arXiv:2509.11110Sep 14, 20250 citations

Quantum Annealing based Feature Selection in Machine Learning

Daniel Pranjić, Bharadwaj Chowdary Mummaneni, Christian Tutschku

Feature selection is crucial for enhancing the accuracy and efficiency of machine learning (ML) models. This work investigates the utility of quantum annealing for the feature selection process in an ML-pipeline, used for maximizing the mutual information (MI) or conditional mutual information (CMI) of the underlying feature space. Calculating the optimal set of features that maximize the MI or CMI is computationally intractable for large datasets on classical computers, even with approximative methods. This study employs a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) formulation, enabling its solution on a quantum annealer. We demonstrate the capability of this approach to identify the best feature combinations that maximize the MI or CMI. To showcase its real-world applicability, we solve the MIQUBO problem to forecast the prices of used excavators. Our results demonstrate that for datasets with a small MI concentration the MIQUBO approach can provide a significant improvement over MI-only based approaches, dependent on the dimension of the selected feature space.

arXiv:2411.19609Nov 29, 20240 citations