SlideShare a Scribd company logo
Time:11:00AM

Location:New CSIE Building R110

Topic:Learning with Integer Linear Programming Inference for Constrained Output

Speaker: Scott Wen-Tau Yih

Abstract:

       In several structured classification problems, explicit and expressive constraints are crucial to

enhancing the accuracy and quality of the predictions. However, it was not clear how this additional

knowledge can be used in various learning frameworks. In this talk, I'll first demonstrate how constraints

can be incorporated in Conditional Random Fields via a novel inference approach based on integer

linear programming. Inference in CRFs and HMMs is usually done using the Viterbi algorithm, an

efficient dynamic programming algorithm. In many cases, general (non-local and non-sequential)

constraints may exist over the output sequence, but cannot be incorporated and exploited in a natural

way by Viterbi. Our inference procedure extends CRF models to naturally and efficiently support general

constraint structures. For sequential constraints, this procedure reduces to simple linear programming
as the inference process. Experimental evidences of our approach will be provided in the context of an

important NLP problem, semantic role labeling.

       One interesting phenomenon we observed in the experiments is that a simple learning plus

inference scheme may outperform inference based training approaches when incorporating constraints.

In the second part of my talk, I'll describe how we compared these two learning frameworks by

observing their behaviors in different conditions. Experiments and theoretical justification lead to the

conclusion that using inference based learning is superior when the local classifiers are difficult to learn

but may require many examples before any discernible difference can be observed.

Bio:

       Wen-tau Yih is a post-doc researcher in the Machine Learning and Applied Statistics group at

Microsoft Research. He got his Ph.D. at the University of Illinois at Urbana-Champaign in May 2005.

Although his current research focuses mainly on problems related to email applications and anti-spam,

his research interests spread on various problems in Machine Learning and Natural Language

Processing, such as learning and knowledge representation, information extraction, semantic parsing,

and inference and learning for structured output. Wen-tau received both his M.S. and B.S. degrees in

Computer Science from National Taiwan University. More information can be found on his homepage:

http://scottyih.org/

More Related Content

DOC
SchuurmansLecture.doc
DOC
Report
DOC
Speaker: Leonid Kontorovich, CMU
PPTX
Fundamentals of logic
PPT
Dexa2007 Orsi V1.5
PPTX
Software engineering ontology and software testing
PDF
Neural perceptual model to global local vision for the recognition of the log...
DOC
Report
SchuurmansLecture.doc
Report
Speaker: Leonid Kontorovich, CMU
Fundamentals of logic
Dexa2007 Orsi V1.5
Software engineering ontology and software testing
Neural perceptual model to global local vision for the recognition of the log...
Report

What's hot (15)

