1 / 21

Imitation Programming

Imitation Programming. Larry Bull University of the West of England. Alan Mathison Turing. Further research into intelligence of machinery will probably be very greatly concerned with ‘searches’ ….

shafferj
Download Presentation

Imitation Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Imitation Programming Larry Bull University of the West of England

  2. Alan Mathison Turing Further research into intelligence of machinery will probably be very greatly concerned with ‘searches’ …. There is the genetical or evolutionary search by which a combination of genes is looked for, the criterion being survival value …. The remaining form of search is what I should like to call the ‘cultural search’ … the search for new techniques must be regarded as carried out by the human community as a whole. Intelligent Machinery 1948

  3. Culture-inspired Search • Artefacts - left between evolutionary generations [Hutchins & Hazelhurst 1990, ALife II procs.] • Cultural Algorithms - belief space to store knowledge to guide evolutionary search [Reynolds1994, EP III procs.] • Ant Colony Optimization – social insect mechanisms for path finding in graphs [Dorigo et al. 1996, IEEE SMC-B]

  4. Imitation: Memes • Dawkins’ meme [1976] is a unit of cultural ideas, symbols or practices, which can be transmitted from one mind to another through: • Writing • Speech • Gestures • Rituals • Other imitable phenomena. • Meme = Cultural gene.

  5. Imitation Computation • Supervised Learning - controller design through copying of human movement [e.g., review by Schaal et al. 2003, Phil. Trans.] • Reinforcement Learning - value function approximation sharing between multiple agents [e.g., Price & Boutilier 1999, ML 16 procs.] • Particle Swarm Optimization – boids inspired model of social behaviour [Kennedy & Eberhart 1995, IEEE NN procs.]

  6. In the same 1948 paper, Turing presented a general knowledge representation scheme. Parallel, recurrent networks of 2-input NAND gates. Unorganised Machines: A-Type

  7. Unorganised machines have a finite number of possible states and they are deterministic. Hence such networks eventually fall into a basin of attraction. Discrete Dynamical Systems

  8. Motivation • Discrete dynamical systems are known to (potentially) exhibit an inherent robustness to faults. • Unorganised machines are made from uniform components. • How to design dynamical circuits from such systems through culture-inspired mechanisms?

  9. Related Work • Evolving Cellular Automata • [Packard, 1988][Mitchell et al., 1991][Sipper, 1997] • Evolving Random Boolean Networks • [Kauffman, 1993][Lemke et al., 2001] • Evolving Graph Representations • [Fogel et al., 1966][Teller & Veloso, 1996][Poli, 1997][Miller, 1999][Teuscher, 2002] …

  10. Imitation Programming • Create initial random population • Evaluate • For each individual • Select individual in population to imitate • Copy a randomly chosen aspect (with error) • Evaluate • Adopt new solution if better (or if smaller but =) • Repeat

  11. Imitation • Pick an individual • Best used here • Smallest in case of ties (or random) • Pick a trait at random • Node start state • Node connection • Network size • Test for error (pe = 0.5 here) which moves connection +/- 1 node id

  12. Size • Imitator is smaller • Copy next node in imitatee and connect into network • Imitator is larger • Cut end node and reassign connections to it • Same size • Randomly add a copied node or cut last node • Size limited [inputs+outputs, max.]

  13. Unorganised Machines as Circuits Input 1 2 4 Input 2 6 1 Output Input 3 3 5 Each node encoded as two integers and a binary start state. Nodes are initialised, inputs applied, network run for T cycles, and the output node(s) value is read.

  14. Multiplexer m=20, T=15, N=I+O+30

  15. 1 1 0 1 0 a0 a1 d1 d2 d3 d4 out 1 0 1 1 0 0 1 0 0 0 0 1 0 1 1 0 0 0 1 1 0 1 0 1 1 1 1

  16. Demultiplexer

  17. Comparison with Evolution EP [Fogel et al., 1966] was designed for graph representations using mutation: Change output Change transition Add state Remove state Change initial state One operator used per offspring here. (m+m’) selection 0/g A B 0/b 0/b 1/a A C 1/g 1/b

  18. Multiplexer – IP vs EP

  19. Demultiplexer – IP vs EP

  20. Summary of Brief Comparison • Imitation always faster and smaller. • But selection process in particular is very different. • IP described akin to a population of hill-climbers. • If alter imitation to copy a randomly created individual stat. same on demux but still better on mux.

  21. Conclusions • Culture appears to be a somewhat under-explored source of ideas for AI. • Imitation a ubiquitous process in nature. • Can be viewed as both a component-wise xover operator and mutation. • Initial results suggest competitive with genetic evolution schemes. • Much more exploration needed.

More Related