Injecting Social Diversity in Multi-Objective Genetic Programing:

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Representing Hypothesis Operators Fitness Function Genetic Programming
Angers, 10 June 2010 Multi-Objective Optimisation (II) Matthieu Basseur.
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Surrogate Model Based Differential Evolution for Multiobjective Optimization (GP - DEMO) Šmarna gora, Miha Mlakar Algoritmi po vzorih iz narave.
Advancements in Genetic Programming for Data Classification Dr. Hajira Jabeen Iqra University Islamabad, Pakistan.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Hybridization of Search Meta-Heuristics Bob Buehler.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
16 November, 2005 Statistics in HEP, Manchester 1.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Khaled Rasheed Computer Science Dept. University of Georgia
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Programming.
Genetic Algorithm.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Example II: Linear truss structure
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
1 Computing in High Energy and Nuclear Physics, February 2006, Mumbai, India.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
GENETIC PROGRAMMING. THE CHALLENGE "How can computers learn to solve problems without being explicitly programmed? In other words, how can computers be.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Evolutionary Computation Evolving Neural Network Topologies.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Introduction to genetic algorithm
Chapter 14 Genetic Algorithms.
Genetic Algorithm in TDR System
The human eye - an evolutionary look.
Particle Swarm Optimization (2)
Bulgarian Academy of Sciences
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Evolution strategies and genetic programming
School of Computer Science & Engineering
Presented by: Dr Beatriz de la Iglesia
GENETIC PROGRAMMING BBB4003.
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Heuristic-based Recommendation for Metamodel–OCL Coevolution
Multimodal Problems and Spatial Distribution
A Generic Framework for Model-Set Selection for the
Towards the Automated Recovery of Complex Temporal API-Usage Patterns
Systematic Mapping Study of Model Transformations for Concrete Problems Edouard Batot, Houari Sahraoui, Eugene Syriani, Paul Molins and Wael Sboui Dépt.
Heuristic Optimization Methods Pareto Multiobjective Optimization
Multi-Objective Optimization
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
EE368 Soft Computing Genetic Algorithms.
Multimodal Problems and Spatial Distribution
Boltzmann Machine (BM) (§6.4)
Machine Learning: UNIT-4 CHAPTER-2
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
Artificial Intelligence CIS 342
Lecture 4. Niching and Speciation (1)
GENETIC PROGRAMMING BBB4003.
Beyond Classical Search
Complexity as Fitness for Evolved Cellular Automata Update Rules
Coevolutionary Automated Software Correction
Presentation transcript:

Injecting Social Diversity in Multi-Objective Genetic Programing: the Case of Well-formedness Rule Learning Edouard Batot, Houari Sahraoui DIRO, Université de Montréal

Conundrum ? ? How important is an example Application Examples Problem Solution 30/11/2018 Math Expression b a c ? c = 2a + b ? c = a² + b Fitness of a solution = % of correct examples SSDM - SSBSE’18 Depending on which examples they process correclety, solutions may differ completely. fit( c = 2a + b ) = 100% 80% How important is an example to the fitness of a solution ?

Evolutional Computation SBSE Adaptation Solution space representiation Arithmetic expression with variables a, and b, equal to c 30/11/2018 Fitness of a solution Number of examples adequatly executed Solution Space Representation Arithmetic Language Arithmetic Expression Evolutional Computation SBSE Concrete Solution SSDM - SSBSE’18 Application Examples Fitness Function % of correct examples Learning from examples

Evolutional Computation 100% #ACC (2) Execute programs and evaluate their fitness (3) Termination criteria Yes 30/11/2018 No (1) Create an initial population of programs (6) Return the best program #GEN++ (5) Replace the current population by the new one (4) Create new programs using genetic operators A population of candidate solutions.. Arithmetic expressions SSDM - SSBSE’18 GP is a metaheuristics Population-based algorithm ..evolves through generations.. Genetic evolution ..until a termination criteria is reached. Maximum correctness (objective)

