{"id":468,"date":"2014-03-14T15:22:05","date_gmt":"2014-03-14T19:22:05","guid":{"rendered":"http:\/\/sites.hampshire.edu\/ci-lab\/?p=468"},"modified":"2014-03-14T15:22:05","modified_gmt":"2014-03-14T19:22:05","slug":"5-march-2014","status":"publish","type":"post","link":"https:\/\/sites.hampshire.edu\/ci-lab\/2014\/03\/14\/5-march-2014\/","title":{"rendered":"5 March 2014"},"content":{"rendered":"<p>Attending: Lee, Tom (scribe), Bill, Omri, Kartik (virtual), Kwaku (virtual)<\/p>\n<h2>Z3<\/h2>\n<p>Karthik &#8211; can probably connect Clojush and Z3 through Java API.<\/p>\n<h2>Lexicase Paper Rejection<\/h2>\n<ul>\n<li>Some possible additions ideas:\n<ul>\n<li>Investigate how much of pop is let around after each step of lexicase<\/li>\n<li>time runs for this paper<\/li>\n<\/ul>\n<\/li>\n<li>Lexicase speedup idea: use a lexicase comparator, and then find optimum in population\n<ul>\n<li>To do this, would need a lexicase comparator that takes 2 individuals (or error vectors) as well as a test case ordering, and returns the individual with better initial cases based on the ordering<\/li>\n<li>Then, you can use the comparator to find the &#8220;max&#8221; (or &#8220;min&#8221;) of the population &#8211; basically, use it with reduce to find best individual for that ordering<\/li>\n<li>We should include this as a possibility in paper, but probably not implement it.<\/li>\n<\/ul>\n<\/li>\n<li>Thoughts on niching\/fitness sharing:\n<ul>\n<li>We should definitely enhance our discussion with related techniques, but not necessarily implement and compare with them<\/li>\n<li>We should clarify how lexicase is different<\/li>\n<li>If we find one option that is common and simple, we could try it out if we have time.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Attending: Lee, Tom (scribe), Bill, Omri, Kartik (virtual), Kwaku (virtual) Z3 Karthik &#8211; can probably connect Clojush and Z3 through Java API. Lexicase Paper Rejection Some possible additions ideas: Investigate how much of pop is let around after each step of lexicase time runs for this paper Lexicase speedup idea: use a lexicase comparator, and [&hellip;]<\/p>\n","protected":false},"author":635,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-468","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/468"}],"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\/635"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/comments?post=468"}],"version-history":[{"count":1,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/468\/revisions"}],"predecessor-version":[{"id":469,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/468\/revisions\/469"}],"wp:attachment":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/media?parent=468"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/categories?post=468"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/tags?post=468"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}