Genetic Programming Iii

Genetic programming (GP) is a method for getting a computer to solve a problem by telling it what needs to be done instead of how to do it. Koza, Bennett, Andre, and Keane present genetically evolved solutions to dozens of problems of design, control, classification, system identification, and computational molecular biology. Among the solutions are 14 results competitive with human-produced results, including 10 rediscoveries of previously patented inventions.

The work described in this book was first presented at the Second Workshop on Genetic Programming, Theory and Practice, organized by the Center for the Study of Complex Systems at the University of Michigan, Ann Arbor, 13-15 May 2004. The goal of this workshop series is to promote the exchange of research results and ideas between those who focus on Genetic Programming (GP) theory and those who focus on the application of GP to various re- world problems. In order to facilitate these interactions, the number of talks and participants was small and the time for discussion was large. Further, participants were asked to review each other's chapters before the workshop. Those reviewer comments, as well as discussion at the workshop, are reflected in the chapters presented in this book. Additional information about the workshop, addendums to chapters, and a site for continuing discussions by participants and by others can be found at http://cscs.umich.edu:8000/GPTP-20041. We thank all the workshop participants for making the workshop an exciting and productive three days. In particular we thank all the authors, without whose hard work and creative talents, neither the workshop nor the book would be possible. We also thank our keynote speakers Lawrence ("Dave") Davis of NuTech Solutions, Inc., Jordan Pollack of Brandeis University, and Richard Lenski of Michigan State University, who delivered three thought-provoking speeches that inspired a great deal of discussion among the participants.

Genetic Programming IV: Routine Human-Competitive Machine Intelligence presents the application of GP to a wide variety of problems involving automated synthesis of controllers, circuits, antennas, genetic networks, and metabolic pathways. The book describes fifteen instances where GP has created an entity that either infringes or duplicates the functionality of a previously patented 20th-century invention, six instances where it has done the same with respect to post-2000 patented inventions, two instances where GP has created a patentable new invention, and thirteen other human-competitive results. The book additionally establishes: GP now delivers routine human-competitive machine intelligence GP is an automated invention machine GP can create general solutions to problems in the form of parameterized topologies GP has delivered qualitatively more substantial results in synchrony with the relentless iteration of Moore's Law

Background on genetic algorithms, LISP, and genetic programming. Hierarchical problem-solving. Introduction to automatically defined functions: the two-boxes problem. Problems that straddle the breakeven point for computational effort. Boolean parity functions. Determining the architecture of the program. The lawnmower problem. The bumblebee problem. The increasing benefits of ADFs as problems are scaled up. Finding an impulse response function. Artificial ant on the San Mateo trail. Obstacle-avoiding robot. The minesweeper problem. Automatic discovery of detectors for letter recognition. Flushes and four-of-a-kinds in a pinochle deck. Introduction to biochemistry and molecular biology. Prediction of transmembrane domains in proteins. Prediction of omega loops in proteins. Lookahead version of the transmembrane problem. Evolutionary selection of the architecture of the program. Evolution of primitives and sufficiency. Evolutionary selection of terminals. Evolution of closure. Simultaneous evolution of architecture, primitive functions, terminals, sufficiency, and closure. The role representation and the Lens effect. Default parameters. Computer implementation. Electronic mailing list and public repository.

Genetic Programming Theory and Practice explores the emerging interaction between theory and practice in the cutting-edge, machine learning method of Genetic Programming (GP). The material contained in this contributed volume was developed from a workshop at the University of Michigan's Center for the Study of Complex Systems where an international group of genetic programming theorists and practitioners met to examine how GP theory informs practice and how GP practice impacts GP theory. The contributions cover the full spectrum of this relationship and are written by leading GP theorists from major universities, as well as active practitioners from leading industries and businesses. Chapters include such topics as John Koza's development of human-competitive electronic circuit designs; David Goldberg's application of "competent GA" methodology to GP; Jason Daida's discovery of a new set of factors underlying the dynamics of GP starting from applied research; and Stephen Freeland's essay on the lessons of biology for GP and the potential impact of GP on evolutionary theory. The book also includes chapters on the dynamics of GP, the selection of operators and population sizing, specific applications such as stock selection in emerging markets, predicting oil field production, modeling chemical production processes, and developing new diagnostics from genomic data. Genetic Programming Theory and Practice is an excellent reference for researchers working in evolutionary algorithms and for practitioners seeking innovative methods to solve difficult computing problems.

Genetic Programming Theory and Practice III provides both researchers and industry professionals with the most recent developments in GP theory and practice by exploring the emerging interaction between theory and practice in the cutting-edge, machine learning method of Genetic Programming (GP). The contributions developed from a third workshop at the University of Michigan's Center for the Study of Complex Systems, where leading international genetic programming theorists from major universities and active practitioners from leading industries and businesses meet to examine and challenge how GP theory informs practice and how GP practice impacts GP theory. Applications are from a wide range of domains, including chemical process control, informatics, and circuit design, to name a few.

Computers that `program themselves' has long been an aim of computer scientists. Recently genetic programming (GP) has started to show its promise by automatically evolving programs. Indeed in a small number of problems GP has evolved programs whose performance is similar to or even slightly better than that of programs written by people. The main thrust of GP has been to automatically create functions. While these can be of great use they contain no memory and relatively little work has addressed automatic creation of program code including stored data. This issue is the main focus of Genetic Programming, and Data Structures: Genetic Programming + Data Structures = Automatic Programming!. This book is motivated by the observation from software engineering that data abstraction (e.g., via abstract data types) is essential in programs created by human programmers. This book shows that abstract data types can be similarly beneficial to the automatic production of programs using GP. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrates how GP can evolve general programs which solve the nested brackets problem, recognises a Dyck context free language, and implements a simple four function calculator. In these cases, an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, with a critical review of experiments with evolving memory, and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.

After a decade of development, genetic algorithms and genetic programming have become a widely accepted toolkit for computational finance. Genetic Algorithms and Genetic Programming in Computational Finance is a pioneering volume devoted entirely to a systematic and comprehensive review of this subject. Chapters cover various areas of computational finance, including financial forecasting, trading strategies development, cash flow management, option pricing, portfolio management, volatility modeling, arbitraging, and agent-based simulations of artificial stock markets. Two tutorial chapters are also included to help readers quickly grasp the essence of these tools. Finally, a menu-driven software program, Simple GP, accompanies the volume, which will enable readers without a strong programming background to gain hands-on experience in dealing with much of the technical material introduced in this work.