Author Archives: wlacava

Lab Notes 10.21.15

attendees: Bill, Lee, Tom, Nic, Eva, Eddie, Saul, Ben

GECCO tutorials

  • discussed Nic doing a graph database tutorial. maybe better to make it GP analytics type of tutorial
  • Might be worth making Expressive GP more of a group tutorial with demos from recent work

Lee working on his Robust AI grant

  • future work: AI ethics
  • make grant a collaborative project with Nic and Tom

Autoconstructive runs

  • not many successes after 2000 generations
  • more successes than before
  • 23 is not the issue!
  • Nic’s students will now poke around in results to see what there is to see
  • Nic: in current results, variation is happening and contributing to the finding of solutions

Tom offered to have guest speakers for his class next spring (late April – late May)


  • we are human competitive with 1st year programmers with Tom’s results
  • needs to be something done in the last year
  • maybe use Push in an actual programming class online
  • coursera automatically grades software
  • can push bytecode be reverse assembled into java?
  • use Push in a hackathon or programming challenge?

next week: talk about GECCO,

11/4: Bill’s practice talk for UPenn

Eddie: how to generate subsets of data sets for testing/ store and move test cases / generate new test cases for generalization?

  • Lee and Nic: do cross-fold validation, and look at Tom’s thesis for test domains

Tozier does not like “keep number reasonable” restriction on  integers, thinks it should not be restricted in this way. Wants someone to work with him on fixing this.

  • Saul: I’ll reach out to Tozier to work on this

Notes 12-17-2014

Lee email Paolo about meeting time next semester


  • final materials to wrap up independent studies
  • GPEM papers
  • Tim’s talk
  • simplification for generalization
  • epigenetic discussions


  • potential collaboration
  • discussion of work with John Klein
  • “binding” and its various definitions
  • how to incorporate ideas of bonding into pucks

Lexicase selection

  • inverse co-solvability lexicase bias for ordering cases
  • how to order cases to preserve niching, but also solve hard cases
  • what if the age of the individuals was considered in ordering the cases? that would favor cases that are newly solved. doesn’t everyone want to write more code?


  • in general results look good. need to reconcile differences between which settings work for symreg versus problem synthesis

Tom’s talk: machine learning classification of endothelial cell morphologies


10 September 2014


Cellular Automata

  • Physics conservation – can it help avoid fixed states or limit cycles?
  • How do we get to the emergence of adaptive complexity?
  • Scott Aaronson’s work on cellular automata

Tom’s Work

  • check sum problem – hard to solve
  • mutual information – Lance willing to give lecture
    • if two things are related functionally in any way
    • dependent on distribution of random variables

Clojush Demo

Fly Demo

10 June 2014

hampshire computational intelligence laboratory

Rian Shims visiting from Binghamton University

Introductions by lab members
August 19 – no meeting


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

– semantic code search using Z3


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


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


  • Push visualization


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


  • hierarchical temporal memory (HTM) algorithms


12 February 2014


Attendance: Omri, Tom, Jake, Lee, Karthik, Lee, Frode, Bill

discussed Claire Le Goues talk

Moshe Sipper visiting Wednesday February 26 – Sunday March 2

GP Theory and Practice meeting in May
– Idea for submission: work with Moshe
– human competitive results for
– taxonomize past results
– Humies: winners are already categorized
– use visit to characterize human competitive results and write literature review
– trying to schedule February 28th visit
– tentative: 10-2:30 working meeting, 2:30 talk

ULTRA parens study
– random program generator seems to produce reasonable numbers of parentheses
– ULTRA operator adds parens
– removing first and last parens before alternation helps parentheses numbers
– no alignment deviation lowers parens
– still seems like there is parenthesis bloat coming from ULTRA

– Auto-construction
– trying to engineer emergent diversity
– agent-based
– natural environment with disease agents that provide selection pressure

Linear Push
– how to implement begins and ends with functions that require chunks of code
– push with no parentheses and ends: no begins
– other idea: implement second chromosome with ends / no ends

Claire Le Goues




/* Style Definitions */
{mso-style-name:”Table Normal”;
mso-padding-alt:0in 5.4pt 0in 5.4pt;
font-family:”Times New Roman”,”serif”;}

04 December 2013


Lee, Tom, Omri, Bill, Frode


Ways to measure success rates in GP:

Koza – computational effort

Charles O’Fria recommend Fisher’s Exact Test

Lee’s calculator problem

Trying to solve calculator problem by adjusting ULTRA parameters, tag spaces

Down a rabbit hole and considering auto-reconstruction (eyebrows raised)

Running one with the tag space of the other, which is kind of a form of auto-construction

Rule out direct clones

Tom thinks there are problems other than the genetic operators that are affecting the results

Need to use ULTRA with bushy trees to get more parentheses

Or linear Push

Epigenetics and Mutation Hotspots

Bill’s Dev approach

Use developmental fitness and size to determine mutation/crossover pressure and/or intron assignment in binary vector of same length as genome

Discussed biological occurences of epigenetics and mutation hotspots

Tom’s Lexicase investigations

Best individual assignment needs to be rerun/checked, reporting wrong thing

ULTRA runs look even better, maybe subtree ones too

Need corrected versions of graphs


Tom, Bill working on papers

Find good example problems to demonstrate infrastructure

Frode and Eddy?