Feature Selection on Quantum Computers

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 higherquality 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 datasets. We observe competitive performance.

30 pages

References in corpus (2)

• Mathematical Foundation of Quantum Annealing
• Quantum Annealing for Combinatorial Clustering

Cited by in corpus (7)

• Quantum computing for finance
• Opportunities and challenges of quantum computing for climate modelling
• An Advantage Using Feature Selection with a Quantum Annealer
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications
• Empirical Power of Quantum Encoding Methods for Binary Classification
• Standardization of Multi-Objective QUBOs
• Quantum feature-map learning with reduced resource overhead