{"id":88,"date":"2005-06-17T09:00:39","date_gmt":"2005-06-17T15:00:39","guid":{"rendered":"\/?p=88"},"modified":"2005-06-17T09:01:01","modified_gmt":"2005-06-17T15:01:01","slug":"reopening-a-problem","status":"publish","type":"post","link":"https:\/\/hunch.net\/?p=88","title":{"rendered":"Reopening RL->Classification"},"content":{"rendered":"<p>In research, it&#8217;s often the case that solving a problem helps you realize that it wasn&#8217;t the right problem to solve.  This is the case for the &#8220;<a href=\"https:\/\/hunch.net\/index.php?p=30\">reduce RL to classification<\/a>&#8221; problem with the solution hinted at <a href=\"https:\/\/hunch.net\/index.php?p=31\">here<\/a> and turned into a paper <a href=\"https:\/\/hunch.net\/~jl\/projects\/reductions\/RL_II\/paper.ps\">here<\/a>.  <\/p>\n<p>The essential difficulty is that the method of stating and analyzing reductions ends up being nonalgorithmic (unlike previous reductions) unless you work with learning from teleoperated robots as <a href=\"http:\/\/www.cs.colorado.edu\/~grudic\/\">Greg Grudic<\/a> does.  The difficulty here is due to the reduction being dependent on the optimal policy (which a human teleoperator might simulate, but which is otherwise unavailable).<\/p>\n<p>So, this <a href=\"https:\/\/hunch.net\/index.php?p=30\">problem<\/a> is &#8220;open&#8221; again with the caveat that this time we want a more algorithmic solution.  <\/p>\n<p>Whether or not this is feasible at all is still unclear and evidence in either direction would greatly interest me.  A positive answer might have many practical implications in the long run.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In research, it&#8217;s often the case that solving a problem helps you realize that it wasn&#8217;t the right problem to solve. This is the case for the &#8220;reduce RL to classification&#8221; problem with the solution hinted at here and turned into a paper here. The essential difficulty is that the method of stating and analyzing &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/hunch.net\/?p=88\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Reopening RL->Classification&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16,12,11],"tags":[],"class_list":["post-88","post","type-post","status-publish","format-standard","hentry","category-problems","category-reductions","category-reinforcement"],"_links":{"self":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/88","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=88"}],"version-history":[{"count":0,"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/88\/revisions"}],"wp:attachment":[{"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=88"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=88"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=88"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}