Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields
The standard approach to max-margin parameter learning for Markov random fields (MRFs) involves incrementally adding the most violated constraints during each iteration of the algorithm. This requires exact MAP inference, which is intractable for many classes of MRF. In this paper, we propose an exact MAP inference algorithm for binary MRFs containing a class of higher-order models, known as lower linear envelope potentials. Our algorithm is polynomial in the number of variables and number of...[Show more]
|Collections||ANU Research Publications|
|Source:||Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields|
|01_Gould_Max-margin_Learning_for_Lower_2011.pdf||522.16 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.