Contents Intro.

Large scale graphical models naturally arise in many natural language processing applications. They provide an expressive language for users to define their probabilistic models in, and come with a set of generic inference methods, such as belief propagation and its variants. However, for many of the problems we encounter in practice, these methods do not scale up well. For example, when using Belief Propagation for a state-of-the-art second order dependency parsing model, analysis of a long sentence can still take minutes. In this work I present an approach to inference in such networks that can dramatically improve runtime, and memory footprint. The core idea is to be ignorant: instead of considering the full graphical model, we ignore most of its edges. Which edges to ignore is decided dynamically: we start with a very small sub-model, solve it using any solver of choice, and add edges only if they can significantly change the solution. This process is repeated until convergence and　applicable for both MAP

Details

Publication year

2010

Form

電子化映像資料(1時間3分23秒)

Alternative title

Ignorant Inference : MAP and Marginal Inference for Large-Scale Graphical Models

情報科学研究科特別講演

Note

講演者所属: University of Massachusetts Amherst

講演日: 平成22年11月26日

講演場所: 情報科学研究科大講義室L1

Country of publication

Japan

Title language

English (eng)

Language of texts

English (eng)

Author information

Riedel, Sebastian