Exact Inference. Kayhan Batmanghelich

Similar documents
Probabilistic Graphical Models

Machine Learning. Inference and Learning in GM. Eric Xing , Fall Lecture 18, November 10, b r a c e

Machine Learning. Graphical Models and Exact Inference. Eric Xing , Fall Lecture 17, November 7, Receptor A X 2.

Machine Learning. Recap of Basic Prob. Concepts

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Weighted Graphs. Weighted graphs may be either directed or undirected.

Tangram Fractions Overview: Students will analyze standard and nonstandard

OpenMx Matrices and Operators

Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

d e c b a d c b a d e c b a a c a d c c e b

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Bayesian belief networks

Problem solving by search

1 Introduction to Modulo 7 Arithmetic

Applications of trees

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

EE1000 Project 4 Digital Volt Meter

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Lecture 20: Minimum Spanning Trees (CLRS 23)

In which direction do compass needles always align? Why?

Constructive Geometric Constraint Solving

Planar convex hulls (I)

Graphs Depth First Search

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Graph Search (6A) Young Won Lim 5/18/18

QUESTIONS BEGIN HERE!

CS 103 BFS Alorithm. Mark Redekopp

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Priority Search Trees - Part I

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

The University of Sydney MATH 2009

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

0.1. Exercise 1: the distances between four points in a graph

Strongly connected components. Finding strongly-connected components

Graphs Breadth First Search

The Z transform techniques

Module 2 Motion Instructions

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

CS 241 Analysis of Algorithms

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

ROSEMOUNT 3051S SCALABLE OR 3051SMV MULTIVARIABLE COPLANAR PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Seven-Segment Display Driver

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method:

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Cooperative Triangulation in MSBNs. without Revealing Subnet Structures. Y. Xiang. Department of Computer Science, University of Regina

CS September 2018

Plan. I Gale-Shapley Running Time. I Graphs. I Motivation and definitions I Graph traversal: BFS and DFS

Planar Upward Drawings

Garnir Polynomial and their Properties

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

ROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

Sybil Attacks and Defenses

SOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)

CS 461, Lecture 17. Today s Outline. Example Run

7 ACM FOR FRAME 2SET 6 FRAME 2SET 5 ACM FOR MAIN FRAME 2SET 4 MAIN FRAME 2SET 3 POLE ASSLY 1 2 CROWN STRUCTURE ASSLY 1 1 CROWN ASSLY 1

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Transcription:

xt Inrn Kyn tngli

roilisti Inrn n Lrning W now v opt rprsnttions o proility istriutions: rpil Mols M M sris uniqu proility istriution Typil tsks: Tsk 1: How o w nswr quris out M.g. M XY? W us inrn s n or t pross o oputing nswrs to su quris Tsk 2: How o w stit plusil ol M ro t? y tis I n t grp strutur n/or t prtrs i. W us lrning s n or t pross o otining point stit o M. ii. ut or ysin ty sk pm wi is tully n inrn prol. iii. Wn not ll vrils r osrvl vn oputing point stit o M n to o inrn to iput t issing t. ri Xing @ MU 2005-2015 2

Qury 1: Liklioo Most o t quris on y sk involv vin vin is n ssignnt o vlus to st vrils in t oin Witout loss o gnrlity = { X k+1 X n } Siplst qury: oput proility o vin x!x = å" å tis is otn rrr to s oputing t liklioo o x 1 x k 1 k ri Xing @ MU 2005-2015 3

Qury 2: onitionl roility Otn w r intrst in t onitionl proility istriution o vril givn t vin X X X = = å X = x tis is t postriori li in X givn vin Mrginliztion: t pross o suing out t unosrv or "on't r" vrils z is ll. Y = å Y Z = z z x ri Xing @ MU 2005-2015 4

pplitions o postriori li rition : wt is t proility o n outo givn t strting onition g! " # t qury no is snnt o t vin ignosis: wt is t proility o iss/ult givn syptos g!#" t qury no n nstor o t vin Not: T irtionlity o inortion low twn vrils is not rstrit y t irtionlity o t gs in M. You will s or pplition uring Lrning unr prtil osrvtion?? ri Xing @ MU 2005-2015 5

Qury 3: Most rol ssignnt l In tis qury w wnt to in t ost prol joint ssignnt M or so vrils o intrst l Su rsoning is usully pror unr so givn vin n ignoring t vlus o otr vrils z : M Y = rg x yî Y y = rg x yîy å z y z l tis is t xiu postriori onigurtion o y. ri Xing @ MU 2005-2015 7

