Present

Lance, Lee, Thom, Bill, Tim, Omri (scribe)

Administrative

August 12 & 19 no meetings

Lee will be submitting to Templeton for a grant (origins of life, adaptive complexity stuff)

Lee: contact Bill Tozier about visit

Dartmouth trip–anybody who wants to go is welcome

GECCO

• Bill and Lee have to make posters
• Practice presentations
  • July 1 for Thom
  • Frode? (somebody should email him)
    • should send us his slides by July 1
    • maybe he could record a video that we could watch?

Lance

Lance is here for the year!

He’s very interested in the origins of adaptive complexity, and specifically finds reified autoconstruction a promising line

We discussed VM resource management and arbitrary code generation

Miscellany

Is anybody willing to maintain/re-build the lab website?

• Add python push link
• Include more publications
• Fix things (such as broken link to my own paper)

Apparently it’s Omri’s job now (despite his rejection of it)!

Present

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

Thom

Less than 2000 problem is important–why isn’t it easy?

Thom has no time

Bill

Bill has set up lexicase in his system

Quantum stuff

George to work on minimal evoluationary loop:
1. Get comfortable with ClojureScript workflow
2. Manually try out some qgame programs
3. Generate random qgame programs
4. Very simple selection/reproduction

TDS paper discussion

• Can solve some pretty hard problems, but runs into an “exponential wall”–maybe GP could be really useful here
• Perhaps we should we write to the authors about non-binary test cases in GP (something they seem to have overlooked)
• Case order is manually optimized, whereas in lexicase order is randomized for each evaluation
• Raises the question: how do we deal with large numbers–potentially infinite–test cases?
• Their method has difficulty with arbitrary structure and instructions

Miscellany

There may be a workshop in Newfoundland with Wolfgang

Present

Lee, Thom, Karthik, Bill, Jake, Frode, Kwaku, Omri (scribe)

GPTP

Lee, Thom, Karthik, and Bill are going. They will be collaborating with Moshe.

A little unsure what we’re doing with the Analyzing HUMIEs paper.

GECCO

Frode got his paper accepted to the Undergraduate Workshop at GECCO (yay!), with a revision suggestion that he do runs on additional problems.

Moshe will not be going but someone in his lab will be. So we will use GECCO for collaboration.

Miscellany

We discussed Bill’s PhD application, and the arguments around its significance.

notes
hampshire computational intelligence laboratory

Rian Shims visiting from Binghamton University

Introductions by lab members
August 19 – no meeting

Bill

• Mean Best Fitness or Exact Solutions?
• discussion about which is more useful or better to report
• throw both in to please both camps!

Karthik
– semantic code search using Z3

Omri

•  hampshire grad floating about pioneer valley
•  discussed hackathon and clojure meetup
•  evolutionary loop in quantum computing?

Tom

•  < 2000 problem
• starting with small programs and having a different overall max size seems to improve results
• linear push, closeline, epigenetics on the frontier

Jake

• Push visualization

Lee

• cell visualization
• agent AI discussion for class – how to set up the arbitration in the universe

Rian

• hierarchical temporal memory (HTM) algorithms

Present: Lee, Tom (scribe) Karthik, Bill, Omri

We should invite Ryan Shams to a lab meeting.

Lee’s A-Life-y thing

• Lazy can be annoying
• footnote – agent handling of errors in Clojush should get better
• Reducers might be useful

Bill’s Wind Turbine Results

• Lots of data
• Some promising results so far
• May try co-evolutionary methods

Closeline Linear Push

So far, it is unclear whether this is “The Future” of Push, or just another tool that could be selectively applied depending on the problem. If selective, it would be nice to have a switch in Clojush to turn it on and off. If not, then we should make a final version so others can use it.

Either way, eventually the code should be cleaned up. In particular, maybe all epigenetic lines should be stored in a map of them, so that we can have closelines, offlines, etc.

Less Than 2000 Problem

• There might be something interesting to look into in comparing the complexity of the data to the complexity of the evolved programs. If programs are more complex, then maybe they don’t generalize?
• General principle of “start small” might help somewhere here:
  • Small population
  • small number of test cases
  • small program sizes
• Offline -> epigenetics might be helpful for getting smaller programs of the right size.