ING models: how they work and how they are constructed I ndividual based N eural network G enetic algoritm by Espen Strand and Geir Huse.

Slides:



Advertisements
Similar presentations
Artificial Neural Networks
Advertisements

Statistical Mechanics and Evolutionary Theory
1) What would happen to the population size if the average female produced more than one surviving reproducing daughter? A) there would be more females.
Yuri R. Tsoy, Vladimir G. Spitsyn, Department of Computer Engineering
Data Mining Classification: Alternative Techniques
Algorithms + L. Grewe.
CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
Dealing with Complexity Robert Love, Venkat Jayaraman July 24, 2008 SSTP Seminar – Lecture 10.
Kostas Kontogiannis E&CE
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Data Mining Techniques Outline
Connectionist models. Connectionist Models Motivated by Brain rather than Mind –A large number of very simple processing elements –A large number of weighted.
Implementing behaviour and life history strategies in IBMs by Geir Huse Department of Fisheries and Marine Biology, University of Bergen, Norway Lecture.
Evolutionary Computation Introduction Peter Andras s.
Spatially explicit IBMs of fish populations by Geir Huse Department of Fisheries and Marine Biology, University of Bergen, Norway Lecture II, NORFA course.
Neural Networks. R & G Chapter Feed-Forward Neural Networks otherwise known as The Multi-layer Perceptron or The Back-Propagation Neural Network.
Barents Sea fish modelling in Uncover Daniel Howell Marine Research Institute of Bergen.
1 MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING By Kaan Tariman M.S. in Computer Science CSCI 8810 Course Project.
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
The Performance of Evolutionary Artificial Neural Networks in Ambiguous and Unambiguous Learning Situations Melissa K. Carroll October, 2004.
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
C. Benatti, 3/15/2012, Slide 1 GA/ICA Workshop Carla Benatti 3/15/2012.
Introduction to Genetic Algorithms and Evolutionary Computation
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
 The most intelligent device - “Human Brain”.  The machine that revolutionized the whole world – “computer”.  Inefficiencies of the computer has lead.
Artificial Neural Networks An Overview and Analysis.
Neural Networks Ellen Walker Hiram College. Connectionist Architectures Characterized by (Rich & Knight) –Large number of very simple neuron-like processing.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
NEURAL NETWORKS FOR DATA MINING
LINEAR CLASSIFICATION. Biological inspirations  Some numbers…  The human brain contains about 10 billion nerve cells ( neurons )  Each neuron is connected.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Artificial Intelligence Methods Neural Networks Lecture 4 Rakesh K. Bissoondeeal Rakesh K. Bissoondeeal.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Modelling Language Evolution Lecture 1: Introduction to Learning Simon Kirby University of Edinburgh Language Evolution & Computation Research Unit.
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
Evolving Virtual Creatures Karl Sims – SIGGRAPH ‘94 Presented by Andy Snyder.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Over-Trained Network Node Removal and Neurotransmitter-Inspired Artificial Neural Networks By: Kyle Wray.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Evolution of Complex Behavior Controllers using Genetic Algorithms Title.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Process Plan Optimization using a Genetic Algorithm Fabian M¨arki ' 2, Manfred Vogel ' and Martin Fischer 2 1 Institute 4D Technologies and DataSpaces,
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
Dimensions of Neural Networks Ali Akbar Darabi Ghassem Mirroshandel Hootan Nokhost.
“Principles of Soft Computing, 2 nd Edition” by S.N. Sivanandam & SN Deepa Copyright  2011 Wiley India Pvt. Ltd. All rights reserved. CHAPTER 2 ARTIFICIAL.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Deep Feedforward Networks
Artificial Neural Networks
Artificial Intelligence (CS 370D)
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult.
Lecture Notes for Chapter 4 Artificial Neural Networks
Dr. Unnikrishnan P.C. Professor, EEE
Boltzmann Machine (BM) (§6.4)
Searching for solutions: Genetic Algorithms
CHAPTER I. of EVOLUTIONARY ROBOTICS Stefano Nolfi and Dario Floreano
Presentation transcript:

ING models: how they work and how they are constructed I ndividual based N eural network G enetic algoritm by Espen Strand and Geir Huse

ING models - Presentation layout: Representation of individuals –Attribute and strategy vector, super-individual The genetic algorithm in ING models –Structure, initiation, selection vs. variability, reproduction –Model constraints (avoiding Darwinian monsters) –Fitness in ING models The neural network –Network architecture, types of input, stimuli transformation One example of an ING model

The individuals All individuals are numerically described by a unique strategy vector (easy think of it as genes): All individuals’ states are described in the attribute vector: Strategy vector (length n) …. n 1.6 kg 590 days 34g fat female 303 eggs Attribute vector

Super-individuals There is, depending on model complexity, an upper practical limit to how many individuals that can be simulated In models where the number or biomass of individuals are important and very high, a way around this problem is to treat each individual as a super-individual A super-individual simply has a number added to its attribute vector telling how many (identical) individuals it represents 500 ind 590 days 34g fat female 303 eggs Attribute vector

