arrow
Return

Learning undirected graphical models using persistent sequential Monte Carlo

delete2016-04-01
delete0
delete
OA
AI
H
Hanchen Xiong *
S
Sándor Szedmák
J
Justus Piater
DOI:10.1007/s10994-016-5564-xdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Along with the popular use of algorithms such as persistent contrastive divergence, tempered transition and parallel tempering, the past decade has witnessed a revival of learning undirected graphical models (UGMs) with sampling-based approximations. In this paper, based upon the analogy between Robbins-Monro's stochastic approximation procedure and sequential Monte Carlo (SMC), we analyze the strengths and limitations of state-of-the-art learning algorithms from an SMC point of view. Moreover, we apply the rationale further in sampling at each iteration, and propose to learn UGMs using persistent sequential Monte Carlo (PSMC). The whole learning procedure is based on the samples from a long, persistent sequence of distributions which are actively constructed. Compared to the above-mentioned algorithms, one critical strength of PSMC-based learning is that it can explore the sampling space more effectively. In particular, it is robust when learning rates are large or model distributions are high-dimensional and thus multi-modal, which often causes other algorithms to deteriorate. We tested PSMC learning, comparing it with related methods, on carefully designed experiments with both synthetic and real-world data. Our empirical results demonstrate that PSMC compares favorably with the state of the art by consistently yielding the highest (or among the highest) likelihoods. We also evaluated PSMC on two practical tasks, multi-label classification and image segmentation, in which PSMC displays promising applicability by outperforming others.
Keywords:
Sequential Monte Carlo
Maximum likelihood learning
Undirected graphical models
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Machine Learning cover
Machine Learning
IF:
2.9
Papers:
2.7K
Citations:
3.4W

Organization

U
University of Innsbruck
Scholars:
9.8K
Papers: 8.6K
Citations: 8
A
Aalto University
Scholars:
1.6W
Papers: 1.5W
Citations: 2.1W
Cited Papers

Cited Papers

errShare
errSave
Learning multi-label scene classification
err2004-09-01
err2.0K
PREAI
errBoutell, MR; Luo, JB; Shen, XP; Brown, CM
errShare
errSave
ERP Evidence of a Dichotic Left-Ear Deficit in Some Dyslexic Children
err2004-07-01
err0
PREAI
errDeborah Moncrieff; James Jerger; Ilse Wambacq; Ralf Greenwald; Jeffrey Black
errShare
errSave
Robust Higher Order Potentials for Enforcing Label Consistency
err2009-01-24
err553
PREAI
errKohli, Pushmeet; Ladicky, L'ubor; Torr, Philip H. S.
errShare
errSave
Low rank approximation method for efficient Green's function calculation of dissipative quantum transport
err2013-06-07
err0
errOAAI
errLang Zeng; Yu He; Michael Povolotskyi; XiaoYan Liu; Gerhard Klimeck; Tillmann Kubis
errShare
errSave
Fight sample degeneracy and impoverishment in particle filters: A review of intelligent approaches
err2014-06-01
err203
errOAAI
errLi, Tiancheng; Sun, Shudong; Sattar, Tariq Pervez; Manuel Corchado, Juan
errShare
errSave
Accounting for Changes in Between-Group Inequality
err
IF0
err2015-01-01
err0
errOAAI
errAriel Burstein; Eduardo Morales; Jonathan Vogel
errShare
errSave
researcher View more