Introduction to Graphical Models

Similar documents
Lecture 6: Coding theory

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Analysis of Temporal Interactions with Link Streams and Stream Graphs

A Graphical Characterization of Lattice Conditional Independence Models

CIT 596 Theory of Computation 1. Graphs and Digraphs

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

Logic, Set Theory and Computability [M. Coppenbarger]

CS 491G Combinatorial Optimization Lecture Notes

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Solutions to Problem Set #1

Lecture 8: Abstract Algebra

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Lecture 2: Cayley Graphs

The DOACROSS statement

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

Logic Synthesis and Verification

Implication Graphs and Logic Testing

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

Outline. Theory-based Bayesian framework for property induction Causal structure induction

Arrow s Impossibility Theorem

Individual Group. Individual Events I1 If 4 a = 25 b 1 1. = 10, find the value of.

PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1. Sahika Genc, Stéphane Lafortune

Solutions to Assignment 1

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Arrow s Impossibility Theorem

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

Algorithm Design and Analysis

Obstructions to chordal circular-arc graphs of small independence number

Let s divide up the interval [ ab, ] into n subintervals with the same length, so we have

Outline Data Structures and Algorithms. Data compression. Data compression. Lossy vs. Lossless. Data Compression

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

Algorithm Design and Analysis

Factorising FACTORISING.

Chapter Five - Eigenvalues, Eigenfunctions, and All That

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Inequalities of Olympiad Caliber. RSME Olympiad Committee BARCELONA TECH

Proportions: A ratio is the quotient of two numbers. For example, 2 3

Aperiodic tilings and substitutions

Bisimulation, Games & Hennessy Milner logic

Lecture Notes No. 10

Lesson 2.1 Inductive Reasoning

6.5 Improper integrals

Quadratic Residues. Chapter Quadratic residues

Comparing the Pre-image and Image of a Dilation

Can one hear the shape of a drum?

Section 2.3. Matrix Inverses

If we have a function f(x) which is well-defined for some a x b, its integral over those two values is defined as

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area

Duke Math Meet

Electrical Circuits II (ECE233b)

Separable discrete functions: recognition and sufficient conditions

QUADRATIC EQUATION. Contents

Sections 5.3: Antiderivatives and the Fundamental Theorem of Calculus Theory:

5.4, 6.1, 6.2 Handout. As we ve discussed, the integral is in some way the opposite of taking a derivative. The exact relationship

Antiderivatives Introduction

On the Spectra of Bipartite Directed Subgraphs of K 4

k and v = v 1 j + u 3 i + v 2

CS 573 Automata Theory and Formal Languages

Finite state automata

Lecture 11 Binary Decision Diagrams (BDDs)

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

CS 360 Exam 2 Fall 2014 Name

Type 2: Improper Integrals with Infinite Discontinuities

Eigenvectors and Eigenvalues

Lesson 55 - Inverse of Matrices & Determinants

Completeness of an Euler Diagrammatic System with Constant and Existential Points

NON-DETERMINISTIC FSA

Technology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework

ANALYSIS AND MODELLING OF RAINFALL EVENTS

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity

( ) { } [ ] { } [ ) { } ( ] { }

Section 4.4. Green s Theorem

Linear Inequalities. Work Sheet 1

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

Discrete Structures Lecture 11

Section 1.3 Triangles

Hyers-Ulam stability of Pielou logistic difference equation

Coalgebra, Lecture 15: Equations for Deterministic Automata

On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures

QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

McGill University Math 354: Honors Analysis 3 Fall 2012 Solutions to selected Exercises. g(x) 2 dx 1 2 a

arxiv: v1 [cs.dm] 24 Jul 2017

If the numbering is a,b,c,d 1,2,3,4, then the matrix representation is as follows:

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA

50 AMC Lectures Problem Book 2 (36) Substitution Method

System Validation (IN4387) November 2, 2012, 14:00-17:00

A Primer on Continuous-time Economic Dynamics

DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS

SIMPLE NONLINEAR GRAPHS

arxiv: v1 [cs.cg] 28 Apr 2009

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year

Global alignment. Genome Rearrangements Finding preserved genes. Lecture 18

Graph width-parameters and algorithms

Transcription:

Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II

Introution n Review 2

Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set of noes E: the set of eges In grhil moels the rnom vriles re reresente y the noes. sttistil reltionshis etween the vriles re reresente y the eges. A A A B C B C B C D Direte grh D Unirete grh D Ftor grh