The genetic algorithm (GA) A GA is an algorithm that mimics evolution by natural selection. So - what is required to make evolution possible? 1.A population of individuals 2.Genetic variability among individuals 3.A genotype – phenotype relationship 4.Individual variation in phenotypic success (fitness) 5.Inheritability of genotypes from one generation to the next 6.Introduction of new genetic variance (at least in the long run) How is this implemented in a GA?

Implementing a GA - I Ind #Sv(1)Sv(2)Sv(3)Sv(…)Sv(n) … … …0.3 ……………… N …-0.4 Strategy vector (length n) Population (size N) N … … 1.A population of individuals 2.Genetic variability among individuals 3.A genotype – phenotype relationship 4.Individual variation in fitness 5.Inheritability of genotypes from one generation to the next 6.Introduction of new genetic variance

Linking behaviour to GA 1 2 Depth Input 1 Input 2 Input 3 Input 4 Input Behaviour Strategy vector Neural network 1.A population of individuals 2.Genetic variability among individuals 3.A genotype – phenotype relationship 4.Individual variation in fitness 5.Inheritability of genotypes from one generation to the next 6.Introduction of new genetic variance This link is the cornerstone of an ING-model

Implementing a GA - III 500 ind 90 days 34g fat female 303 eggs Attribute vector 0.4 ind 90 days 0.4g fat female 3 eggs 1.A population of individuals 2.Genetic variability among individuals 3.A genotype – phenotype relationship 4.Individual variation in fitness 5.Inheritability of genotypes from one generation to the next 6.Introduction of new genetic variance

Implementing a GA - IV +=or Strategy vectors 1.A population of individuals 2.Genetic variability among individuals 3.A genotype – phenotype relationship 4.Individual variation in fitness 5.Inheritability of genotypes from one generation to the next 6.Introduction of new genetic variance

About fitness (or: who gets to reproduce?) There are two distinctly different ways to incorporate fitness in an ING-model –By using a fitness measure (applied fitness) sort all individuals in the population according to the fitness measure and only let the fit ones reproduce. A fitness measure is imposed on the population. Replace the old generation with the new one. No chance of extinction. No population dynamics. –By simulating the individuals’ entire life-span including mortality, gonad development, foraging, metabolic expenditure, etc… (emergent fitness) individuals will reproduce off-spring according to how well they adapted they are to the environment. Fitness becomes an emergent property of the model. The off-spring is added to the population as juveniles and do not replace existing individuals. Emergent population dynamics. Population may go extinct.

Model constraints Environment Physiology –Temperature dependent effects –Stomach limitation –Prey size limitations –Behavioural limitations –…. (this list really never ends)

GA overview

Artificial Neural Network The basic idea of an ANN was to make an algorithm that mimicked how a brain makes decisions based stimuli From A real network of neuronsAn artificial neural network (ANN)

Artificial Neural Network - Architecture An ANN is constructed of: –Input –Input nodes –Input connection weights –Hidden nodes –Hidden node bias –Output connection weights –Output node(s)

Artificial Neural Network – Input node An input node receive a specific input and scales it linearly to a value between 0 and 1

Artificial Neural Network – Hidden node The hidden node sums all input connection weights (CW) multiplied with the input node value

Artificial Neural Network – Transformation After obtaining the value HiddenNode j the value is transformed non- linearly. Most often a sigmoid function is used. A bias is also often included. HiddenNode jT HiddenNode j

Artificial Neural Network – Output The output node sums the transformed hidden node values multiplied with the output connection weights

Artificial Neural Network – Behaviour The value calculated by the output node(s) is used to determine behaviour. This can be done in several ways: –Use value directly (e.g. output = swimming speed) –Use it to determine incremental step in behaviour (e.g. NewDepth = OldDepth + output) –Transform it (sigmoid) and multiply with some maximum range (e.g. NewDepth = MaxDepth*output T )

ING-models: Pros and cons Cons –No guarantee that the optimal solution is found –Need to run replicate simulations –Can be difficult to “decode” the adapted neural network ANN = black box? Pros –Can incorporate very high levels of complexity: Stochasticity, Intra- and Inter-specific competition –Can be used to study emergent patterns on different levels simultaneously: Population dynamics, state-dependent behaviour –Can avoid using a measure of fitness by making fitness an emergent property of the model.

Example: A model of a planktivours fish Strand, E., Huse,G., Giske, J. (2002) Time resolution –Simulates 1 day every month (and scales it to the entire month) –Each day is divided into 5 minutes time-steps –Run for several hundred generations Behaviour and life-history strategy –Depth position –Energy allocation –Spawning strategy Emergent fitness Main focus –Differences in juvenile and adult behaviour –Effects from stochastic juvenile survival on life-history and behaviour

Example: A model of a planktivours fish

Vertical migration From Baliño and Aksnes (1991)

Energy allocation Data from Hamre (1999)

Spawning behaviour

The End