Learning structured prediction models: a large margin approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
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
Structured Prediction, Dual Extragradient and Bregman Projections
The Journal of Machine Learning Research
Learning random walks to rank nodes in graphs
Proceedings of the 24th international conference on Machine learning
Solving multiclass support vector machines with LaRank
Proceedings of the 24th international conference on Machine learning
Probabilistic graphical models and their role in databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The application of hidden Markov models in speech recognition
Foundations and Trends in Signal Processing
Statistical machine translation
ACM Computing Surveys (CSUR)
Accurate max-margin training for structured output spaces
Proceedings of the 25th international conference on Machine learning
Foundations and Trends in Databases
Instance-based AMN classification for improved object recognition in 2D and 3D laser range data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Machine learning for event selection in high energy physics
Engineering Applications of Artificial Intelligence
Real-time object classification in 3D point clouds using point feature histograms
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
The Journal of Machine Learning Research
Improved human parsing with a full relational model
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Temporal maximum margin Markov network
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Incorporating the loss function into discriminative clustering of structured outputs
IEEE Transactions on Neural Networks
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Conditional graphical models for protein structure prediction
Conditional graphical models for protein structure prediction
Accelerated training of max-margin Markov networks with kernels
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Pervasive and Mobile Computing
Structured output prediction with support vector machines
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Assigning polarity scores to reviews using machine learning techniques
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Learning inter-related statistical query translation models for English-Chinese bi-directional CLIR
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hope and fear for discriminative training of statistical translation models
The Journal of Machine Learning Research
Structured apprenticeship learning
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Attributed graph models: modeling network structure with correlated attributes
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
This thesis presents a novel statistical estimation framework for structured models based on the large margin principle underlying support vector machines. We consider standard probabilistic models, such as Markov networks (undirected graphical models) and context free grammars as well as less conventional combinatorial models such as weighted graph-cuts and matchings. Our framework results in several efficient learning formulations for complex prediction tasks. Fundamentally, we rely on the expressive power of convex optimization problems to compactly capture inference or solution optimality in structured models. Directly embedding this structure within the learning formulation produces compact convex problems for efficient estimation of very complex and diverse models. For some of these models, alternative estimation methods are intractable. We analyze the theoretical generalization properties of our approach and derive a novel margin-based bound for structured prediction. In order to scale up to very large training datasets, we develop problem-specific optimization algorithms that exploit efficient dynamic programming subroutines. We describe experimental applications to a diverse range of tasks, including handwriting recognition, 3D terrain classification, disulfide connectivity prediction, hypertext categorization, natural language parsing, email organization and image segmentation. These empirical evaluations show significant improvements over state-of-the-art methods and promise wide practical use for our framework.