Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Evaluation of Genetic Algorithm as Learning System in Rigid Space Interpretation

Evaluation of Genetic Algorithm as Learning System in Rigid Space Interpretation
View Sample PDF
Author(s): Bhupesh Kumar Singh (Govind Ballabh Pant University of Agriculture & Technology, India)
Copyright: 2017
Pages: 45
Source title: Nature-Inspired Computing: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-5225-0788-8.ch045


View Evaluation of Genetic Algorithm as Learning System in Rigid Space Interpretation on the publisher's website for pricing and purchasing information.


Genetic Algorithm (GA) (a structured framework of metaheauristics) has been used in various tasks such as search optimization and machine learning. Theoretically, there should be sound framework for genetic algorithms which can interpret/explain the various facts associated with it. There are various theories of the working of GA though all are subject to criticism. Hence an approach is being adopted that the legitimate theory of GA must be able to explain the learning process (a special case of the successive approximation) of GA. The analytical method of approximating some known function is expanding a complicated function an infinite series of terms containing some simpler (or otherwise useful) function. These infinite approximations facilitate the error to be made arbitrarily small by taking a progressive greater number of terms into consideration. The process of learning in an unknown environment, the form of function to be learned is known only by its form over the observation space. The problem of learning the possible form of the function is termed as experience problem. Various learning paradigms have ensured their legitimacy through the rigid space interpretation of the concentration of measure and Dvoretzky theorem. Hence it is being proposed that the same criterion should be applied to explain the learning capability of GA, various formalisms of explaining the working of GA should be evaluated by applying the criteria, and that learning capability can be used to demonstrate the probable capability of GA to perform beyond the limit cast by the No Free Lunch Theorem.

Related Content

Mohamed Arezki Mellal. © 2022. 9 pages.
Tahir Cetin Akinci, Ramazan Caglar, Gokhan Erdemir, Aydin Tarik Zengin, Serhat Seker. © 2022. 11 pages.
Sunanda Hazra, Provas Kumar Roy. © 2022. 16 pages.
Ragab A. El-Sehiemy, Almoataz Y. Abdelaziz. © 2022. 23 pages.
Khaled Dassa, Abdelmadjid Recioui. © 2022. 35 pages.
Anupama Kumari, Mukund Madhaw, C. B. Majumder, Amit Arora. © 2022. 21 pages.
Mandrita Mondal. © 2022. 20 pages.
Body Bottom