Canonical Representation Genetic Programming John Woodward and Ruibin Bai The University of Nottingham Ningbo.

Slides:



Advertisements
Similar presentations
Notes 6.6 Fundamental Theorem of Algebra
Advertisements

Polynomials Newport Math Club Warm up Problems:
Roots & Zeros of Polynomials
ALGEBRA 1 BASICS CHEAT SHEET THINGS YOU SHOULD KNOW . . .
Math 3121 Abstract Algebra I
Richard Fateman CS 282 Lecture 2c1 Basic Extensions for Computer Algebra System Domains Lecture 2c.
Algebraic Expressions and Formulas
LIAL HORNSBY SCHNEIDER
What are some of the ways you that that we can categorise numbers?
Chapter 2 Real Numbers and Complex Numbers. What is a number? What qualifies a mathematical object to be identified as some type of number? Exactly what.
1.2 Properties of Real Numbers Here we will classify real numbers Use the properties to evaluate expressions.
Section 5.6 – Complex Zeros; Fundamental Theorem of Algebra Complex Numbers Standard form of a complex number is: a + bi. Every complex polynomial function.
OBJECTIVES: 1. USE THE FUNDAMENTAL THEOREM OF ALGEBRA 2. FIND COMPLEX CONJUGATE ZEROS. 3. FIND THE NUMBER OF ZEROS OF A POLYNOMIAL. 4. GIVE THE COMPLETE.
1 Fundamental Concepts of Algebra 1.1 Real Numbers
The Fundamental Theorem of Algebra And Zeros of Polynomials
Copyright © Cengage Learning. All rights reserved.
Sullivan Algebra and Trigonometry: Section R.1 Real Numbers Objectives of this Section Classify Numbers Evaluate Numerical Expressions Work with Properties.
Welcome to Survey of Mathematics!
Real Numbers and Their Properties รายวิชา ค ความรู้พื้นฐานสำหรับแคลคูลัส 1 ภาคเรียนที่ 1 ปีการศึกษา 2552.
FINITE FIELDS 7/30 陳柏誠.
Slide Copyright © 2009 Pearson Education, Inc. Topics An introduction to number theory Prime numbers Integers, rational numbers, irrational numbers,
TH EDITION Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 1 Equations and Inequalities Copyright © 2013, 2009, 2005 Pearson Education,
1 ENM 503 Block 1 Algebraic Systems Lesson 4 – Algebraic Methods The Building Blocks - Numbers, Equations, Functions, and other interesting things. Did.
Great Theoretical Ideas in Computer Science.
10.8 The Complex Numbers.
Unit P: Prerequisite P.1 Real Numbers P.2 Exponents and Radicals P.3 Polynomials and Factoring P.4 Rational Expressions P.5 Solving Equations P.6 Solving.
Bell Ringer 1. What is the Rational Root Theorem (search your notebook…Unit 2). 2. What is the Fundamental Theorem of Algebra (search your notebook…Unit.
Solving Linear Equations MATH 017 Intermediate Algebra S. Rook.
Objectives: To evaluate and simplify algebraic expressions.
Prerequisites: Fundamental Concepts of Algebra
Academy Algebra II/Trig 5.5: The Real Zeros of a Polynomial Functions HW: p.387 (14, 27, 30, 31, 37, 38, 46, 51)
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Complex Zeros; Fundamental Theorem of Algebra
Precalculus Complex Zeros V. J. Motto. Introduction We have already seen that an nth-degree polynomial can have at most n real zeros. In the complex number.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 3 Polynomial and Rational Functions Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Section 4.3 Zeros of Polynomials. Approximate the Zeros.
CSC 221 Computer Organization and Assembly Language
Standards/Objective A.SSE.1 – Interpret parts of an expression
General Results for Polynomial Equations In this section, we will state five general theorems about polynomial equations, some of which we have already.
LOGIC GATES & BOOLEAN ALGEBRA
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 3 Polynomial and Rational Functions.
THE FUNDAMENTAL THEOREM OF ALGEBRA. Descartes’ Rule of Signs If f(x) is a polynomial function with real coefficients, then *The number of positive real.
Zero of Polynomial Functions Factor Theorem Rational Zeros Theorem Number of Zeros Conjugate Zeros Theorem Finding Zeros of a Polynomial Function.
Complex Number Systems and Simplifying Algebraic Expressions Critical Thinking Skill: Demonstrate Understanding of Concepts.
Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.
Changing Bases. Base 10: example number ³ 10² 10¹ 10 ⁰ ₁₀ 10³∙2 + 10²∙1 + 10¹∙ ⁰ ∙0 = 2120 ₁₀ Implied base 10 Base 8: 4110 ₈ 8³ 8².
6-5 & 6-6 Finding All Roots of Polynomial Equations Warm Up: Factor each expression completely. 1. 2y 3 + 4y 2 – x 4 – 6x 2 – : Use factoring.
Section 4.6 Complex Zeros; Fundamental Theorem of Algebra.
Complex Number System Reals Rationals (fractions, decimals) Integers (…, -1, -2, 0, 1, 2, …) Whole (0, 1, 2, …) Natural (1, 2, …) Irrationals.
The Fundamental Theorem of Algebra Intro - Chapter 4.6.
2.5 The Fundamental Theorem of Algebra. The Fundamental Theorem of Algebra The Fundamental Theorem of Algebra – If f(x) is a polynomial of degree n, where.
REMAINDER THEOREM HONORS ADVANCED ALGEBRA PRESENTATION 2-7.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
Every polynomial P(x) of degree n>0 has at least one zero in the complex number system. N Zeros Theorem Every polynomial P(x) of degree n>0 can be expressed.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
Complex Numbers Any number in form a+bi, where a and b are real numbers and i is imaginary. What is an imaginary number?
1.2 Properties of Real Numbers
College Algebra Chapter 3 Polynomial and Rational Functions
Bell Ringer 1. What is the Rational Root Theorem
3.8 Complex Zeros; Fundamental Theorem of Algebra
Lesson 2.5 The Fundamental Theorem of Algebra
Review Algebra.
Complex Numbers Real Numbers Imaginary Numbers Rational Numbers
Fundamental Theorem of Algebra
I. Finite Field Algebra.
Today we will Finish chapter 5
Chapter 2: Number Systems
Algebraic Expressions
Packet #9 Zeros of Polynomials
Presentation transcript:

Canonical Representation Genetic Programming John Woodward and Ruibin Bai The University of Nottingham Ningbo

Outline of Talk 1 GP search spaces often consist of programs which represent functions multiple times. Can we construct a search space which consists of only a single representation of each function. As there is only a single program mapping to a single function, it should be easier to search. It may also have interesting theoretical properties (e.g. bloat, no free lunch, mutation operators).

Outline of Talk 2 Canonical representation means one way to represent an object (e.g. numbers). Question – can we do the same with “programs and expressions”? Specifically function set {+, -, *, /} U {1, x} Fundamental theorem of arithmetic Fundamental theorem of algebra

Comparing Numbers and Programs We are used to dealing with number systems, where each (natural or rational) number has a single representation (think of unary, binary, decimal (Roman), Chinese/Japanese). This may be a desirable situation with programs. Imagine a situation where we did not have a canonical representation of numbers.

Standard Program Spaces The space of programs maps to the space of functions. This is a many to one mapping. Two different programs may represent the same function programsfunctions

Canonical Program Spaces The space of programs maps to the space of functions. This is a one to one mapping. Two different programs represent different functions programs functions

MOTIVATION In a standard GP search space two syntactically different programs may represent the same function. If a mutation operator produces a new program - it may not produce a new function. We want two syntactically different program to represent different functions. Therefore search, via GP (or other method), should be faster as time is not wasted re-sampling the same functions.

WHY DO MULTIPLE FORMS EXIST? if the GP function set contains functions which are Associative (x+y)+z = x+(y+z) Distributive a*(b+c) = a*b+a*c Commutative x*y*z = z*y*x All these properties give more than one way to write the same function.

FUNDAMENTAL THEOREM - ARITHMETIC Any natural number can be written as the unique product of primes. Primes are 2, 3, 5, 7, 11, 13, 17, … E.G = 2^4.3^1.5^2 Or as a vector (4, 1, 2) Where Vi are natural numbers, And Pi is the ith prime number

GENERATING CANONICAL RATIONALS 6936/1200 – Chinese remainder theorem (3, 1, 0, 0, 0, 0, 2) = 6936 (4, 1, 2) = 1200 (0, 0, 0, 0, 0, 0, 2) (1, 0, 2) Can immediately see common factors. Where Vi are integers, And Pi is the ith prime number

SIMPLER FUNCTION SETS (without /) function set {+} U {x} gives nx (where n is a Natural Number > 0) function set {+, -} U {x} gives mx (where m is an integer) function set {+, - *} U {x} gives set of polynomials with integer coefficients.

General Form Given the primitive set{+, -, *, /} U {1, x} We can write a function uniquely as the expression below. C i are complex numbers (conjugates) exp i are integers

WHAT WE ARE NOT DOING!!! we are not constructing a GP-syntax tree and doing an algebraic simplification. E.g. (1+x)-1 reduces to x As the +1 and -1 cancel out! we want to directly generate programs in canonical form and guarantee immediately that they cannot be simplified.

ORDERING THE PROGRAMS we can order natural and real numbers. Most math textbooks do not define an order on complex numbers. Some even say we cannot say is 2i+1 > 3 ? Yes we can define order on complex numbers.

THREE DIFFERENT SITUATIONS Can we construct canonical search spaces. – with less functions - this is not a problem if we can approximate closely enough. – with more functions (still an improvement if we have less functions than the typical search space.) – with exactly one program to one function (as we have done in this paper)

RELATIONSHIP BETWEEN SEARCH AND BIAS – TYPICAL SEARCH SPACE Here one function is preferred twice as much as the other function. It is also the case for random search, and enumeration, that the same function is twice as easy to find.

RELATIONSHIP BETWEEN SEARCH AND BIAS – CANONICAL SEARCH SPACE Here all functions are in equal preference. It is also the case for random search, and enumeration, that the functions are equally easy to find.

POTENTIAL BENEFITS. No free lunch is only valid for canonical search spaces. It is not valid for standard GP bloat - the uncontrolled growth of programs during evolution - will not happen here?!?!? diversity of genotype and phenotype are easier to manage. bias in GP comes largely from the fact that there are many more programs representing some functions than others.

FURTHER WORK this is the content of a current grant proposal so please check my webpage for latest publications on this.

SUMMARY GP search spaces often consist of programs which represent functions multiple times. Given the primitive set{+, -, *, /} U {1, x} We can write a function uniquely as the expression below. C i are complex numbers (conjugates) exp i are integers