Monthly Archives: January 2014

22 January 2014

1 Reply

Attending: Lee, Omri, Frode, Tom (hangout, scribe), Kwaku (hangout), Karthik (hangout)

Business

  • We should think about what to do for GPTP.
  • No concrete plans for Moshe Sipper.

Omri Div III

Will involve QGame and using it for educational purposes.

Simplification

May or may not use WC data depending on space constraints.

Calc Thoughts

  • Last gasp for trying to get Calc to work
  • Tried, didn’t work:
    • Simplified instruction set
    • “behaviors” = “domains” test case generation
    • Put “old” test cases at front of lexicase order
  • New things to try:
    • Two alignment deviations: most of the time use 0, but sometimes use large (like 100)
    • ULTRA tags by running one parent program, and then when run second, when it tags something instead ULTRA what it would tag with whatever is already tagged there.
    • Similarly, could take each parent and create its tagspace, and then re-create a program from the tagspace, lining up positions of tagging instructions for the same tag by padding with ‘ultra-padding, which will be removed after ULTRA.
    • Maybe try trivial geography with lexicase.

15 January 2014

1 Reply

Present

Tom, Omri, Bill, Karthik (scribe)

Administrative stuff

Meeting times – Wednesdays 10-12 Starting 22nd January 2014
29th – GECCO deadline.

ULTRA stuff

Bug with ULTRA-padding and push simplification fixed.
Single symbol program issues.
Potentially solve with making all programs sequences.
Single instruction to ULTRA where ULTRA does nothing. #New issue

Push Licensing

Push licensing currently unresolved.
The Eclipse Public License ? The one Clojure uses for now.

GECCO paper stuff

– Differential equations
– Word count
– Push simplification
– (Abstract on calc)
– Finite algebras
Random stuff : Source code addition to GECCO ? Anonymous everything – tricky.
Fischer’s exact test – potential statistical significance test.
Justifications for why some particular statistics were used.
Program self reference interference with simplification.

George

Searching for Quantum algorithms to use GP on. Qgame used? Possibly depends on the need for complex numbers.

Karthik

Lexicase + GSX. Lexicase currently done without push. Possible extension of some GSX stuff to also use Lexicase.

Calc problem updates

Complimentary mate selection.
Reversed lexicase selection.
Errors, Pass/Fail, and Novelty
The Genetics : Recombination for correct functionality.
Tag modifications for combining functionality correctly ?
Small deviations vs Large deviations with ULTRA.
ULTRA causing program size to increase because of the program size average

Clojush simplifcation

Simplifcation at the end of the run
Simplification for reporting
Simplification during run – where simplification is a genetic operator. (Messy courtesy fitness evaluation being built IN to a genetic operator)

Bill

Different differential equation models.
“Non inheritable epigenesis”
Hill climbing and improvement.
Eventual plan to shift away from MATLAB to write code.

More random stuff

Turing completeness vs non turing complete languages for evolution.
Generative testing + Lexicase selection.

8 January 2014

1 Reply

Present

Lee, Thom, Bill, Karthik, Omri (scribe)

Spring meeting time

Provisionally Wednesdays 10-12am (Karthik will vid-chat in for half of it)

Starting with January 22nd

GECCO

Abstract deadline January 15th

Paper deadline January 29th

Workshop paper deadline sometime in March maybe

Finite algebra paper

Lee is working on this with David Clark and Maarten Keijzer

Maarten has come up with an awesome algorithm, but it is domain specific

On the calculator problem

Lee has been trying or thinking about a bunch of new things…

  • Augmentive test cases
  • Complementary lexicase selection (opposites attract)
  • Concatenative tagging
  • Maybe pass/fail?
  • Maybe novelty search?
  • How do we ensure generalization?

…But nothing seems to be working

Thom’s update

On the word count problem paper…

  • General solutions greater than 0 and less than 10 percent of the time, independent of parameters
  • What statistics to use? Maybe Fisher’s Exact Test? Maybe look at Luke’s Meta-heuristics book, the chapter on stats?

On the auto-simplification paper…

  • To what extent does is hill-climbing program simplification effective?
  • Which problems: Pagie-1? Digital multiplier? WC? Odd?

Karthik’s update

He’s very interested in satisfiability module theory

Looking into Z3 (from Microsoft)

Thinking about combining GSX and lexicase

Next meeting

Friday January 17th 10-12am