Feature selection is an essential step for reducing complexity of high dimensional data, usually in preparation for developing machine learning models such as computational biomarkers. However, there are limitations associated with feature selection such as for metabolomic data where there are hundreds or even thousands of features per study participant, while the available number of participants in a clinical trials is limited. Classical methods such as exhaustive search require evaluation of all possible feature combinations, making them costly in terms of computation and runtime, or even infeasible, as feature dimensionality increases. In this study, we propose a novel Quadratic Unconstrained Binary Optimization (QUBO) coefficient formulation and pose metabolomic feature selection as a QUBO problem that selects a specified number of features by balancing their relevance against redundancy among the selected variables. To evaluate our proposed QUBO objective function, we conducted a Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Feature selection is an essential step for reducing complexity of high dimensional data, usually in preparation for developing machine learning models such as computational biomarkers. However, there are limitations associated with feature selection such as for metabolomic data where there are hundreds or even thousands of features per study participant, while the available number of participants in a clinical trials is limited. Classical methods such as exhaustive search require evaluation of all possible feature combinations, making them costly in terms of computation and runtime, or even infeasible, as feature dimensionality increases. In this study, we propose a novel Quadratic Unconstrained Binary Optimization (QUBO) coefficient formulation and pose metabolomic feature selection as a QUBO problem that selects a specified number of features by balancing their relevance against redundancy among the selected variables. To evaluate our proposed QUBO objective function, we conducted a Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Feature selection is an essential step for reducing complexity of high dimensional data, usually in preparation for developing machine learning models such as computational biomarkers. However, there are limitations associated with feature selection such as for metabolomic data where there are hundreds or even thousands of features per study participant, while the available number of participants in a clinical trials is limited. Classical methods such as exhaustive search require evaluation of all possible feature combinations, making them costly in terms of computation and runtime, or even infeasible, as feature dimensionality increases. In this study, we propose a novel Quadratic Unconstrained Binary Optimization (QUBO) coefficient formulation and pose metabolomic feature selection as a QUBO problem that selects a specified number of features by balancing their relevance against redundancy among the selected variables. To evaluate our proposed QUBO objective function, we conducted a series of experiments using Bias-Field Digitized Counterdiabatic Quantum Optimization (BF-DCQO) and Quantum Approximate Optimization Algorithm (QAOA) on a quantum gate based computer. We also compared the method to several classical methods on three metabolomic datasets associated with Autism Spectrum Disorder (ASD) on a classical computer. Our method reduces runtime compared with exhaustive search and Iterative Tabu Search (ITS) and achieves competitive performance across classifiers compared to classical filter, wrapper, and embedded methods. These results do not claim quantum advantage; rather, they establish hardware feasibility and demonstrate the current capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices.
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.
As the volume of data for classification tasks in machine learning grows, feature selection plays an increasingly crucial role in enhancing the efficiency and effectiveness of these tasks. Existing classical feature selection algorithms often encounter challenges, such as high computational complexity and vulnerability to local optima. Quantum algorithms have been proposed to overcome these limitations. Here, our work proposes a new approach that combines the Quantum Approximate Optimization Algorithm (QAOA) with the classical feature selection algorithm Maximum Relevance-Minimum Redundancy (MRMR). First, we transform the feature selection problem into the Quadratic Unconstrained Binary Optimization (QUBO) problem. Then, we map the QUBO formulation to Hamiltonian with the Ising model. Finally, we employ QAOA with a shallow circuit to search this Hamiltonian's ground state, which matches the specific solution for feature selection. We conducted numerical experiments on eight real-world datasets for classification tasks from diverse domains, including finance, medicine, and natural hazards. Experiment results suggest that QAOA-selected feature subsets size are typically less than half the complete set while achieving comparable or better classification accuracy than classical MRMR, demonstrating its preference for smaller, more efficient feature subsets.
Abstract Feature selection is a commonly used method in biomedical artificial intelligence and machine learning to identify a subset of high-quality variables that can be used to train downstream predictive models. It has been suggested that quantum feature selection (QFS), which takes advantage of the properties of quantum computers, may better identify variables that are correlated with the outcome while simultaneously reducing redundancy between selected variables. However, there are a limited number of studies evaluating their performance, particularly in real-world data sets. Here, we assess the performance of two QFS methods compared to random forest (RF) feature selection based on feature stability and the performance of a downstream classification algorithm when used to predict urinary tract infections in the emergency department from 211 original features extracted from the electronic health record. We found that a quantum binary quadratic model (BQM) and constrained quadratic model (CQM) had similar performance to RF feature selection (median F1 score of 0.60, 0.61, and 0.61 respectively) when 10 features were selected for an XGBoost classification model. The BQM and RF also had similar feature stability (0.91 and 0.94, respectively) while the CQM had lower stability (0.72). These findings show that QFS can be used with large, clinical data sets to identify features with high stability and predictive performance. As the capacity and quality of quantum computers continue to increase, these methods may offer additional benefits to classical feature selection methods.
Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The rapid explosion of medical image data poses a significant challenge to reliable disease Classification with high-dimensional feature spaces and intricate inter-feature correlations. In this paper, a new quantum annealing-inspired framework for optimal feature subset selection, specifically tailored to improve medical image Classification. In contrast to traditional filter, wrapper, or embedded techniques that tend to ignore redundancy and feature interactions, our solution poses feature selection as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solves it effectively using D-Wave quantum annealer hardware. The presented approach makes three primary contributions: (i) a QUBO formulation that captures feature importance, redundancy suppression, and interaction synergy simultaneously, (ii) a hybrid quantum-classical pipeline with embedding, decomposition, and chain strength optimization for efficient execution on existing quantum hardware, and (iii) a comprehensive evaluation on three heterogeneous medical imaging datasets—diabetic retinopathy, breast cancer histopathology, and chest X-ray pneumonia. Experimental findings exhibit uniform improvements in Classification performance (up to 12.1%), drastic feature reduction (65–80%), and much reduced computational time over six state-of-the-art classical approaches. With the exposure of clinically relevant features and robust statistical significance across benchmarks, our approach places quantum annealing as an influential and scalable tool for future medical AI applications.