{"id":257,"date":"2020-11-23T13:49:44","date_gmt":"2020-11-23T18:49:44","guid":{"rendered":"https:\/\/carleton.ca\/rads\/?post_type=cu_event&#038;p=257"},"modified":"2026-03-17T09:47:08","modified_gmt":"2026-03-17T13:47:08","slug":"rads-seminar-from-linear-programming-to-machine-learning","status":"publish","type":"cu_event","link":"https:\/\/carleton.ca\/rads\/event\/rads-seminar-from-linear-programming-to-machine-learning\/","title":{"rendered":"RADS Seminar: From Linear Programming to Machine Learning"},"content":{"rendered":"<header class=\"mb-6 cu-pageheader cu-component-updated md:mb-12\">\n    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] relative after:absolute after:h-px after:bottom-0 pb-5 after:w-10 after:bg-cu-red after:left-px\">\n        \n    <\/h1>\n    \n        <\/header>\n\n    \n    \n    \n    \n    <div class=\"cu-buttongroup cu-component-updated flex flex-wrap md:flex-1 gap-3 md:gap-5 justify-start\">\n                                                                        <\/div>\n    \n<p><a href=\"https:\/\/carleton.ca\/sce\/people\/chinneck\/\">John Chinneck<\/a> will be giving an online seminar titled \u201cFrom Linear Programming to Machine Learning.\u201d<\/p>\n\n\n\n<h4 id=\"seminar-abstract\" class=\"wp-block-heading\">Seminar Abstract:<\/h4>\n\n\n\n<p>Infeasibility arises in linear programming when a subset of the constraints conflicts. One way to analyze the problem is to find the largest subset of constraints that admits a feasible solution (maxFS), or equivalently, find the smallest subset of constraints to remove such that a feasible set is left (minURL). These problems are NP-hard, but there are good heuristics for then. Surprisingly, the problem of finding the most accurate binary linear classifier can be transformed into a maxFS\/minURL problem, as can the problems of feature selection, sparse recovery in compressed sensing, nonnegative matrix factorization etc. The seminar gives an overview of the essential ideas.<\/p>\n","protected":false},"author":2,"featured_media":0,"template":"","meta":{"_acf_changed":false,"footnotes":"","_links_to":"","_links_to_target":""},"cu_event_type":[29,41],"cu_event_audience":[4],"class_list":["post-257","cu_event","type-cu_event","status-publish","hentry","cu_event_type-seminars","cu_event_type-seminars-2020","cu_event_audience-anyone"],"acf":{"cu_event_start_date":"2020-11-30T10:00:00","cu_event_end_date":"2020-11-30T11:00:00","cu_event_location_type":"in-person","cu_event_meeting_address_type":"on-campus","cu_building":false,"cu_event_meeting_room":"","cu_event_meeting_address_full":null,"cu_event_virtual_type":"tbd","cu_event_virtual_meeting_link":"","cu_post_thumbnail":false,"cu_event_cost":"","cu_event_registration":"","cu_event_secondary_button":"","cu_event_contact_name":"RADS Director","cu_event_email":"majumdar@sce.carleton.ca","cu_event_phone":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event\/257","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event"}],"about":[{"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/types\/cu_event"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/users\/2"}],"version-history":[{"count":4,"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event\/257\/revisions"}],"predecessor-version":[{"id":447,"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event\/257\/revisions\/447"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/media?parent=257"}],"wp:term":[{"taxonomy":"cu_event_type","embeddable":true,"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event_type?post=257"},{"taxonomy":"cu_event_audience","embeddable":true,"href":"https:\/\/carleton.ca\/rads\/wp-json\/wp\/v2\/cu_event_audience?post=257"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}