{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/32004"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/32004","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Lifted Inference for Relational Hybrid Models","abstract":"Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions using PRGMs enables many current and future applications, such as medical informatics, environmental engineering, financial forecasting and robot localizations. Scaling inference algorithms for large models is a key challenge for scaling up current applications and enabling future ones. This thesis presents new insights into large-scale probabilistic graphical models. It provides fresh ideas for maintaining a compact structure when answering questions or inferences about large, continuous models. The insights result in a key contribution, the Lifted Relational Kalman filter (LRKF), an efficient estimation algorithm for large-scale linear dynamic systems. It shows that the new relational Kalman filter enables scaling the exact vanilla Kalman filter from 1,000 to 1,000,000,000 variables. Another key contribution of this thesis is that it proves that typically used probabilistic first-order languages, including Markov Logic Networks (MLNs) and First-Order Probabilistic Models (FOPMs), can be reduced to compact probabilistic graphical representations under reasonable conditions. Specifically, this thesis shows that aggregate operators and the existential quantification in the languages are accurately approximated by linear constraints in the Gaussian distribution. In general, probabilistic first-order languages are transformed into nonparametric variational models where lifted inference algorithms can efficiently solve inference problems.","abstract_html":"Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions using PRGMs enables many current and future applications, such as medical informatics, environmental engineering, financial forecasting and robot localizations. Scaling inference algorithms for large models is a key challenge for scaling up current applications and enabling future ones. This thesis presents new insights into large-scale probabilistic graphical models. It provides fresh ideas for maintaining a compact structure when answering questions or inferences about large, continuous models. The insights result in a key contribution, the Lifted Relational Kalman filter (LRKF), an efficient estimation algorithm for large-scale linear dynamic systems. It shows that the new relational Kalman filter enables scaling the exact vanilla Kalman filter from 1,000 to 1,000,000,000 variables. Another key contribution of this thesis is that it proves that typically used probabilistic first-order languages, including Markov Logic Networks (MLNs) and First-Order Probabilistic Models (FOPMs), can be reduced to compact probabilistic graphical representations under reasonable conditions. Specifically, this thesis shows that aggregate operators and the existential quantification in the languages are accurately approximated by linear constraints in the Gaussian distribution. In general, probabilistic first-order languages are transformed into nonparametric variational models where lifted inference algorithms can efficiently solve inference problems.","abstract_has_math":false,"creators":["Choi, Jaesik"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Amir, Eyal","Roth, Dan","LaValle, Steven M.","Poole, David"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-06-27T21:24:04Z","date_published":"2012-06-27T21:24:04Z","updated_at":"2026-07-22T22:25:30Z","subjects":["Probabilistic Graphical Models","Relational Hybrid Models","Lifted Inference","First-Order Probabilistic Models","Probabilistic Logic","Kalman filter","Relational Kalman filter","Variational Learning, Markov Logic Networks"],"languages":["en"],"rights":["Copyright 2012 Jaesik Choi"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/32004","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Amir, Eyal","Roth, Dan","LaValle, Steven M.","Poole, David"]},{"key":"dc:creator","label":"Author","values":["Choi, Jaesik"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-06-27T21:24:04Z","2014-06-28T10:00:25Z","2012-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Probabilistic Graphical Models","Relational Hybrid Models","Lifted Inference","First-Order Probabilistic Models","Probabilistic Logic","Kalman filter","Relational Kalman filter","Variational Learning, Markov Logic Networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 Jaesik Choi"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/32004"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions using PRGMs enables many current and future applications, such as medical informatics, environmental engineering, financial forecasting and robot localizations. Scaling inference algorithms for large models is a key challenge for scaling up current applications and enabling future ones. This thesis presents new insights into large-scale probabilistic graphical models. It provides fresh ideas for maintaining a compact structure when answering questions or inferences about large, continuous models. The insights result in a key contribution, the Lifted Relational Kalman filter (LRKF), an efficient estimation algorithm for large-scale linear dynamic systems. It shows that the new relational Kalman filter enables scaling the exact vanilla Kalman filter from 1,000 to 1,000,000,000 variables. Another key contribution of this thesis is that it proves that typically used probabilistic first-order languages, including Markov Logic Networks (MLNs) and First-Order Probabilistic Models (FOPMs), can be reduced to compact probabilistic graphical representations under reasonable conditions. Specifically, this thesis shows that aggregate operators and the existential quantification in the languages are accurately approximated by linear constraints in the Gaussian distribution. In general, probabilistic first-order languages are transformed into nonparametric variational models where lifted inference algorithms can efficiently solve inference problems.","Item withdrawn by Alexis Thompson (athmpsn1@illinois.edu) on 2012-04-18T13:19:58Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5)","Made available in DSpace on 2012-06-27T21:24:04Z (GMT). No. of bitstreams: 2 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5) license.txt: 4059 bytes, checksum: 70040e07f0c5c88c546ece0e620570e9 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-06-27T21:24:49Z Item is restricted until 2014-06-27T21:24:27Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:25Z Item was in collections: Dissertations and Theses - Computer Science (ID: 587) Graduate Theses and Dissertations at Illinois (ID: 204) No. of bitstreams: 2 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5) license.txt: 4059 bytes, checksum: 70040e07f0c5c88c546ece0e620570e9 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:25Z"]},{"key":"dc:title","label":"Title","values":["Lifted Inference for Relational Hybrid Models"]}]}],"canonical_facts":{"dc:contributor":["Amir, Eyal","Roth, Dan","LaValle, Steven M.","Poole, David"],"dc:creator":["Choi, Jaesik"],"dc:date":["2012-06-27T21:24:04Z","2014-06-28T10:00:25Z","2012-05"],"dc:description":["Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning of PGMs. Answering questions using PRGMs enables many current and future applications, such as medical informatics, environmental engineering, financial forecasting and robot localizations. Scaling inference algorithms for large models is a key challenge for scaling up current applications and enabling future ones. This thesis presents new insights into large-scale probabilistic graphical models. It provides fresh ideas for maintaining a compact structure when answering questions or inferences about large, continuous models. The insights result in a key contribution, the Lifted Relational Kalman filter (LRKF), an efficient estimation algorithm for large-scale linear dynamic systems. It shows that the new relational Kalman filter enables scaling the exact vanilla Kalman filter from 1,000 to 1,000,000,000 variables. Another key contribution of this thesis is that it proves that typically used probabilistic first-order languages, including Markov Logic Networks (MLNs) and First-Order Probabilistic Models (FOPMs), can be reduced to compact probabilistic graphical representations under reasonable conditions. Specifically, this thesis shows that aggregate operators and the existential quantification in the languages are accurately approximated by linear constraints in the Gaussian distribution. In general, probabilistic first-order languages are transformed into nonparametric variational models where lifted inference algorithms can efficiently solve inference problems.","Item withdrawn by Alexis Thompson (athmpsn1@illinois.edu) on 2012-04-18T13:19:58Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5)","Made available in DSpace on 2012-06-27T21:24:04Z (GMT). No. of bitstreams: 2 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5) license.txt: 4059 bytes, checksum: 70040e07f0c5c88c546ece0e620570e9 (MD5)","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2012-06-27T21:24:49Z Item is restricted until 2014-06-27T21:24:27Z","Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:25Z Item was in collections: Dissertations and Theses - Computer Science (ID: 587) Graduate Theses and Dissertations at Illinois (ID: 204) No. of bitstreams: 2 Choi_Jaesik.pdf: 2053094 bytes, checksum: c55236ba731635fdb61154fac978ab2a (MD5) license.txt: 4059 bytes, checksum: 70040e07f0c5c88c546ece0e620570e9 (MD5)","Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2014-06-28T10:00:25Z"],"dc:identifier":["http://hdl.handle.net/2142/32004"],"dc:language":["en"],"dc:rights":["Copyright 2012 Jaesik Choi"],"dc:subject":["Probabilistic Graphical Models","Relational Hybrid Models","Lifted Inference","First-Order Probabilistic Models","Probabilistic Logic","Kalman filter","Relational Kalman filter","Variational Learning, Markov Logic Networks"],"dc:title":["Lifted Inference for Relational Hybrid Models"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:30Z"}