Timezone: »
We introduce Logical Credal Networks (or LCNs for short) -- an expressive probabilistic logic that generalizes prior formalisms that combine logic and probability. Given imprecise information represented by probability bounds and conditional probability bounds on logic formulas, an LCN specifies a set of probability distributions over all its interpretations. Our approach allows propositional and first-order logic formulas with few restrictions, e.g., without requiring acyclicity. We also define a generalized Markov condition that allows us to identify implicit independence relations between atomic formulas. We evaluate our method on benchmark problems such as random networks, Mastermind games with uncertainty and credit card fraud detection. Our results show that the LCN outperforms existing approaches; its advantage lies in aggregating multiple sources of imprecise information.
Author Information
Radu Marinescu (IBM Research)
Haifeng Qian (Amazon AWS AI Labs)
Alexander Gray (International Business Machines)
Debarun Bhattacharjya (IBM Research)
Francisco Barahona (IBM Research AI)
Tian Gao (IBM Research)
Ryan Riegel (IBM Research)
Ryan Riegel is a researcher in the AI Reasoning group at IBM Research. He works on neuro-symbolic reasoning methods and their related technologies, including sound and complete real-valued logic, logically constrained neural network learning, extensions of said to temporal and modal logic, and applications including natural language question answering. In the past, he has worked on fast algorithms for a family of nonparametric machine learning methods dubbed generalized N-Body problems, which includes all-nearest-neighbors and kernel density estimation. He also co-founded an AI startup where he oversaw and contributed to the development of enterprise-grade machine learning software for Big Data. He received a Joint BS in Mathematics and Computer Science from Harvey Mudd College and a PhD in Computer Science from the Georgia Institute of Technology.
Pravinda Sahu
More from the Same Authors
-
2022 Poster: Hedging as Reward Augmentation in Probabilistic Graphical Models »
Debarun Bhattacharjya · Radu Marinescu -
2021 Poster: Causal Inference for Event Pairs in Multivariate Point Processes »
Tian Gao · Dharmashankar Subramanian · Debarun Bhattacharjya · Xiao Shou · Nicholas Mattei · Kristin P Bennett -
2020 : Oral: Karthikeyan Shanmugam »
Debarun Bhattacharjya -
2020 Poster: DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networks »
Dennis Wei · Tian Gao · Yue Yu -
2020 Spotlight: DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networks »
Dennis Wei · Tian Gao · Yue Yu -
2020 : Decision procedures for real valued reasoning »
Ryan Riegel -
2019 Poster: Counting the Optimal Solutions in Graphical Models »
Radu Marinescu · Rina Dechter -
2019 Spotlight: Counting the Optimal Solutions in Graphical Models »
Radu Marinescu · Rina Dechter -
2018 Poster: From Stochastic Planning to Marginal MAP »
Hao(Jackson) Cui · Radu Marinescu · Roni Khardon -
2018 Poster: Proximal Graphical Event Models »
Debarun Bhattacharjya · Dharmashankar Subramanian · Tian Gao -
2018 Spotlight: Proximal Graphical Event Models »
Debarun Bhattacharjya · Dharmashankar Subramanian · Tian Gao -
2015 Poster: Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models »
Akihiro Kishimoto · Radu Marinescu · Adi Botea