Limitation ..and rare cases, might be neglected ! c = a² + b How important is an example to the fitness of a solution ? Fitness = % of correct output 30/11/2018 .2 .6 .8 Fitness 3 2 1 Rank 3 2 Outsiders .8 1 c = a² + b c = 2a + b αlphas 1 Some examples are more frequently solved in general.. SSDM - SSBSE’18 Single fitness peak Diversity of solutions decreases ..and rare cases, might be neglected !

A Social Resolution for Diversity Fitness of a solution Proportional to the number of examples solved 30/11/2018 Offset by the frequency of which an example is solved by the population’s individuals (IERF) An example is less frequently solved..? ..it becomes more valuable ! SSDM - SSBSE’18 Inverse Example Resolution Frequency ! IERF 9/1 9/7 9/6 9/8 9/1 A Social Semantic Diversity (SSD)

Well-Formedness Rules (WFRs) Metamodel Wellformed father Person mother 30/11/2018 WFRs = OCL Constraints Context Person: inv inheritance_bares_no_loop_mum: self.mother->closure() ->excludes(self) inv inheritance_bares_no_loop_dad: self.father->closure() Illformed SSDM - SSBSE’18 Persons cannot be their own mother or father WE assess the usefullness of SSD in a case study WFRs … transitively.

Learning WFR from examples WFRs model Validation 30/11/2018 Computational Evolution Solution Space Representation Fitness Function Concrete Solution OCL AST OCL Constraints Well and Ill formed examples Application Examples SSDM - SSBSE’18 Syntactic Objectives % of correct examples Size As a crowding distance ? …where to inject diversity ? As a search objective ?

Crowding distance SSD for crowding distance ! Multi-objective No complete order Pareto fronts Non-dominated solutions sets Crowding distance Measure of density of solutions in the neighborhood 30/11/2018 CD Pareto-optimal front SSDM - SSBSE’18 Pareto optimal if no feasible solution exists, which would improve some objective without causing a simultaneous worsening in at least another one. Non-dominated solutions Which one to favor for reproduction ? SSD for crowding distance !

Research questions RQ0: Sanity check 30/11/2018 RDN VS OBJ RQ1: SSD as a search objective, an improvement ? OBJ VS BASE RQ2: SSD as a crowding distance, any better yet ? SSDM - SSBSE’18 BASE VS CD

Evaluation setting 4 configurations 2 dependent variables 3 metamodels Random search Without SSD SSD as a search objective SSD as a crowding distance RDN 30/11/2018 BASE OBJ CD 2 dependent variables # of generations # of examples accurate 3 metamodels 20 training examples each 100 evaluation examples each 100 runs for each configuration 100% DIFF or 3000 generations #GEN #ACC SSDM - SSBSE’18

Accuracy of solutions found Evaluation results Crowding distance 3000- 2000- 1000- 0- 2500- 1500- 500- Accuracy of solutions found Standard Objective # of generations -0,6 -0,4 -0,2 -0 -0,5 -0,3 -0,1 -0,8 -0,7 -0,9 -1,0 Statemachine Project Manager 30/11/2018 BASE OBJ CD BASE OBJ CD SSDM - SSBSE’18 Results on two metamodels (Family is solved with all configurations) #GEN: unbeatable speed up ! Up to 30 times faster #ACC: accuracy, and generalisation power are improved Small but significant (Mann Witney p-value > 0.01)

Convergence #ACC Algorithm converges faster and more consistently BASE 30/11/2018 BASE Algorithm converges faster and more consistently OBJ SSDM - SSBSE’18 CD Evolution of individuals’ average accuracy on Project Manager metamodel (hundred runs a plot)

Social Semantic Diversity Conclusion Social Semantic Diversity SSD SBSE 30/11/2018 OBJ CD SSDM - SSBSE’18 #GEN #ACC batotedo@iro.umontreal.ca

30/11/2018 SSDM - SSBSE’18

Example-Based automation of MDE (EB-MDE) stands that Example-Based MDE 30/11/2018 Example-Based automation of MDE (EB-MDE) stands that it is easier to provide examples of application illustrating well a problem, than to draw a general theory about how to solve it. SSD - SSBSE’18 Examples with MDE abstract representations Valid and Invalid models Optimization with SBSE metaheuristic algorithms In search for OCL constraints