{"id":122,"date":"2013-08-07T20:52:41","date_gmt":"2013-08-08T00:52:41","guid":{"rendered":"http:\/\/sites.hampshire.edu\/ci-lab\/?p=122"},"modified":"2013-08-07T20:52:41","modified_gmt":"2013-08-08T00:52:41","slug":"13-july-2012","status":"publish","type":"post","link":"https:\/\/sites.hampshire.edu\/ci-lab\/2013\/08\/07\/13-july-2012\/","title":{"rendered":"13 July 2012"},"content":{"rendered":"<h2>Admin<\/h2>\n<ul>\n<li>GECCO receipts &#8211; get to Lee with signed forms<\/li>\n<\/ul>\n<h2>GECCO thoughts<\/h2>\n<ul>\n<li>Our talks were well-received<\/li>\n<li>Maarten Keijzer ideas: Push Fourth (one stack), Bad Hash Function (tag based on content)<\/li>\n<li>GP best paper may be related to our work<\/li>\n<li>Discussion of GP as optimization vs. program induction<\/li>\n<li>Discussion of automatic software repair and Simon Harding&#8217;s multi-type Cartesian genetic programming.<\/li>\n<li>Emma: could see GP as a front-facing part of other hybrid ML algorithms, or as an exploratory technique to understand data better, as opposed to a last-ditch effort when other things don&#8217;t work.<\/li>\n<\/ul>\n<h3>Steady-state GP<\/h3>\n<ul>\n<li>Lee gave a description<\/li>\n<li>We may be interested in trying out steady-state PushGP<\/li>\n<li>Also, not sure of relation to ALPS (Age-layered population structure)<\/li>\n<\/ul>\n<h3>Rewarding Tag Usage<\/h3>\n<ul>\n<li>Kwaku and Emma plan to investigate rewarding tags<\/li>\n<li>Encouraging modularity explicitly in the fitness function may be useful<\/li>\n<li>Difficult to know what to reward<\/li>\n<li>Other tag ideas include a shared tag-space in the whole population, or hereditary tag spaces<\/li>\n<\/ul>\n<h3>Blog<\/h3>\n<ul>\n<li>Emma wants to start a blog to encourage communication with the rest of the EC community about issues we think are important<\/li>\n<li>May concentrate on understanding problems<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Admin GECCO receipts &#8211; get to Lee with signed forms GECCO thoughts Our talks were well-received Maarten Keijzer ideas: Push Fourth (one stack), Bad Hash Function (tag based on content) GP best paper may be related to our work Discussion of GP as optimization vs. program induction Discussion of automatic software repair and Simon Harding&#8217;s [&hellip;]<\/p>\n","protected":false},"author":622,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-122","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/122"}],"collection":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/users\/622"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/comments?post=122"}],"version-history":[{"count":2,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/122\/revisions"}],"predecessor-version":[{"id":124,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/122\/revisions\/124"}],"wp:attachment":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/media?parent=122"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/categories?post=122"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/tags?post=122"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}