pplitions o M lssiition in ost likly ll givn t vin xplntion wt is t ost likly snrio givn t vin utionry not: T M o vril pns on its "ontxt"---t st o vrils n jointly quri y 1 y 2 y 1 y 2 xpl: 0 0 0.35 M o Y 1? M o Y 1 Y 2? 0 1 0.05 1 0 0.3 1 1 0.3 ri Xing @ MU 2005-2015 8

oplxity o Inrn T: oputing X = x in M is N-r l Hrnss os not n w nnot solv inrn. It siply sys tt tr xist iiult inrn prols. It pns on t strutur. l l It iplis tt w nnot in gnrl prour tt works iintly or ritrry Ms or prtiulr ilis o Ms w n v provly iint prours ri Xing @ MU 2005-2015 9

Lnsp o inrn lgorits xt inrn lgorits T liintion lgorit Mssg-pssing lgorit su-prout li propgtion T juntion tr lgorits pproxit inrn tniqus Stosti siultion / spling tos Mrkov in Mont rlo tos Vritionl lgorits ri Xing @ MU 2005-2015 10

Vril liintion

Mrginliztion n liintion signl trnsution ptwy: Qury: Wt is t liklioo tt protin is tiv? = åååå y in oposition w gt = åååå nïv sution ns to nurt ovr n xponntil nur o trs ri Xing @ MU 2005-2015 25

ååå å åååå = = liintion on ins Rrrnging trs irst su! tn "... 26

ååå ååå å = = p Now w n pror innrost sution Tis sution "liints" on vril ro our sution rgunt t "lol ost". X liintion on ins 27

åå åå å ååå = = = p p p X X liintion in ins Rrrnging n tn suing gin w gt ri Xing @ MU 2005-2015 28

liintion in ins X X X X liint nos on y on ll t wy to t n w gt = å p oplxity: lvr liintion tks!#$ % vrsus!$ ' or t nïv ppro. ri Xing @ MU 2005-2015 29

ssoitivity o trix ultiplition Roo 1 Roo 2 Roo 3 x 1 x 2 x T px 1 x T =px 1 TY 1 t=1 px t+1 x t px t+1 = ix t = j =M ij 2 3 0.7 0.5 0 40.3 0.3 0.55 0 0.2 0.5

ssoitivity o trix ultiplition Roo 1 Roo 2 Roo 3 x 1 x 2 x T px 5 = ix 1 = 1 = X px t+1 = ix t = j =M ij 2 3 0.7 0.5 0 40.3 0.3 0.55 0 0.2 0.5 x 4 x 3 x 2 px 5 x 4 px 4 x 3 px 3 x 2 px 2 x 1 = 1 =[M 4 v] i

rt Is in ML: Mssg ssing ount t solirs tr's 1 o 1 or you 2 or you 3 or you 4 or you 5 or you 5 in you 4 in you 3 in you 2 in you 1 in you pt ro MKy 2003 txtook 32

rt Is in ML: Mssg ssing ount t solirs 2 or you tr's 1 o li: Must 2 + 1 + 3 = 6 o us only s y inoing ssgs 3 in you pt ro MKy 2003 txtook 33

rt Is in ML: Mssg ssing ount t solirs 1 or you tr's 1 o li: Must 1 + 1 + 4 = 6 o us li: Must 2 + 1 + 3 = 6 o us only s y inoing ssgs 4 in you pt ro MKy 2003 txtook 34

Wt out gnrl?

rt Is in ML: Mssg ssing solir rivs rports ro ll rns o tr 3 r 7 r 1 o 11 r = 7+3+1 pt ro MKy 2003 txtook 40

rt Is in ML: Mssg ssing solir rivs rports ro ll rns o tr 3 r 7 r = 3+3+1 3 r pt ro MKy 2003 txtook 41

rt Is in ML: Mssg ssing solir rivs rports ro ll rns o tr 11 r = 7+3+1 7 r 3 r pt ro MKy 2003 txtook 42

rt Is in ML: Mssg ssing solir rivs rports ro ll rns o tr 3 r 7 r 3 r li: Must 14 o us pt ro MKy 2003 txtook 43

rt Is in ML: Mssg ssing solir rivs rports ro ll rns o tr 3 r 7 r 3 r li: Must 14 o us wouln't work orrtly wit 'loopy' yli grp pt ro MKy 2003 txtook 44

or oplx ntwork oo w H Wt is t proility tt wks r lving givn tt t grss onition is poor? ri Xing @ MU 2005-2015 52

