The Neuronal Replicator Hypothesis Chrisantha Fernando 1,2,3 Eörs Szathmary 1,4,5 1 Collegium Budapest (Institute for Advanced Study), Budapest, Hungary.

Slides:



Advertisements
Similar presentations
Learning School of Computing, University of Leeds, UK AI23 – 2004/05 – demo 2.
Advertisements

A First Course in Genetic Algorithms
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Darwin and His Theory of Evolution by Natural Selection
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
1 Review Define the terms genes pool and relative frequency Predict Suppose a dominant allele causes a plant disease that usually kills the plant before.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Evolutionary Computation Introduction Peter Andras s.
Imagine that I am in a good mood Imagine that I am going to give you some money ! In particular I am going to give you z dollars, after you tell me the.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
The Neuronal Replicator Hypothesis Chrisantha Fernando & Eors Szathmary CUNY, December Collegium Budapest (Institute for Advanced Study), Budapest,
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Other Mechanisms of Change
Darwin and His Theory of Evolution by Natural Selection
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Pawel Drozdowski – November Introduction GA basics Solving simple problem GA more advanced topics Solving complex problem Question and Answers.
1. Optimization and its necessity. Classes of optimizations problems. Evolutionary optimization. –Historical overview. –How it works?! Several Applications.
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Department of Information Technology Indian Institute of Information Technology and Management Gwalior AASF hIQ 1 st Nov ‘09 Department of Information.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Evolution IN the brain? Eörs Szathmáry Collegium Budapest Eötvös University Munich.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Genetic algorithms Prof Kang Li
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Introduction to Evolutionary Computation Temi avanzati di Intelligenza Artificiale - Lecture 1 Prof. Vincenzo Cutello Department of Mathematics and Computer.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Fuzzy Genetic Algorithm
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
1 Machine Learning 1.Where does machine learning fit in computer science? 2.What is machine learning? 3.Where can machine learning be applied? 4.Should.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Random Boolean Networks. Attractors A Boolean network has 2 ^N possible states. Sooner or later it will reach a previously visited state, and thus,
ELeaRNT: Evolutionary Learning of Rich Neural Network Topologies Authors: Slobodan Miletic 3078/2010 Nikola Jovanovic 3077/2010
1 Genetic Algorithms and Ant Colony Optimisation.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Evolution. Some Questions that can be answered by EVOLUTION Why do so many different animals have the same structure…..the arm bones in humans are the.
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Natural Selection. A. Species overproduce offspring that may survive an environment. B. There is little variation among members of a population. C. Competition.
Introduction to Genetic Algorithms
Genetic Algorithm in TDR System
Introduction to Evolutionary Computing
Evolution Strategies Evolutionary Programming
What is Evolution??? Learning Target: I can explain Natural Selection and the 4 conditions that are required for Natural Selection to take place.
Prof. Marie desJardins September 20, 2010
Basics of Genetic Algorithms (MidTerm – only in RED material)
Basics of Genetic Algorithms
Natural Selection in Action
Chapter 9 Genetic Algorithms
Presentation transcript:

The Neuronal Replicator Hypothesis Chrisantha Fernando 1,2,3 Eörs Szathmary 1,4,5 1 Collegium Budapest (Institute for Advanced Study), Budapest, Hungary 2 Centre for Computational Neuroscience and Robotics, Sussex University, UK 3 MRC National Institute for Medical Research, Mill Hill, London, UK 4 Parmenides Foundation, Kardinal-Faulhaber-Strase 14a, D Munich, Germany 5 Institute of Biology, Eötvös University, Pázmány Péter sétány 1/c, H-1117 Budapest, Hungary

Origin of Life and the Origin of Mind Wallace didn’t believe the mind could be explained by evolution. Darwin did. Is there natural selection in the brain? Could it explain human generative problem solving, curiosity, and creativity? Natural selection destroyed the explanatory power of Divine creativity. Would natural selection in the brain destroy the explanatory power of Self?

What I don’t need to explain… Performance on tasks where random variation with reward biased selection could work…  Stroop Task  WCST  Tower of London Instrumental tasks with low dimensionality

Instrumental Conditioning: Random exploration + stabilization of good changes.

But SHC can’t explain generative creativity in insight problems How do we solve insight problems? What neural mechanisms underlie complex operant behaviour? Why do we play, listen to music, do PhDs, and go to Rothko exhibitions?

But we think that Natural Selection CAN explain generative creativity Natural selection happens when you’ve got units that can  Reproduce (replication with errors)  Transmit heritable variations For example  The adaptive immune system works by natural selection. (controlled)  So do genetic algorithms for engineering airbus wing shapes, etc… (artificial)

Darwinism is not just Selectionism A good solution can be copied and varied, i.e. parallel search resources can be appropriately distributed. Offspring are mutated rather than oneself.  Larger population sizes and elitism can a. increase the sensitivity of selection to beneficial variants, b. prevent loss of good solutions.  Important when most changes are harmful. Variability can be structured by natural selection.  If there is variation in variability, i.e. non-trivial neutrality and lineage selection X A B A’ B’ If(F(A’) > F(B’) & F(A’) > F(X)) choose A If(F(B’)> F(A’) & F(B’) > F(X)) choose B Else(kill A & B and try again) ( ) ES

But how could replication happen in the brain? We propose at least two kinds of mechanism.  Copying of connectivity patterns (SLOW)  Copying of activity patterns (FAST)

Connectivity Copying 2. Causal Inference 1.Formation of 1->1 Mapping 2.(Topographicity)

Parents killing children, and children killing parents 4. Fitness calculation 3. Activity gating

Stop activity spread Error Correction Neurons

I could evolve bigger networks with these extra mechanisms

Activity Copying 1.Topograpicity 2. Bistability 3. Gating

Minimal unit of activity replication = 2 bistable neurons

Parents killing children, and children killing parents (again)

Structuring Search of Activity Replicators It is possible to combine Hebbian learning and natural selection to achieve structured variability. Previously successful evolutionary solutions can be used to bias future evolutionary search. Lamarckian inheritance in the brain.

Richard Watson’s HIFF

- Search in biased towards the previous local optima

Recombination

Further Work How does the brain  evolve representations of complex state-action spaces? Neuronal chromosomes (chunking/hierarchical coupling) of state action pairs (options by synchrony). Episodic memory may be a step in constructing such spaces (IAC algorithm).  assign value (fitness) to state-action pairs? Maximize first derivative of predictability Requires feed-forward emulators (Probabalistic robotics) Co-evolution of goals/solutions  Select actions to execute? Select actions that maximize intrinsic fitness.

Further Work Find behavioural evidence for neuronal replicators.  Instrumental Learning: Find behaviours that exhibit phenotypes consistent with multiple underlying neuronal replicators.  Entropic irreversibility (in the absence of memory/convergent evolution).  Behavioural pathologies in instrumental learning tasks best explainable by historical contingency.

Further Work Find neurophysiological evidence for neuronal replicators  Topographic mapping, STDP, bistability, and gating are known processes.  Rapid synaptic remodelling has been observed  Spontaneous neuronal activity (e.g. in sleep)

Thanks to Richard Goldstein Richard Watson K.K. Karishma Phil Husbands