Timezone: »
For many structured prediction problems, complex models often require adopting approximate inference techniques such as variational methods or sampling, which generally provide no satisfactory accuracy guarantees. In this work, we propose sidestepping intractable inference altogether by learning ensembles of tractable sub-models as part of a structured prediction cascade. We focus in particular on problems with high-treewidth and large state-spaces, which occur in many computer vision tasks. Unlike other variational methods, our ensembles do not enforce agreement between sub-models, but filter the space of possible outputs by simply adding and thresholding the max-marginals of each constituent model. Our framework jointly estimates parameters for all models in the ensemble for each level of the cascade by minimizing a novel, convex loss function, yet requires only a linear increase in computation over learning or inference in a single tractable sub-model. We provide a generalization bound on the filtering loss of the ensemble as a theoretical justification of our approach, and we evaluate our method on both synthetic data and the task of estimating articulated human pose from challenging videos. We find that our approach significantly outperforms loopy belief propagation on the synthetic data and a state-of-the-art model on the pose estimation/tracking problem.
Author Information
David J Weiss (University of Pennsylvania)
Benjamin J Sapp (University of Pennsylvania)
Ben Taskar (University of Washington)
More from the Same Authors
-
2014 Poster: Expectation-Maximization for Learning Determinantal Point Processes »
Jennifer A Gillenwater · Alex Kulesza · Emily Fox · Ben Taskar -
2013 Poster: Learning Adaptive Value of Information for Structured Prediction »
David J Weiss · Ben Taskar -
2013 Poster: Approximate Inference in Continuous Determinantal Processes »
Raja Hafiz Affandi · Emily Fox · Ben Taskar -
2013 Spotlight: Approximate Inference in Continuous Determinantal Processes »
Raja Hafiz Affandi · Emily Fox · Ben Taskar -
2012 Poster: Near-Optimal MAP Inference for Determinantal Point Processes »
Alex Kulesza · Jennifer A Gillenwater · Ben Taskar -
2012 Oral: Near-Optimal MAP Inference for Determinantal Point Processes »
Alex Kulesza · Jennifer A Gillenwater · Ben Taskar -
2010 Workshop: Coarse-to-Fine Learning and Inference »
Ben Taskar · David J Weiss · Benjamin J Sapp · Slav Petrov -
2010 Spotlight: Structured Determinantal Point Processes »
Alex Kulesza · Ben Taskar -
2010 Poster: Structured Determinantal Point Processes »
Alex Kulesza · Ben Taskar -
2010 Oral: Semi-Supervised Learning with Adversarially Missing Label Information »
Umar Syed · Ben Taskar -
2010 Session: Spotlights Session 3 »
Ben Taskar -
2010 Session: Oral Session 3 »
Ben Taskar -
2010 Poster: Semi-Supervised Learning with Adversarially Missing Label Information »
Umar Syed · Ben Taskar -
2009 Poster: Posterior vs Parameter Sparsity in Latent Variable Models »
Joao V Graca · Kuzman Ganchev · Ben Taskar · Fernando Pereira -
2009 Spotlight: Posterior vs Parameter Sparsity in Latent Variable Models »
Joao V Graca · Kuzman Ganchev · Ben Taskar · Fernando Pereira -
2009 Session: Oral Session 6: Theory, Optimization and Games »
Ben Taskar -
2007 Poster: Expectation Maximization, Posterior Constraints, and Statistical Alignment »
Kuzman Ganchev · Joao V Graca · Ben Taskar -
2007 Spotlight: Expectation Maximization, Posterior Constraints, and Statistical Alignment »
Kuzman Ganchev · Joao V Graca · Ben Taskar -
2007 Tutorial: Structured Prediction »
Ben Taskar