Show simple item record

Files in this item

Cover for Identifying Influential Inputs in Probabilistic Logic Programming
dc.contributor.advisorZhou, Wenchao
dc.creator
dc.date.accessioned2020-06-30T13:14:49Z
dc.date.available2020-06-30T13:14:49Z
dc.date.created2020
dc.date.issued
dc.date.submitted01/01/2020
dc.identifier.uri
dc.descriptionM.S.
dc.description.abstractCombining probabilistic theory and statistic reasoning, probabilistic logic pro- gramming (PLP) has various applications on many data-driven problems. Notable examples include machine learning models such as probabilistic soft logic (PSL) and Markov Logic Network (MLN). Despite the prevalence of PLP, there are few tools for us to debug and analyze PLP programs. In our prior work, we developed a PLP program debugging system which we call P3 for ProbLog. In this thesis, we further extend the system to more general PLP programs where the rule weights represent not only probabilities but also parameters in Markov Random Fields. Our PLP analyzing systems are based on probabilistic provenance which records the derivations of queried tuples. Based on the probabilistic provenance, we provide 3 types of queries: expla- nation query for inference derivation, probability query for calculating conditional probabilities, and influence query for identifying influential inputs. We evaluate our system on several PLP cases, such as Smoke and Visual Question Answering (VQA), and the evaluation results demonstrate the effectiveness of our system.
dc.formatPDF
dc.format.extent62 leaves
dc.languageen
dc.publisherGeorgetown University
dc.sourceGeorgetown University-Graduate School of Arts & Sciences
dc.sourceComputer Science
dc.subjectData Provenance
dc.subjectMarkov Logic Network
dc.subjectProbabilistic Logic Programming
dc.subject.lcshComputer science
dc.subject.otherComputer science
dc.titleIdentifying Influential Inputs in Probabilistic Logic Programming
dc.typethesis


This item appears in the following Collection(s)

Show simple item record