Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms
Abstract
Experimental results are presented that indicate Gray coding is generally superior to binary coding for function optimization using the genetic algorithm. Analysis suggests that Gray coding eliminates the “Hamming cliff” problem that makes some transitions difficult when using a binary representation. We argue that the “Hamming cliff” is but one instance of hidden bias emerging from an interaction between search control heuristics and the knowledge representation.
Cite
Text
Caruana and Schaffer. "Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms." International Conference on Machine Learning, 1988. doi:10.1016/B978-0-934613-64-4.50021-9Markdown
[Caruana and Schaffer. "Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms." International Conference on Machine Learning, 1988.](https://mlanthology.org/icml/1988/caruana1988icml-representation/) doi:10.1016/B978-0-934613-64-4.50021-9BibTeX
@inproceedings{caruana1988icml-representation,
title = {{Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms}},
author = {Caruana, Rich and Schaffer, J. David},
booktitle = {International Conference on Machine Learning},
year = {1988},
pages = {153-161},
doi = {10.1016/B978-0-934613-64-4.50021-9},
url = {https://mlanthology.org/icml/1988/caruana1988icml-representation/}
}