Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
SIAM Journal on Optimization
Improvements of some projection methods for monotone nonlinear variational inequalities
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
A systematic comparison of various statistical alignment models
Computational Linguistics
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization
Kernel conditional random fields: representation and clique selection
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Support vector machine learning for interdependent and structured output spaces
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Learning associative Markov networks
ICML '04 Proceedings of the twenty-first international conference on Machine learning
The Entire Regularization Path for the Support Vector Machine
The Journal of Machine Learning Research
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
SIAM Journal on Discrete Mathematics
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Learning structured prediction models: a large margin approach
Learning structured prediction models: a large margin approach
Learning structured prediction models: a large margin approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
An evaluation exercise for word alignment
HLT-NAACL-PARALLEL '03 Proceedings of the HLT-NAACL 2003 Workshop on Building and using parallel texts: data driven machine translation and beyond - Volume 3
Symmetric word alignments for statistical machine translation
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
A discriminative matching approach to word alignment
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Word alignment via quadratic assignment
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
The Interplay of Optimization and Machine Learning Research
The Journal of Machine Learning Research
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Accurate max-margin training for structured output spaces
Proceedings of the 25th international conference on Machine learning
Discriminative Learning of Max-Sum Classifiers
The Journal of Machine Learning Research
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
The Journal of Machine Learning Research
Learning a two-stage SVM/CRF sequence classifier
Proceedings of the 17th ACM conference on Information and knowledge management
Foundations and Trends in Databases
SimpleNPKL: simple non-parametric kernel learning
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Multi-output regression on the output manifold
Pattern Recognition
Max-Margin Weight Learning for Markov Logic Networks
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Adaptive fuzzy filtering in a deterministic setting
IEEE Transactions on Fuzzy Systems
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
ACM Transactions on Algorithms (TALG)
Turbo parsers: dependency parsing by approximate variational inference
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
A discriminative latent model of object classes and attributes
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
The application of structured learning in natural language processing
Machine Translation
Exploitation of Machine Learning Techniques in Modelling Phrase Movements for Machine Translation
The Journal of Machine Learning Research
Accelerated training of max-margin Markov networks with kernels
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Dual extragradient algorithms extended to equilibrium problems
Journal of Global Optimization
A tag-centric discriminative model for web objects classification
Proceedings of the 21st ACM international conference on Information and knowledge management
Bayesian model diagnostics using functional Bregman divergence
Journal of Multivariate Analysis
Accelerated training of max-margin Markov networks with kernels
Theoretical Computer Science
Computational Optimization and Applications
Hi-index | 0.00 |
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We formulate the estimation problem as a convex-concave saddle-point problem that allows us to use simple projection methods based on the dual extragradient algorithm (Nesterov, 2003). The projection step can be solved using dynamic programming or combinatorial algorithms for min-cost convex flow, depending on the structure of the problem. We show that this approach provides a memory-efficient alternative to formulations based on reductions to a quadratic program (QP). We analyze the convergence of the method and present experiments on two very different structured prediction tasks: 3D image segmentation and word alignment, illustrating the favorable scaling properties of our algorithm.