Local Perturb-and-MAP for Structured Prediction
Conditional random fields (CRFs) provide a powerful tool for structured prediction, but cast significant challenges in both the learning and inference steps. Approximation techniques are widely used in both steps, which should be considered jointly to guarantee good performance (a.k.a. "inferning"). Perturb-and-MAP models provide a promising alternative to CRFs, but require global combinatorial optimization and hence they are usable only on specific models. In this work, we present a new Local Perturb-and-MAP (locPMAP) framework that replaces the global optimization with a local optimization by exploiting our observed connection between locPMAP and the pseudolikelihood of the original CRF model. We test our approach on three different vision tasks and show that our method achieves consistently improved performance over other approximate inference techniques optimized to a pseudolikelihood objective. Additionally, we demonstrate that we can integrate our method in the fully convolutional network framework to increase our model's complexity. Finally, our observed connection between locPMAP and the pseudolikelihood leads to a novel perspective for understanding and using pseudolikelihood.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial Optimizationglobal-optimizationPredictionStructured PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Minimum-norm Sparse Perturbations for Opacity in Linear Systems
Opacity is a notion that describes an eavesdropper's inability to estimate a system's 'secret' states by observing the system's outputs. In this paper, we propose algorithms to compute the minimum sparse perturbation to …
Iterative Algorithms for Assessing Network Resilience Against Structured Perturbations
This paper studies network resilience against structured additive perturbations to its topology. We consider dynamic networks modeled as linear time-invariant systems subject to perturbations of bounded energy satisfying…
Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization
Direct loss minimization is a popular approach for learning predictors over structured label spaces. This approach is computationally appealing as it replaces integration with optimization and allows to propagate gradien…
PredictionStructured PredictionLearning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time
MAP perturbation models have emerged as a powerful framework for inference in structured prediction. Such models provide a way to efficiently sample from the Gibbs distribution and facilitate predictions that are robust …
Structured PredictionAdversarial Attack and Defense of Structured Prediction Models
Building an effective adversarial attacker and elaborating on countermeasures for adversarial attacks for natural language processing (NLP) have attracted a lot of research in recent years. However, most of the existing …
Adversarial AttackDependency ParsingPart-Of-Speech TaggingPrediction+2