Quantum Annealing based Feature Selection in Machine Learning
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913591128489984 |
|---|---|
| author | Pranjic, Daniel Mummaneni, Bharadwaj Chowdary Tutschku, Christian |
| author_facet | Pranjic, Daniel Mummaneni, Bharadwaj Chowdary Tutschku, Christian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19609 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Annealing based Feature Selection in Machine Learning Pranjic, Daniel Mummaneni, Bharadwaj Chowdary Tutschku, Christian Quantum Physics 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. |
| title | Quantum Annealing based Feature Selection in Machine Learning |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2411.19609 |