Qury: N to liint: H Initil tors: oos n liintion orr: H Stp 1: onitioning ix t vin no i.. on its osrv vlu i.. : Tis stp is isoorpi to rginliztion stp: H g ~ p = = ~ = å = p ~ xpl: Vril liintion ri Xing @ MU 2005-2015 53

Qury: N to liint: Initil tors: Stp 2: liint H g g 1 = = å g g g p xpl: Vril liintion ri Xing @ MU 2005-2015 54

Qury: N to liint: Initil tors: Stp 3: liint g g H xpl: Vril liintion = å p ri Xing @ MU 2005-2015 55

Qury: N to liint: Initil tors: Stp 4: liint H xpl: Vril liintion g g = å p ri Xing @ MU 2005-2015 56

Qury: N to liint: Initil tors: Stp 5: liint H xpl: Vril liintion g g = å p 57

Qury: N to liint: Initil tors: Stp 6: liint H xpl: Vril liintion = å p g g ri Xing @ MU 2005-2015 58

g g Qury: N to liint: Initil tors: Stp 7: liint H xpl: Vril liintion = å p ri Xing @ MU 2005-2015 59

Qury: N to liint: Initil tors: Stp 8: Wrp-up H xpl: Vril liintion g g ~ p p = å = p p ~ = å p p ~ ri Xing @ MU 2005-2015 60

grp liintion lgorit orliztion H H grp liintion Unrstning Vril liintion ri Xing @ MU 2005-2015 62

rp liintion gin wit t unirt M or orliz N rp V n liintion orring I liint nxt no in t orring I Roving t no ro t grp onnting t rining nigors o t nos T ronstitut grp 'V ' Rtin t gs tt wr rt uring t liintion prour T grp-torti proprty: t tors rsult uring vril liintion r ptur y roring t liintion liqu ri Xing @ MU 2005-2015 63

grp liintion lgorit Intrit trs orrspon to t liqus rsult ro liintion orliztion H H grp liintion Unrstning Vril liintion H ri Xing @ MU 2005-2015 64

liintion liqus H H Mssgs snt: H g Mssgs snt: ri Xing @ MU 2005-2015 65

rp liintion n rginliztion Inu pnny uring rginliztion vs. liintion liqu Sution <-> liintion Intrit tr <-> liintion liqu H g g ri Xing @ MU 2005-2015 66 1 2 2 1 3 3 4 4 5 5 6 6 7 7

liqu tr Mssg ro on 1 to 2: Multiply ll inoing ssgs wit t lol tor n su ovr vrils tt r not sr g H = å p g ri Xing @ MU 2005-2015 67

oplxity T ovrll oplxity is trin y t nur o t lrgst liintion liqu Wt is t lrgst liintion liqu? pur grp torti qustion Tr-wit k: on lss tn t sllst ivl vlu o t rinlity o t lrgst liintion liqu rnging ovr ll possil liintion orring goo liintion orrings l to sll liqus n n ru oplxity wt will ppn i w liint "" irst in t ov grp? in t st liintion orring o grp --- N-r à Inrn is N-r ut tr otn xist "ovious" optil or nr-opt liintion orring ri Xing @ MU 2005-2015 68

xpls Str Tr ri Xing @ MU 2005-2015 69

Mor xpl: Ising ol ri Xing @ MU 2005-2015 70

Liittion o rour liintion Liittion H H ri Xing @ MU 2005-2015 71

Our lgorit so r nswrs only on qury.g. on on no o w n to o oplt liintion or vry su qury? liintion º ssg pssing on liqu tr Mssgs n rus H g H H º ro liintion to Mssg ssing = å g p ri Xing @ MU 2005-2015 72

ro liintion to Mssg ssing Our lgorit so r nswrs only on qury.g. on on no o w n to o oplt liintion or vry su qury? liintion º ssg pssing on liqu tr notr qury... g H Mssgs n r rus otrs n to roput ri Xing @ MU 2005-2015 73

Sury T sipl liint lgorit pturs t ky lgoriti Oprtion unrlying proilisti inrn: --- Tt o tking su ovr prout o potntil untions Wt n w sy out t ovrll oputtionl oplxity o t lgorit? In prtiulr ow n w ontrol t "siz" o t suns tt ppr in t squn o sution oprtion. T oputtionl oplxity o t liint lgorit n ru to purly grptorti onsirtions. Tis grp intrprttion will lso provi ints out ow to sign iprov inrn lgorit tt ovro t liittion o liint. ri Xing @ MU 2005-2015 74