arrow
Return

Quantum annealing-based feature selection

delete2025-10-15
delete0
delete
OA
AI
D
Daniel Pranjić *
B
Bharadwaj Chowdary Mummaneni
C
Christian Tutschku
DOI:10.1016/j.neucom.2025.131673delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
• 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.
Keywords:
Quantum annealing
Mutual information
Feature selection
Quadratic unconstrained binary optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

No organization information available