A Field Guide to Genetic Programming

xiv, 233 p. : il. ; 23 cm.Libro ElectrónicoA Field Guide to Genetic Programming (ISBN 978-1-4092-0073-4) is an introduction to genetic programming (GP). GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. The authorsIntroduction -- Representation, initialisation and operators in Tree-based GP -- Getting ready to run genetic programming -- Example genetic programming run -- Alternative initialisations and operators in Tree-based GP -- Modular, grammatical and developmental Tree-based GP -- Linear and graph genetic programming -- Probalistic genetic programming -- Multi-objective genetic programming -- Fast and distributed genetic programming -- GP theory and its applications -- Applications -- Troubleshooting GP -- Conclusions.Contents xi 1 Introduction 1.1 Genetic Programming in a Nutshell 1.2 Getting Started 1.3 Prerequisites 1.4 Overview of this Field Guide I Basics 2 Representation, Initialisation and GP 2.1 Representation 2.2 Initialising the Population 2.3 Selection 2.4 Recombination and Mutation Operators in Tree-based 3 Getting Ready to Run Genetic Programming 19 3.1 Step 1: Terminal Set 19 3.2 Step 2: Function Set 20 3.2.1 Closure 21 3.2.2 Sufficiency 23 3.2.3 Evolving Structures other than Programs 23 3.3 Step 3: Fitness Function 24 3.4 Step 4: GP Parameters 26 3.5 Step 5: Termination and solution designation 27 4 Example Genetic Programming Run 4.1 Preparatory Steps 29 4.2 Step-by-Step Sample Run 31 4.2.1 Initialisation 31 4.2.2 Fitness Evaluation Selection, Crossover and Mutation Termination and Solution Designation Advanced Genetic Programming 5 Alternative Initialisations and Operators in 5.1 Constructing the Initial Population 5.1.1 Uniform Initialisation 5.1.2 Initialisation may Affect Bloat 5.1.3 Seeding 5.2 GP Mutation 5.2.1 Is Mutation Necessary? 5.2.2 Mutation Cookbook 5.3 GP Crossover 5.4 Other Techniques 32 5.5 Tree-based GP 39 6 Modular, Grammatical and Developmental Tree-based GP 47 6.1 Evolving Modular and Hierarchical Structures 47 6.1.1 Automatically Defined Functions 48 6.1.2 Program Architecture and Architecture-Altering 50 6.2 Constraining Structures 51 6.2.1 Enforcing Particular Structures 52 6.2.2 Strongly Typed GP 52 6.2.3 Grammar-based Constraints 53 6.2.4 Constraints and Bias 55 6.3 Developmental Genetic Programming 57 6.4 Strongly Typed Autoconstructive GP with PushGP 59 7 Linear and Graph Genetic Programming 61 7.1 Linear Genetic Programming 61 7.1.1 Motivations 61 7.1.2 Linear GP Representations 62 7.1.3 Linear GP Operators 64 7.2 Graph-Based Genetic Programming 65 7.2.1 Parallel Distributed GP (PDGP) 65 7.2.2 PADO 67 7.2.3 Cartesian GP 67 7.2.4 Evolving Parallel Programs using Indirect Encodings 68 8 Probabilistic Genetic Programming 8.1 Estimation of Distribution Algorithms 69 8.2 Pure EDA GP 71 8.3 Mixing Grammars and Probabilities 74 9 Multi-objective Genetic Programming 75 9.1 Combining Multiple Objectives into a Scalar Fitness Function 75 9.2 Keeping the Objectives Separate 76 9.2.1 Multi-objective Bloat and Complexity Control 77 9.2.2 Other Objectives 78 9.2.3 Non-Pareto Criteria 80 9.3 Multiple Objectives via Dynamic and Staged Fitness Functions 80 9.4 Multi-objective Optimisation via Operator Bias 81 10 Fast and Distributed Genetic Programming 83 10.1 Reducing Fitness Evaluations/Increasing their Effectiveness 83 10.2 Reducing Cost of Fitness with Caches 86 10.3 Parallel and Distributed GP are Not Equivalent 88 10.4 Running GP on Parallel Hardware 89 10.4.1 Master–slave GP 89 10.4.2 GP Running on GPUs 90 10.4.3 GP on FPGAs 92 10.4.4 Sub-machine-code GP 93 10.5 Geographically Distributed GP 93 11 GP Theory and its Applications 97 11.1 Mathematical Models 98 11.2 Search Spaces 99 11.3 Bloat 101 11.3.1 Bloat in Theory 101 11.3.2 Bloat Control in Practice 104 III Practical Genetic Programming 12 Applications 12.1 Where GP has Done Well 12.2 Curve Fitting, Data Modelling and Symbolic Regression 12.3 Human Competitive Results – the Humies 12.4 Image and Signal Processing 12.5 Financial Trading, Time Series, and Economic Modelling 12.6 Industrial Process Control 12.7 Medicine, Biology and Bioinformatics 12.8 GP to Create Searchers and Solvers – Hyper-heuristics xiii 12.9 Entertainment and Computer Games 127 12.10The Arts 127 12.11Compression 128 13 Troubleshooting GP 13.1 Is there a Bug in the Code? 13.2 Can you Trust your Results? 13.3 There are No Silver Bullets 13.4 Small Changes can have Big Effects 13.5 Big Changes can have No Effect 13.6 Study your Populations 13.7 Encourage Diversity 13.8 Embrace Approximation 13.9 Control Bloat 13.10 Checkpoint Results 13.11 Report Well 13.12 Convince your Customers 14 Conclusions Tricks of the Trade A Resources A.1 Key Books A.2 Key Journals A.3 Key International Meetings A.4 GP Implementations A.5 On-Line Resources 145 B TinyGP 151 B.1 Overview of TinyGP 151 B.2 Input Data Files for TinyGP 153 B.3 Source Code 154 B.4 Compiling and Running TinyGP 162 Bibliography 167 Inde

