Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings
Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard. We explain how knowledge graph embeddings can be used to approximate probabilistic inference efficiently using the example of Statistical EL (SEL), a statistical extension of the lightweight Description Logic EL. We provide proofs for runtime and soundness guarantees, and empirically evaluate the runtime and approximation quality of our approach.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph EmbeddingsvalidSimilar Papers 제목 키워드 기반
Model-free generalized fiducial inference
Motivated by the need for the development of safe and reliable methods for uncertainty quantification in machine learning, I propose and develop ideas for a model-free statistical framework for imprecise probabilistic pr…
Conformal PredictionmodelPredictionUncertainty QuantificationProbabilistic Knowledge Graph Construction: Compositional and Incremental Approaches
Knowledge graph construction consists of two tasks: extracting information from external resources (knowledge population) and inferring missing information through a statistical analysis on the extracted information (kno…
graph constructionTowards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation
Many inductive logic programming (ILP) methods are incapable of learning programs from probabilistic background knowledge, e.g. coming from sensory data or neural networks with probabilities. We propose Propper, which ha…
Graph Neural NetworkInductive logic programmingComposing graphical models with neural networks for structured representations and fast inference
We propose a general modeling and inference framework that composes probabilistic graphical models with deep learning methods and combines their respective strengths. Our model family augments graphical structure in late…
Variational InferenceRigorous Explanation of Inference on Probabilistic Graphical Models
Probabilistic graphical models, such as Markov random fields (MRF), exploit dependencies among random variables to model a rich family of joint probability distributions. Sophisticated inference algorithms, such as belie…
AttributeDecision Making