DMCA
A primal-dual message-passing algorithm for approximated large scale structured prediction (2010)
Cached
Download Links
| Venue: | In Advances in Neural Information Processing Systems 23 |
| Citations: | 38 - 19 self |
BibTeX
@INPROCEEDINGS{Hazan10aprimal-dual,
author = {Tamir Hazan and Raquel Urtasun},
title = {A primal-dual message-passing algorithm for approximated large scale structured prediction},
booktitle = {In Advances in Neural Information Processing Systems 23},
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters efficiently. We first relate CRFs and structured SVMs and show that in CRFs a variant of the log-partition function, known as the soft-max, smoothly approximates the hinge loss function of structured SVMs. We then propose an intuitive approximation for the structured prediction problem, using duality, based on a local entropy approximation and derive an efficient messagepassing algorithm that is guaranteed to converge. Unlike existing approaches, this allows us to learn efficiently graphical models with cycles and very large number of parameters. 1
Keyphrases
approximated large scale primal-dual message-passing algorithm approximated structured prediction framework intuitive approximation log-partition function efficient messagepassing algorithm local entropy approximation hinge loss function graphical model structured prediction problem structured svms large number derive message-passing algorithm large scale graphical model