Purose of using Grhil Moels Intuitive n visul reresenttion A grh is n intuitive wy of reresenting n visulizing the reltionshis mong vriles. Ineenene / onitionl ineenene A grh reresents onitionl ineenene reltionshis mong vriles. Cusl reltionshis eision mking ignosis system et. Effiient omuttion With grhs effiient rogtion lgorithms n e efine. Belief-rogtion juntion tree lgorithm Whih rts of the moeling lok effiient omuttion? 4

Ineenene For simliity it is ssume tht the istriution of rnom vrile hs the roility ensity funtion x. Ineenene n Y re ineenent Y x y x y Y Y Y Dwi s nottion 5

Conitionl Ineenene Conitionl roility Conitionl roility ensity of Y given Conitionl ineenene Def. Y y x n Y re onitionlly ineenent given Z ef. Y x y x y Y x y x y Y Z x y z Z x z Y Z y z Y Y Z for ll z with Z z > 0. Y Z x y z x for ll yz with YZ yz > 0. YZ Z z If we lrey know Z itionl informtion on Y oes not inrese the knowlege on. 6

Conitionl Ineenene - Exmles Seeing Fine Tye of Cr erhs Seeing Fine Tye of Cr See Aility of Tem A Aility of Tem B Aility of Tem A Aility of Tem B Outome of Tem A n B 7

Conitionl Ineenene Another hrteriztion of on. ineenene Proosition Y Z there exist funtions fxz n gyz suh tht YZ x y z f x z g y z for ll x y n z with Z z > 0. Corollry 2 Y there exist funtions fx n gy suh tht Y x y f x g y for ll x y. 8

Conitionl Ineenene Proof of Pro.. Cler from the efinition. For ny x y n z with Z z > 0 We hve Thus 9

Unirete Grh n Mrkov Proerty 0

Unirete Grh Unirete Grh G V E : unirete grh V: finite set E V V the orer is neglete. Exmle: Grh terminology V { } E { } Comlete: A sugrh S of V is omlete if ny n in S re onnete y n ege. Clique: A lique is mximl omlete suset w.r.t. inlusion. : omlete ut not lique

Proility n Unirete Grh Proility ssoite with n unirete grh G V E : unirete grh. V { n} K n : rnom vriles inexe y the noe set V. The roility istriution of is ssoite with G if there is nonnegtive funtion ψ C C for eh lique C in G suh tht ψ C C C:lique Nottion: for suset S of V S S An unirete grh oes not seify single roility ut efines fmily of roilities. In other wors it uts restritions y the onitionl ineenene reltions reresente y the grh. 2

Proility n Unirete Grh is ssoite with n unirete grh G if n only if it mits Exmle e 2 e Z ψ ψ ψ :lique C C C Z ψ ftorizes w.r.t. G. ψ C : ftor or otentil Z: normliztion onstnt

Mrkov Proerty Unirete grh n Mrkov roerty Sertion: G V E : unirete grh. A B S: isjoint susets of V. S sertes A from B if every th etween ny in A n in B intersets with S. B 5 A 2 4 S Theorem G V E : unirete grh. : rnom vetor with the istriution ssoite with G. If S sertes A from B then A B S Proof: next leture. 4

5 Mrkov Proerty Exmle { } sertes {} n {e} {} sertes {} n {} e 2 e Z ψ ψ ψ e {} 2 e e Z ψ ψ ψ ~ 2 e Z ψ ψ ψ e g f Z { } e e Z 2 ψ ψ ψ g Z ψ Use ro.. Use ro..

Mrkov Proerty Glol Mrkov Proerty G V E : unirete grh : rnom vetor inexe y V. stisfies glol Mrkov roerty reltive to G if A B S hols for ny trilet ABS of isjoint susets of V suh tht S sertes A from B. The revious theorem tells if the istriution of ftorizes w.r.t. G then stisfies glol Mrkov roerty reltive to G. Remrk: Both of ftorize n glol Mrkov roerty re the roerties regring reltion etween the roility n the unirete grh G. 6

Mrkov Proerty Hmmersley-Cliffor theorem see e.g. Luritzen. Th..9 Theorem 4 G V E : unirete grh : rnom vetor inexe y V. Assume tht the roility ensity funtion of the istriution of is stritly ositive. If stisfies glol Mrkov roerty w.r.t. G then ftorizes w.r.t. G i.e. mits the ftoriztion: ψ C C C:lique. Ftoriztion Th. Th. 4 with ositivity Glol Mrkov 7

