Abstract
Evolutionary systems are used for search and optimization in complex problems and for modelling population dynamics in nature. Individuals in populations reproduce by simple mechanisms, such as mutation or recombination of their genetic sequences, and selection ensures they evolve in the direction of increasing fitness. Although successful in many applications, evolution towards an optimum or high fitness can be extremely slow, and the problem of controlling parameters of reproduction to speed up this process has been investigated by many researchers. Here, we approach the problem from two points of view: (1) as optimization of evolution in time; (2) as optimization of evolution in information. The former problem is often intractable, because analytical solutions are not available. The latter problem, on the other hand, can be solved using convex analysis, and the resulting control, optimal in the sense of information dynamics, can achieve good results also in the sense of time evolution. The principle is demonstrated on the problem of optimal mutation rate control in Hamming spaces of sequences. To facilitate the analysis, we introduce the notion of a relatively monotonic fitness landscape and obtain general formula for transition probability by simple mutation in a Hamming space. Several rules for optimal control of mutation are presented, and the resulting dynamics are compared and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Amari, S.I.: Differential-Geometrical Methods of Statistics. In: Lecture Notes in Statistics, vol. 25. Springer, Berlin (1985)
Bäck, T.: Optimal mutation rates in genetic search. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, pp. 2–8. Morgan Kaufmann (1993)
Belavkin, R.V.: Bounds of optimal learning. In: 2009 IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning, pp. 199–204. IEEE, Nashville, TN, USA (2009)
Belavkin, R.V.: Information trajectory of optimal learning. In: Hirsch, M.J., Pardalos, P.M., Murphey, R. (eds.) Dynamics of Information Systems: Theory and Applications, Springer Optimization and Its Applications Series, vol. 40. Springer, Berlin (2010)
Belavkin, R.V.: On evolution of an information dynamic system and its generating operator. Optimization Letters (2011). DOI:10.1007/s11590-011-0325-z
Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton, NJ (1957)
Bernstein, D.S., Hyland, D.C.: The optimal projection/maximum entropy approach to designing low-order, robust controllers for flexible structures. In: Proceedings of 24th Conference on Decision and Control, pp. 745–752. Ft. Lauderdale, FL (1985)
Chentsov, N.N.: Statistical Decision Rules and Optimal Inference. Nauka, Moscow, U.S.S.R. (1972). In Russian, English translation: Providence, RI: AMS, 1982
Eigen, M., McCaskill, J., Schuster, P.: Molecular quasispecies. J. Phys. Chem. 92, 6881–6891 (1988)
Fisher, R.A.: The Genetical Theory of Natural Selection. Oxford University Press, Oxford (1930)
Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: A survey. J. Artif. Intell. Res. 4, 237–285 (1996)
Kalman, R.E., Bucy, R.S.: New results in linear filtering and prediction theory. Trans. ASME Basic Eng. 83, 94–107 (1961)
Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79–86 (1951)
Nix, A.E., Vose, M.D.: Modeling genetic algorithms with Markov chains. Ann. Math. Artif. Intell. 5(1), 77–88 (1992)
Nowak, M.A.: Evolutionary Dynamics: Exploring the Equations of Life. Harvard University Press, Cambridge (2006)
Ochoa, G.: Setting the mutation rate: Scope and limitations of the 1 ∕ l heuristics. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 315–322. Morgan Kaufmann, San Francisco, CA (2002)
Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423 and 623–656 (1948)
Stratonovich, R.L.: Optimum nonlinear systems which bring about a separation of a signal with constant parameters from noise. Radiofizika 2(6), 892–901 (1959)
Stratonovich, R.L.: On value of information. Izv. USSR Acad. Sci. Tech. Cybern. 5, 3–12 (1965) (In Russian)
Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. Adaptive Computation and Machine Learning. MIT Press, Cambridge, MA (1998)
Tsypkin, Y.Z.: Foundations of the Theory of Learning Systems. In: Mathematics in Science and Engineering. Academic, New York (1973)
Yanagiya, M.: A simple mutation-dependent genetic algorithm. In: Forrest, S. (ed.) Proceedings of the 5th International Conference on Genetic Algorithms, p. 659. Morgan Kaufmann (1993)
Acknowledgements
This work was supported by UK EPSRC grant EP/H031936/1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this paper
Cite this paper
Belavkin, R.V. (2012). Dynamics of Information and Optimal Control of Mutation in Evolutionary Systems. In: Sorokin, A., Murphey, R., Thai, M., Pardalos, P. (eds) Dynamics of Information Systems: Mathematical Foundations. Springer Proceedings in Mathematics & Statistics, vol 20. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3906-6_1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3906-6_1
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3905-9
Online ISBN: 978-1-4614-3906-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)