Attendance: Karthik, Wren, Tom, Bill, Tim, Mike, Beryl, Nic, Lee, Eddie (scribe)

GECCO abstracts due in January. Papers in February.

Pucks bonding in the future. Significance of improved efficiency still under investigation.

Mike has solid crime data.

Beryl working on building linear algebra clojure library that includes complex numbers.

Tom

Use post run simplification to generalize.

1. How well works on training data

2. How well it generalized to test data

3. How well it generalized after simplification

Data for above is available.

Karthick Presentation

• SMT
  • Used for model checking, program verification, and function synthesis given constrains.
• Semantic code search
  • Using I/O pairs as opposed to keyword searches
• Can prove generalization of synthesized functions by converting the function into its constrains.
• Constraints become effective way describe function’s semantics

Meeting times Wednesday 9-12?. In ash 111.
Jason Moore now at Upenn.
Moshe and Lee grant submitted.
A ridiculously interesting and high volume amount of stuff and exciting graphs.
Uncle Bob.
Karthik giving tutorial.
Tom’s stuff.
Wren’s project. Wisconsin card projects.
evolving one model for two different conditions
individual is just the equation.
don’t evolve the parameter, but when testing an individual sweep the parameter.
Jordan Grafman Northwestern. Data.
TomWeed out the crap of simplifying programs. Mixed cross validation and simplification.
1. Niching
2. post run simplification
3. stats stuff that has been on the email list
4. stuff that started with hill-climbing. How do you limit runs?
5. multi-chance lexicase.
Replace space with newline program. Tournament selection just as a well as lexicase selection
if you look at it in a different problem.
Niching- Look at stuff
“I’m not sure what that means”.
Tsm