Direte Ayli Grh n Mrkov Proerty 8

Direte Ayli Grh Direte Grh G V E : irete grh V: finite set -- noes E V V : set of eges Exmle: V { } E { } Orient the ege y Direte Ayli grh DAG Direte grh with no yles. Cyle: irete th strting n ening t the sme noe. 9

20 DAG n Proility Proility ssoite with DAG A DAG efines fmily of roility istriutions e e e n i i i n K : rents of noe i. { } E j i V j i Exmle: is si to e ssoite with DAG G or ftorizes w.r.t. G.

2 Conitionl Ineenene with DAG Three si ses 2 Note Note: re the sme for n 2.

Conitionl Ineenene with DAG he-to-he or v-struture Note: in re ifferent from n 2. Allergy Col Sneeze If you often sneeze ut you o not hve ol then it is more likely you hve llergy hy fever. 22

D-Sertion Bloke: An unirete th π is si to e loke y suset S in V if there exists noe on the th suh tht either S i n is not he-to-he in π or ii n { } e S φ. he-to-he Desenent: e i { j V irete th from i to j} Exmles S π π π S S π is loke y S π is loke y S π is NOT loke y S 2

D-Sertion -serte: A B S: isjoint susets of V. S -sertes A from B if every unirete th etween in A n in B is loke y S. -sertion n onitionl ineenene Theorem 5 : rnom vetor with the istriution ssoite with DAG G. A B S: isjoint susets of V. If S -sertes A from B then A B S Proof not shown in this ourse. See Luritzen 996.2&.25 24

D-Sertion Exmle S φ. is loke with. is loke with e is loke with e e {} is loke with. is loke with e is loke with e or e 25

Comrison: UDG n DAG Limittion of unirete grh DAG If ny UDG is not le to exress. 26

27 Comrison: UDG n DAG Limittion of DAG Unirete grh No DAG exresses these onitionl ineenene reltionshis. {} {} If every noe h the form the grh woul e yle. Thus there must e v-struture. Conitionl ineenene of the rents of the v-struture given the other two noes nnot e exresse y DAG. [Sketh of the roof.]

Mini Summry on UDG n DAG Unirete grh Direte yli grh DAG e e Proility ssoite with G ftorizes w.r.t. G Z ψ C C C:lique Proility ssoite with G ftorizes w.r.t. G n n i i i K ftorizes w.r.t. G ftorizes w.r.t. G is glol Mrkov reltive to G. is -glol Mrkov reltive to G. i.e. if S sertes A from B i.e. if S -sertes A from B then. then. A B S A B S 28

Aenix: Terminology on Grhs Unirete grh G V E Ajent: n in V re jent if Neighor: E. ne { V E}. ne DAG G V E Prents: Chilren: Anestors: Desenents: { V E}. h { V E}. n { V irete th from to }. e { V irete th from to }. n e 29

Ftor Grh n Mrkov Proerty 0

Ftor Grh i Ftor grh G V E V I F: two tyes of noes j l I: vrile noes vrile noe F: ftor noes ftor noe E: unirete eges k E I F V V. An ege exists only etween ftor noe n vriles noe. A ftor grh is in generl lle irtite grh. A irtite grh is n unirete grh G V E suh tht V V V V V φ E V. 2 2 V2

Proility n Ftor grh Ftor grh to reresent ftoriztion i i I : rnom vetor inexe y finite set I. The ensity of the istriution of ftorizes s f F: finite set. Z F Z: normliztion onstnt f : non-negtive funtion of suset of { n } i i I where I : { i I i E} The ftor grh G V E reresenting the ftoriztion is given y V I F E { i I F i I} 2

Proility n Ftor grh Exmle I {245} F {} A roility is often given y ftorize form i.e. rout of ftors with smll numer of vriles. 2 4 5 5 4 4 2 f f f Z

Mrkov Proerty of Ftor Grh nei: neighor of vrile noe i ne i { j I F{ i j} I }. 2 A th in ftor grh is sequene of vriles noes suh tht ny onseutive 5 4 two noes re neighors. e.g. 2 5. ne4 Ftoriztion glol Mrkov roerty Theorem 6 Assume the roility of ftorizes w.r.t. ftor grh G. S A B: isjoint susets of the vrile noes I. If every th etween ny in A n in B intersets with S then A B S 4

