{"id":191,"date":"2013-08-07T21:13:47","date_gmt":"2013-08-08T01:13:47","guid":{"rendered":"http:\/\/sites.hampshire.edu\/ci-lab\/?p=191"},"modified":"2013-08-09T11:40:47","modified_gmt":"2013-08-09T15:40:47","slug":"22-july-2013","status":"publish","type":"post","link":"https:\/\/sites.hampshire.edu\/ci-lab\/2013\/08\/07\/22-july-2013\/","title":{"rendered":"22 July 2013"},"content":{"rendered":"<p>Present: Lee, Tom (scribe), Kyle, Jake, Kwaku (hangouts)<\/p>\n<p>Next lab meetings: 7\/30\/13 and 8\/7\/13.<\/p>\n<p>Reading: Lee will send around a paper to read for the 8\/7\/13 meeting.<\/p>\n<h2>Lexicase<\/h2>\n<ul>\n<li>Lee&#8217;s improvements:\n<ul>\n<li>Idea: what&#8217;s important is case sequences, not cases by themselves.<\/li>\n<li>&#8220;Condensed&#8221; lexicase: Find all of the sets of elites that can be reached through lexicase, and then select one at random and a random individual from that set.<\/li>\n<\/ul>\n<\/li>\n<li>Paper\n<ul>\n<li>Rough draft by end of week<\/li>\n<li>Ignore population size \/ test case stuff for now.<\/li>\n<\/ul>\n<\/li>\n<li>Homologous selection and lexicase together?<\/li>\n<\/ul>\n<h2>Brevis<\/h2>\n<p>Speedups are in the works.<\/p>\n<h2>Visualization<\/h2>\n<ul>\n<li>Stack traces are looking great!<\/li>\n<li>Tom will send Jake some stack traces of big (maybe real) programs.<\/li>\n<\/ul>\n<h2>GECCCO Report<\/h2>\n<ul>\n<li>Jeff Clune &#8211; discussed connection costs in programs<\/li>\n<li>Kris Krawiec &#8211; GSXover discussion<\/li>\n<li>Stack-based workshop was small but some interesting ideas<\/li>\n<li>Leonardo Trujillo &#8211; discussion about novelty search to refine fitness function.\n<ul>\n<li>includes program modality<\/li>\n<li>combines advantages of novelty search and guided by error search.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Present: Lee, Tom (scribe), Kyle, Jake, Kwaku (hangouts) Next lab meetings: 7\/30\/13 and 8\/7\/13. Reading: Lee will send around a paper to read for the 8\/7\/13 meeting. Lexicase Lee&#8217;s improvements: Idea: what&#8217;s important is case sequences, not cases by themselves. &#8220;Condensed&#8221; lexicase: Find all of the sets of elites that can be reached through lexicase, [&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-191","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/191"}],"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=191"}],"version-history":[{"count":3,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/191\/revisions"}],"predecessor-version":[{"id":194,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/191\/revisions\/194"}],"wp:attachment":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/media?parent=191"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/categories?post=191"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/tags?post=191"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}