Timezone: »

Tom Minka · John Winn

Mon Dec 08 08:45 PM -- 12:00 AM (PST) @

Gates are a new notation for representing mixture models and context-sensitive independence in factor graphs. Factor graphs provide a natural representation for message-passing algorithms, such as expectation propagation. However, message passing in mixture models is not well captured by factor graphs unless the entire mixture is represented by one factor, because the message equations have a containment structure. Gates capture this containment structure graphically, allowing both the independences and the message-passing equations for a model to be readily visualized. Different variational approximations for mixture models can be understood as different ways of drawing the gates in a model. We present general equations for expectation propagation and variational message passing in the presence of gates.

Author Information

Tom Minka (MSR)
John Winn (Microsoft Research)

Related Events (a corresponding poster, oral, or spotlight)

  • 2008 Spotlight: Gates »
    Tue. Dec 9th 04:29 -- 04:30 AM Room

More from the Same Authors