PPTX
Software Engineering Ontology and Software Testing
PDF
An Overview of Noise-Robust Automatic Speech Recognition
DOC
Audit report[rollno 49]
PDF
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
PDF
Supervised Approach to Extract Sentiments from Unstructured Text
PDF
Improving Robustness and Flexibility of Concept Taxonomy Learning from Text
PDF
Machine Learning
PDF
Ontological Model of Educational Programs in Computer Science (Bachelor and M...
PPTX
Classification and Regression
DOCX
810 research proposal
DOCX
M phil
PDF
GRAPHICAL REPRESENTATION IN TUTORING SYSTEMS
PPTX
Design pattern 1
PPTX
Machine learning
PDF
University-Toronto-Program-The-FundamentalsV2
Software Engineering Ontology and Software Testing
An Overview of Noise-Robust Automatic Speech Recognition
Audit report[rollno 49]
Association Rule Mining Based Extraction of Semantic Relations Using Markov L...
Supervised Approach to Extract Sentiments from Unstructured Text
Improving Robustness and Flexibility of Concept Taxonomy Learning from Text
Machine Learning
Ontological Model of Educational Programs in Computer Science (Bachelor and M...
Classification and Regression
810 research proposal
M phil
GRAPHICAL REPRESENTATION IN TUTORING SYSTEMS
Design pattern 1
Machine learning
University-Toronto-Program-The-FundamentalsV2
Ad

Similar to 20051128.doc (20)

PDF
633-600 Machine Learning
PDF
Machine Learning, LIX004M5
PPTX
artificial intelligence.pptx
PPTX
Keynote at IWLS 2017
PPT
knowld in learning jkjdsbfbsdvs iuuohgguh
PPTX
Learning occam razor
PDF
Machine Learning Meets Human Learning
PPT
programmed learning
PPT
Introduction to Machine Learning.
PPT
original
DOC
Comparison of relational and attribute-IEEE-1999-published ...
PDF
Artificial intelligence to support human instruction Michael C. Mozera,b,c,, ...
DOC
Course Syllabus
PDF
CS 898O : Machine Learning
PPTX
Inductive analytical approaches to learning
PPT
Machine Learning: Foundations Course Number 0368403401
PPT
Machine Learning: Foundations Course Number 0368403401
PDF
Statistics 695A: Machine Learning, Fall 2004
PDF
Statistics 695A: Machine Learning, Fall 2004
633-600 Machine Learning
Machine Learning, LIX004M5
artificial intelligence.pptx
Keynote at IWLS 2017
knowld in learning jkjdsbfbsdvs iuuohgguh
Learning occam razor
Machine Learning Meets Human Learning
programmed learning
Introduction to Machine Learning.
original
Comparison of relational and attribute-IEEE-1999-published ...
Artificial intelligence to support human instruction Michael C. Mozera,b,c,, ...
Course Syllabus
CS 898O : Machine Learning
Inductive analytical approaches to learning
Machine Learning: Foundations Course Number 0368403401
Machine Learning: Foundations Course Number 0368403401
Statistics 695A: Machine Learning, Fall 2004
Statistics 695A: Machine Learning, Fall 2004
Ad

More from butest (20)

PDF
EL MODELO DE NEGOCIO DE YOUTUBE
DOC
1. MPEG I.B.P frame之不同
PDF
LESSONS FROM THE MICHAEL JACKSON TRIAL
PPT
Timeline: The Life of Michael Jackson
DOCX
Popular Reading Last Updated April 1, 2010 Adams, Lorraine The ...
PDF
LESSONS FROM THE MICHAEL JACKSON TRIAL
PPTX
Com 380, Summer II
PPT
PPT
DOCX
The MYnstrel Free Press Volume 2: Economic Struggles, Meet Jazz
DOC
MICHAEL JACKSON.doc
PPTX
Social Networks: Twitter Facebook SL - Slide 1
PPT
Facebook
DOCX
Executive Summary Hare Chevrolet is a General Motors dealership ...
DOC
Welcome to the Dougherty County Public Library's Facebook and ...
DOC
NEWS ANNOUNCEMENT
DOC
C-2100 Ultra Zoom.doc
DOC
MAC Printing on ITS Printers.doc.doc
DOC
Mac OS X Guide.doc
DOC
hier
DOC
WEB DESIGN!
EL MODELO DE NEGOCIO DE YOUTUBE
1. MPEG I.B.P frame之不同
LESSONS FROM THE MICHAEL JACKSON TRIAL
Timeline: The Life of Michael Jackson
Popular Reading Last Updated April 1, 2010 Adams, Lorraine The ...
LESSONS FROM THE MICHAEL JACKSON TRIAL
Com 380, Summer II
PPT
The MYnstrel Free Press Volume 2: Economic Struggles, Meet Jazz
MICHAEL JACKSON.doc
Social Networks: Twitter Facebook SL - Slide 1
Facebook
Executive Summary Hare Chevrolet is a General Motors dealership ...
Welcome to the Dougherty County Public Library's Facebook and ...
NEWS ANNOUNCEMENT
C-2100 Ultra Zoom.doc
MAC Printing on ITS Printers.doc.doc
Mac OS X Guide.doc
hier
WEB DESIGN!

20051128.doc

  • 1. Time:11:00AM Location:New CSIE Building R110 Topic:Learning with Integer Linear Programming Inference for Constrained Output Speaker: Scott Wen-Tau Yih Abstract: In several structured classification problems, explicit and expressive constraints are crucial to enhancing the accuracy and quality of the predictions. However, it was not clear how this additional knowledge can be used in various learning frameworks. In this talk, I'll first demonstrate how constraints can be incorporated in Conditional Random Fields via a novel inference approach based on integer linear programming. Inference in CRFs and HMMs is usually done using the Viterbi algorithm, an efficient dynamic programming algorithm. In many cases, general (non-local and non-sequential) constraints may exist over the output sequence, but cannot be incorporated and exploited in a natural way by Viterbi. Our inference procedure extends CRF models to naturally and efficiently support general constraint structures. For sequential constraints, this procedure reduces to simple linear programming as the inference process. Experimental evidences of our approach will be provided in the context of an important NLP problem, semantic role labeling. One interesting phenomenon we observed in the experiments is that a simple learning plus inference scheme may outperform inference based training approaches when incorporating constraints. In the second part of my talk, I'll describe how we compared these two learning frameworks by observing their behaviors in different conditions. Experiments and theoretical justification lead to the conclusion that using inference based learning is superior when the local classifiers are difficult to learn but may require many examples before any discernible difference can be observed. Bio: Wen-tau Yih is a post-doc researcher in the Machine Learning and Applied Statistics group at Microsoft Research. He got his Ph.D. at the University of Illinois at Urbana-Champaign in May 2005. Although his current research focuses mainly on problems related to email applications and anti-spam, his research interests spread on various problems in Machine Learning and Natural Language Processing, such as learning and knowledge representation, information extraction, semantic parsing, and inference and learning for structured output. Wen-tau received both his M.S. and B.S. degrees in Computer Science from National Taiwan University. More information can be found on his homepage: http://scottyih.org/