Evolutionary quantum feature selection

Anton S. Albino, Otto M. Pires, Mauro Q. Nooblath, Erick G. S. Nascimento
3/13/2023
quant-phcs.LGmath.CO

No confident code implementation found for this paper. 2 possible matches can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{albino2023evolutionary,
  title  = {Evolutionary quantum feature selection},
  author = {Anton S. Albino and Otto M. Pires and Mauro Q. Nooblath and Erick G. S. Nascimento},
  year   = {2023},
  eprint = {2303.07131},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.07131v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.07131.svg)](https://codeofpaper.com/paper/2303.07131)

Discussion