Quantum annealing-based feature selection

Feature selection is crucial for enhancing the accuracy and efficiency of machine learning models. This work investigates the possibility of the usefulness of a quantum annealer to tackle the challenge of selecting features based on maximizing mutual information (MI) and conditional mutual information (CMI). Calculating the optimal feature set for maximum MI and CMI remains computationally intractable for large datasets on classical computers, even with approximation methods. This study employs a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) formulation, enabling its solution on a quantum annealer. Importantly, the study demonstrates the relevancy of this approach in identifying the best feature combinations that maximizes the MI and CMI. To showcase its real-world applicability, we apply MIQUBO to forecasting the price of used excavators. Our results demonstrate that using the MIQUBO approach there is an improvement in the prediction of machine learning models for datasets, with a smaller MI concentration on a subset of all features. • Problem Addressed: We tackle the computationally difficult problem of feature selection for machine learning models, specifically by maximizing mutual information (MI) and conditional mutual information (CMI) between features and the target variable. • Proposed Solution: We employ the adiabatic quantum computation paradigm to tackle this problem. The study utilizes a hybrid annealing approach, specifically the D-Wave Kerberos framework, which combines classical and quantum algorithms to solve the complex optimization problem. The feature selection task is reformulated as a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) problem, which can be solved on a quantum annealer. • Real-World Application: The MIQUBO method is applied to a practical, real-world scenario: forecasting the prices of used excavators. • Key Findings: The research demonstrates that using the MIQUBO approach leads to an improvement in the prediction performance of machine learning models. This is particularly true for datasets where the mutual information is less concentrated on a small subset of features.

Authors

Institutions

Publication Details

Journal
Neurocomputing
Published
2025-10-15
DOI
https://doi.org/10.1016/j.neucom.2025.131673
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum annealing-based feature selection

Bharadwaj Chowdary Mummaneni, Christian Tutschku, Daniel Pranjić
Neurocomputing
Quantum Computing Algorithms and Architecture
article

Quantum annealing-based feature selection

Bharadwaj Chowdary Mummaneni, Christian Tutschku, Daniel Pranjić
article en

Abstract

Feature selection is crucial for enhancing the accuracy and efficiency of machine learning models. This work investigates the possibility of the usefulness of a quantum annealer to tackle the challenge of selecting features based on maximizing mutual information (MI) and conditional mutual information (CMI). Calculating the optimal feature set for maximum MI and CMI remains computationally intractable for large datasets on classical computers, even with approximation methods. This study employs a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) formulation, enabling its solution on a quantum annealer. Importantly, the study demonstrates the relevancy of this approach in identifying the best feature combinations that maximizes the MI and CMI. To showcase its real-world applicability, we apply MIQUBO to forecasting the price of used excavators. Our results demonstrate that using the MIQUBO approach there is an improvement in the prediction of machine learning models for datasets, with a smaller MI concentration on a subset of all features. • Problem Addressed: We tackle the computationally difficult problem of feature selection for machine learning models, specifically by maximizing mutual information (MI) and conditional mutual information (CMI) between features and the target variable. • Proposed Solution: We employ the adiabatic quantum computation paradigm to tackle this problem. The study utilizes a hybrid annealing approach, specifically the D-Wave Kerberos framework, which combines classical and quantum algorithms to solve the complex optimization problem. The feature selection task is reformulated as a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) problem, which can be solved on a quantum annealer. • Real-World Application: The MIQUBO method is applied to a practical, real-world scenario: forecasting the prices of used excavators. • Key Findings: The research demonstrates that using the MIQUBO approach leads to an improvement in the prediction performance of machine learning models. This is particularly true for datasets where the mutual information is less concentrated on a small subset of features.

NeurocomputingVol. 659
Fraunhofer Institute for Industrial Engineering (DE)
Openalex Percentile: Top 85%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.