• DocumentCode
    617894
  • Title

    Information transmission through genetic algorithm fitness maps

  • Author

    Montanez, George D.

  • Author_Institution
    Machine Learning Dept., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2013
  • fDate
    20-23 June 2013
  • Firstpage
    756
  • Lastpage
    763
  • Abstract
    To bound the amount of information transmitted from a fitness map to a genetic algorithm population, we use a method suggested by Abu-Mostafa et al. [1] for measuring the information storage capacity of general forms of memory and represent the genetic algorithm as a communication channel. Our results show that a number of bits linear in the size of the search space can be stored in a fitness map, but on average only a logarithmic number of bits can be stored within a genetic algorithm population of bounded size and finite precision representation. Our results place an upper bound on the rate at which information can be transmitted through, or generated by and later extracted from, a genetic algorithm under fairly general conditions.
  • Keywords
    channel capacity; genetic algorithms; information theory; search problems; storage management; bounded size representation; communication channel; finite precision representation; genetic algorithm fitness maps; information storage capacity measurement; information transmission; search space size; upper bound; Communication channels; Entropy; Genetic algorithms; Sociology; Statistics; Upper bound; Vectors; channel capacity; fitness function; genetic algorithm; information transmission; populations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2013 IEEE Congress on
  • Conference_Location
    Cancun
  • Print_ISBN
    978-1-4799-0453-2
  • Electronic_ISBN
    978-1-4799-0452-5
  • Type

    conf

  • DOI
    10.1109/CEC.2013.6557644
  • Filename
    6557644