The Approximate Implication Problem For Probabilistic Graphical Models
summary
Defines approximate implication as a linear inequality between mutual informations and asks when exact implications relax to such bounds, proving general impossibility but positive guarantees for common cases: d-separation sound and complete for directed graphical models with a tight lambda = 1 bound for recursive bases and for saturated CIs plus functional dependencies, a |A|·|B| bound for general CIs, and links the acyclic schema error measure J to the model KL divergence (J = KL divergence). Implements a miner that finds hundreds of decomposable models and shows about 10% join error can yield ~80% storage savings.
AI-written summary · about
chapters (24)
- 0:00Intro
- 0:34Outline Background
- 1:03Conditional Independence and PGMs • A conditional independence is an assertion
- 1:40Integrity Constraints in Relational Databases
- 3:29Conditional Independence for Relational DBS
- 5:21d-Separation as Implication
- 6:31Some Notation
- 7:15The Implication Problem: What is known
- 8:20Approximate Conditional Independencies . Current systems of inference assume antecedents
- 12:18Approximate Implication Does not Hold In General
- 13:02Approximate Implication: Results
- 15:05Entropic Functions
- 16:13Proof Technique
- 21:03Proof Intuition: Positive I-Measure
- 24:02Decomposing a Relation
- 26:31Acyclic Schemas have Join Trees
- 28:09Saturated CIS → Acyclic Schemas
- 29:51Information Theory for Acyclic Schemas
- 32:35Approximations
- 33:19Strategy
- 33:39Too Many Saturated CIS...
- 34:29Evaluation
- 35:18Nursery dataset: 12960 tuples, 9atts
- 36:32Future Work
related talks
01h 06mIntroduction to Causal Graphical Models: Graphs, d-separation, do-calculus
01h 06mIntroduction to Causal Graphical Models: Graphs, d-separation, do-calculus
01h 08mIntroduction to Causal Graphical Models: Graphs, d-separation, do-calculus
31mStrong Data Processing Inequalities and Estimation with Constraints
44mMarginal DAG Models Equivalent to Another DAG
01h 05mLogic and Probabilistic Circuits 1
47mApproximate Lifted Inference with Probabilistic Databases
47mLearning Probabilistic Models for Graph Partitioning in the Presence of Noise