5 Mrkov Proerty of Ftor Grh Exmle Exmle 2 2 g f Z 2 4 5 2 g f 2 5 4 4 2 f f f Z 5 {4} Diret onfirmtion 2 5 4 5 4 4 2 2 f f f Z 5 4 4 f g f Z 5 4 4 Z ψ ϕ Pro.

Comrison of Ftor Grh n other grhs Ftor grh n UDG 2 2 f 2 Z 2 f f Ftor grhs Unirete grh i ii iii 2 2 2 UDG nnot istinguish the ftoriztion in i n ii All the vrile noes in i ii n iii hve the sme neighors n thus the sme onitionl ineenene reltionshis no onitionl ineenene. The ftor grh reresenttions of i n ii re ifferent. 6

Comrison of Ftor Grh n other grhs Ftor grh n DAG 2 2 2 DAG 2 Ftor grh 2 Ineenene of n 2 nnot e reresente. 7

More on Mrkov Proerty 8

Mrkov Proerties Revisite Mrkov roerties for n unirete grh G V E : unirete grh. : rnom vetor inexe y V. V \ { } ne Lol Mrkov stisfies lol Mrkov roerty reltive to G if for ny noe V \{ } ne ne ne Pirwise Mrkov stisfies irwise Mrkov roerty reltive to G if ny non-jent ir of noes stisfies V \{ } V \{ } 9

Mrkov Proerties Revisite Theorem 7 Ftoriztion glol Mrkov lol Mrkov irwise Mrkov roof ftoriztion glol Mrkov : Theorem. glol Mrkov lol Mrkov : esy. lol Mrkov irwise Mrkov : nees some mth Exerise. Hmmersley-Cliffor sserts tht the irwise Mrkov roerty mens ftoriztion w.r.t. the grh uner ositivity of the ensity. Theorem 4 ssumes glol Mrkov ut the ssertion hols uner irwise Mrkov ssumtoin. Similr notions re efine for irete n ftor grhs. 40

Proof for Unirete Cse We show slight generliztion of Theorem. Theorem 8 Let G V E e n unirete grh. If the istriution of ftorizes s ψ C C Z C:omlete then stisfies glol Mrkov roerty reltive to G i.e. for trilet S A B suh tht S sertes A from B the onitionl ineenene A B S hols. A S B Proof A ~ Let ~ B ~ A { V \ S A π th from to π S φ} ~ ~ B V \ A S. 4

Proof for Unirete Cse ~ A A Oviously n sine S sertes A from B ~ B B. We n show for ny omlete sugrh C ~ ~ or hols. C S C S A C S B If there is nothing to rove. Assume C S. Suose tht the ove ssertion oes not hol then ~ ~ Let A ~ ~ C A φ n C B φ. C n B C. Beuse n re in the omlete sugrh C there is n ~ ege e onneting n. Sine A there is th π from to A without interseting S. Conneting π n e mkes th from to A without interseting S whih ontrits with the efinition of n. A ~ B ~ A S A ~ B ~ e B 42

Proof for Unirete Cse From this ft ψ C C ψ C C ψ Z Z C:omlete C:omlete ~ C S A D D:omlete ~ D S B D f ~ g ~ A S B S whih mens n thus ~ A ~ B S A B S. Proosition Q.E.D. 4

44 Converting Ftor Grh to UDG Neighorhoo struture y ftor grh mke n unirete grh. Eh ftor in A oes not orreson to lique in U ut to omlete sugrh in U. In generl ftorizes s for the onverte unirete grh U. LA 5 5 4 4 2 f f f f Z Ftor grh G 2 4 5 2 4 5 Unirete grh U :omlete C C C Z ψ

Proof for Ftor Grh Proof of Theorem 6 Ftoriztion Glol Mrkov for ftor grh From the ove oservtion the roof is one y Theorem 8. 45

Prtil Exmles Mrkov rnom fiel for imge nlysis Z i j E ex U ij i j i j Mixture moel n hien Mrkov moel Conitionl rnom fiel for sequentil t Lfferty et l. 200 Hien lel sequene Oservtion 46

Summry A grh reresents the onitionl ineenene reltionshis mong rnom vriles. There re mny tyes of grh to reresent roilities. Unirete grh Direte grh Ftor grh Ftoriztion of the roility istriution w.r.t. grh mens Mrkov Proerty of the istriution reltive to the grh. 47