{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/97818"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/97818","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A novel inference algorithm on graphical model","abstract":"We present a framework for approximate inference that, given a factor graph and a subset of its variables, produces an approximate marginal distribution over these variables with bounds. The factors of the factor graph are abstracted as as piecewise polynomial functions with lower and upper bounds, and a variant of the variable elimination algorithm solves the inference problem over this abstraction. The resulting distributions bound quantifies the error between it and the true distribution. We also give a set of heuristics for improving the bounds by further refining the binary space partition trees.","abstract_html":"We present a framework for approximate inference that, given a factor graph and a subset of its variables, produces an approximate marginal distribution over these variables with bounds. The factors of the factor graph are abstracted as as piecewise polynomial functions with lower and upper bounds, and a variant of the variable elimination algorithm solves the inference problem over this abstraction. The resulting distributions bound quantifies the error between it and the true distribution. We also give a set of heuristics for improving the bounds by further refining the binary space partition trees.","abstract_has_math":false,"creators":["Pu, Yewen"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Armando Solar-Lezama."],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015","date_published":"2015","updated_at":"2026-07-22T22:21:25Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/97818","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Armando Solar-Lezama."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Pu, Yewen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-07-17T19:49:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-07-17T19:49:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2015"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/97818"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-58)."]},{"key":"dc:description.abstract","label":"Abstract","values":["We present a framework for approximate inference that, given a factor graph and a subset of its variables, produces an approximate marginal distribution over these variables with bounds. The factors of the factor graph are abstracted as as piecewise polynomial functions with lower and upper bounds, and a variant of the variable elimination algorithm solves the inference problem over this abstraction. The resulting distributions bound quantifies the error between it and the true distribution. We also give a set of heuristics for improving the bounds by further refining the binary space partition trees."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["A novel inference algorithm on graphical model"]}]}],"canonical_facts":{"dc:contributor.advisor":["Armando Solar-Lezama."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Pu, Yewen"],"dc:date.accessioned":["2015-07-17T19:49:45Z"],"dc:date.available":["2015-07-17T19:49:45Z"],"dc:date.issued":["2015"],"dc:description":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-58)."],"dc:description.abstract":["We present a framework for approximate inference that, given a factor graph and a subset of its variables, produces an approximate marginal distribution over these variables with bounds. The factors of the factor graph are abstracted as as piecewise polynomial functions with lower and upper bounds, and a variant of the variable elimination algorithm solves the inference problem over this abstraction. The resulting distributions bound quantifies the error between it and the true distribution. We also give a set of heuristics for improving the bounds by further refining the binary space partition trees."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/97818"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["A novel inference algorithm on graphical model"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:25Z"}