A robust method for measurement of fluctuation parallel wavenumber in laboratory plasmas

Measuring the parallel wavenumber is fundamental for the experimental characterization of electrostatic instabilities. It becomes particularly important in toroidal geometry, where spatial inhomogeneities and curvature can excite both drift instabilities, whose wavenumber parallel to the magnetic field is finite, and interchange instabilities, which typically have vanishing parallel wavenumber. We demonstrate that multipoint measurements can provide a robust method for the discrimination between the two cases

Selective enhancement of topologically induced interface states in a dielectric resonator chain

The recent realization of topological phases in insulators and superconductors has advanced the quest for robust quantum technologies. The prospects to implement the underlying topological features controllably has given incentive to explore optical platforms for analogous realizations. Here we realize a topologically induced defect state in a chain of dielectric microwave resonators and show that the functionality of the system can be enhanced by supplementing topological protection with non-hermitian symmetries that do not have an electronic counterpart. We draw on a characteristic topological feature of the defect state, namely, that it breaks a sublattice symmetry. This isolates the state from losses that respect parity-time symmetry, which enhances its visibility relative to all other states both in the frequency and in the time domain. This mode selection mechanism naturally carries over to a wide range of topological and parity-time symmetric optical platforms, including couplers, rectifiers and lasers.Comment: 5 pages, 4 figures, + supplementary information (3 pages, 4 figures

Coherent control of quantum transport: modulation-enhanced phase detection and band spectroscopy

Amplitude modulation of a tilted optical lattice can be used to steer the quantum transport of matter wave packets in a very flexible way. This allows the experimental study of the phase sensitivity in a multimode interferometer based on delocalization-enhanced Bloch oscillations and to probe the band structure modified by a constant force.Comment: 8 pages, 3 figures, Submitted to EPJ Special Topics for the special issue on "Novel Quantum Phases and Mesoscopic Physics in Quantum Gases

Effect of turbulence on electron cyclotron current drive and heating in ITER

Non-linear local electromagnetic gyrokinetic turbulence simulations of the ITER standard scenario H-mode are presented for the q=3/2 and q=2 surfaces. The turbulent transport is examined in regions of velocity space characteristic of electrons heated by electron cyclotron waves. Electromagnetic fluctuations and sub-dominant micro-tearing modes are found to contribute significantly to the transport of the accelerated electrons, even though they have only a small impact on the transport of the bulk species. The particle diffusivity for resonant passing electrons is found to be less than 0.15 m^2/s, and their heat conductivity is found to be less than 2 m^2/s. Implications for the broadening of the current drive and energy deposition in ITER are discussed.Comment: Letter, 5 pages, 5 figures, for submission to Nuclear Fusio

Study of the spectral properties of ELM precursors by means of wavelets

The high confinement regime (H-mode) in tokamaks is accompanied by the occurrence of bursts of MHD activity at the plasma edge, so-called edge localized modes (ELMs), lasting less than 1 ms. These modes are often preceded by coherent oscillations in the magnetic field, the ELM precursors, whose mode numbers along the toroidal and the poloidal directions can be measured from the phase shift between Mirnov pickup coils. When the ELM precursors have a lifetime shorter than a few milliseconds, their toroidal mode number and their nonlinear evolution before the ELM crash cannot be studied reliably with standard techniques based on Fourier analysis, since averaging in time is implicit in the computation of the Fourier coefficients. This work demonstrates significant advantages in studying spectral features of the short-lived ELM precursors by using Morlet wavelets. It is shown that the wavelet analysis is suitable for the identification of the toroidal mode numbers of ELM precursors with the shortest lifetime, as well as for studying their nonlinear evolution with a time resolution comparable to the acquisition rate of the Mirnov coils