Evolutionary quantum feature selection

• URL: http://arxiv.org/abs/2303.07131v1
• Date: Mon, 13 Mar 2023 14:01:37 GMT
• Title: Evolutionary quantum feature selection
• Authors: Anton S. Albino, Otto M. Pires, Mauro Q. Nooblath, Erick G. S. Nascimento
• Abstract summary: In this study, we present an innovative called Quantum Feature Selection (EQFS) that employs the Quantum Circuit Evolution (QCE) algorithm. Our approach harnesses the unique capabilities of QCE, which utilizes shallow depth circuits to generate sparse probability distributions. Our computational experiments demonstrate that EQFS can identify good feature combinations with quadratic scaling in the number of features.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Effective feature selection is essential for enhancing the performance of artificial intelligence models. It involves identifying feature combinations that optimize a given metric, but this is a challenging task due to the problem's exponential time complexity. In this study, we present an innovative heuristic called Evolutionary Quantum Feature Selection (EQFS) that employs the Quantum Circuit Evolution (QCE) algorithm. Our approach harnesses the unique capabilities of QCE, which utilizes shallow depth circuits to generate sparse probability distributions. Our computational experiments demonstrate that EQFS can identify good feature combinations with quadratic scaling in the number of features. To evaluate EQFS's performance, we counted the number of times a given classical model assesses the cost function for a specific metric, as a function of the number of generations.

Related papers

• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• A novel feature selection method based on quantum support vector machine [3.6953740776904924]
  Feature selection is critical in machine learning to reduce dimensionality and improve model accuracy and efficiency. We propose a novel method, quantum support vector machine feature selection (QSVMF), integrating quantum support vector machines with genetic algorithm. We apply QSVMF for feature selection on a breast cancer dataset, comparing the performance of QSVMF against classical approaches.
  arXiv  Detail & Related papers  (2023-11-29T14:08:26Z)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Variational Quantum Linear Solver enhanced Quantum Support Vector Machine [3.206157921187139]
  We propose a novel approach called the Variational Quantum Linear solver (VQLS) enhanced QSVM. This is built upon our idea of utilizing the variational quantum linear solver to solve system of linear equations of a least squares-SVM on a NISQ device. The implementation of our approach is evaluated by an extensive series of numerical experiments with the Iris dataset.
  arXiv  Detail & Related papers  (2023-09-14T14:59:58Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Equivariant quantum circuits for learning on weighted graphs [0.0]
  We introduce an ansatz for learning tasks on weighted graphs. We evaluate the performance of this ansatz on a complex learning task, namely neural optimization.
  arXiv  Detail & Related papers  (2022-05-12T14:15:47Z)
• Quantum Feature Selection [2.5934039615414615]
  In machine learning, fewer features reduce model complexity. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization problem. In contrast to iterative or greedy methods, our direct approach yields higherquality solutions.
  arXiv  Detail & Related papers  (2022-03-24T16:22:25Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)
• Efficient Discrete Feature Encoding for Variational Quantum Classifier [3.7576442570677253]
  Variational quantum classification (VQC) is one of such methods with possible quantum advantage. We introduce the use of quantum random-access coding (QRAC) to map discrete features efficiently into limited number of qubits for VQC. We experimentally show that QRAC can help speeding up the training of VQC by reducing its parameters via saving on the number of qubits for the mapping.
  arXiv  Detail & Related papers  (2020-05-29T04:43:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.