{"id":148,"date":"2005-12-09T16:46:10","date_gmt":"2005-12-09T22:46:10","guid":{"rendered":"http:\/\/hunch.net\/?p=148"},"modified":"2005-12-09T16:48:20","modified_gmt":"2005-12-09T22:48:20","slug":"some-nips-papers","status":"publish","type":"post","link":"https:\/\/hunch.net\/?p=148","title":{"rendered":"Some NIPS papers"},"content":{"rendered":"

Here is a set of papers that I found interesting (and why).<\/p>\n

    \n
  1. A PAC-Bayes approach to the Set Covering Machine<\/a> improves the set covering machine. The set covering machine approach is a new way to do classification characterized by a very close connection between theory and algorithm. At this point, the approach seems to be competing well with SVMs in about all dimensions: similar computational speed, similar accuracy, stronger learning theory guarantees, more general information source (a kernel has strictly more structure than a metric), and more sparsity. Developing a classification algorithm is not very easy, but the results so far are encouraging.<\/li>\n
  2. Off-Road Obstacle Avoidance through End-to-End Learning<\/a> and Learning Depth from Single Monocular Images<\/a> both effectively showed that depth information can be predicted from camera images (using notably different techniques). This ability is strongly enabling because cameras are cheap, tiny, light, and potentially provider longer range distance information than the laser range finders people traditionally use.<\/li>\n
  3. The Forgetron: A Kernel-Based Perceptron on a Fixed Budget<\/a> proved that a bounded memory kernelized perceptron algorithm (which might be characterizable as “stochastic functional gradient descent with weight decay and truncation”) competes well with respect to an unbounded memory algorithm when the data contains a significant margin. Roughly speaking, this implies that the perceptron approach can learn arbitary (via the kernel) reasonably simple concepts from unbounded quantities of data.<\/li>\n<\/ol>\n

    In addition, Sebastian Thrun<\/a>‘s “How I won the Darpa Grand Challenge” and Sanjoy Dasgupta<\/a>‘s “Coarse Sample Complexity for Active Learning” talks were both quite interesting.<\/p>\n

    (Feel free to add any that you found interesting.)<\/p>\n","protected":false},"excerpt":{"rendered":"

    Here is a set of papers that I found interesting (and why). A PAC-Bayes approach to the Set Covering Machine improves the set covering machine. The set covering machine approach is a new way to do classification characterized by a very close connection between theory and algorithm. At this point, the approach seems to be … <\/p>\n

    Continue reading “Some NIPS papers”<\/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":[18],"tags":[],"class_list":["post-148","post","type-post","status-publish","format-standard","hentry","category-papers"],"_links":{"self":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/148","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=148"}],"version-history":[{"count":0,"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/148\/revisions"}],"wp:attachment":[{"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=148"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=148"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=148"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}