{"id":426,"date":"2013-12-20T20:55:29","date_gmt":"2013-12-21T01:55:29","guid":{"rendered":"http:\/\/sites.hampshire.edu\/ci-lab\/?p=426"},"modified":"2013-12-20T20:55:29","modified_gmt":"2013-12-21T01:55:29","slug":"18-december-2013","status":"publish","type":"post","link":"https:\/\/sites.hampshire.edu\/ci-lab\/2013\/12\/20\/18-december-2013\/","title":{"rendered":"18 December 2013"},"content":{"rendered":"<p>Present: Lee, Tom (scribe), Bill, Omri, Frode<\/p>\n<h2>Bill<\/h2>\n<p>Discussion of GP stats. Basically, it depends on what problem you&#8217;re working on, but something like MBF, computational effort, or number of successes may be what you&#8217;re looking for. None of them are perfect, and we&#8217;re not sure whether or not <a href=\"http:\/\/en.wikipedia.org\/wiki\/Fisher%27s_exact_test\">Fisher&#8217;s Exact Test<\/a> can be applied to success rates since it may require a number of samples.<\/p>\n<h2>Simplification<\/h2>\n<ul>\n<li>Maybe a paper related to simplification of evolved Push programs?<\/li>\n<li>Tom can do experiments, Lee can write up?<\/li>\n<li>Even more interesting given context of recent work on semantic genetic operators.<\/li>\n<\/ul>\n<h2>Documentation (Frode)<\/h2>\n<p>After some discussion, we decided to try Sphynx for documenting Push (the language), and some sort of automatic tool for documenting Clojush.<\/p>\n<h2>WC Problem<\/h2>\n<ul>\n<li>Some discussion of maybe also evolving &#8220;front end&#8221;\/main method of WC program to more closely mimic the utility.<\/li>\n<li>Tom will try some runs not using no-paren-mut + yes bushy code.<\/li>\n<li>It may be worth trying some different ULTRA parameters once we know what seems best out of ()-padding\/&#8217;ultra_padding and no-paren-mut\/bushy-code.<\/li>\n<li>May be worthwhile to try ULTRA with a range of parameters.\n<ul>\n<li>It may be worthwhile to make this a logarithmic range. Tom&#8217;s intuition says yes, but doesn&#8217;t have a good explanation yet.<\/li>\n<li>Lee will implement this.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<h2>Omri Div III<\/h2>\n<p>Sounds like it will involve Ventpods!<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Present: Lee, Tom (scribe), Bill, Omri, Frode Bill Discussion of GP stats. Basically, it depends on what problem you&#8217;re working on, but something like MBF, computational effort, or number of successes may be what you&#8217;re looking for. None of them are perfect, and we&#8217;re not sure whether or not Fisher&#8217;s Exact Test can be applied [&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-426","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/426"}],"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=426"}],"version-history":[{"count":1,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/426\/revisions"}],"predecessor-version":[{"id":427,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/posts\/426\/revisions\/427"}],"wp:attachment":[{"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/media?parent=426"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/categories?post=426"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.hampshire.edu\/ci-lab\/wp-json\/wp\/v2\/tags?post=426"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}