Structured Learning with Latent Variables : Theory and Algorithms Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/z029p943h

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Most tasks in natural language processing (NLP) try to map structured input (e.g., sentence or word sequence) to some form of structured output (tag sequence, parse tree, semantic graph, translated/paraphrased/compressed sentence), a problem known as “structured prediction”. While various learning algorithms such as the perceptron, maximum entropy, and expectation-maximization have been extended to the structured setting (and thus applicable to NLP problems), directly applying them as is to NLP tasks remains challenging for the following reasons. First, the prohibitively large search space in NLP makes exact search intractable, and in practice inexact search methods like beam search are routinely used instead. Second, the output structures are usually partially, rather than completely, annotated, which requires structured latent variables. However, the introduction of inexact search and latent components violates some key theoretical properties (such as convergence) of conventional structured learning algorithms, and requires us to develop new algorithms suitable for scalable structured learning with latent variables. In this thesis, we first investigate new theoretical properties for these structured learning algorithms with inexact search and latent variables, and then also demonstrate that structured learning with latent variables is a powerful modeling tool for many NLP tasks with less strict annotation requirements, and can be generalized to neural models.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Steven Van Tuyl(steve.vantuyl@oregonstate.edu) on 2017-06-12T23:05:24Z (GMT) No. of bitstreams: 2license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5)thesis.pdf: 1032940 bytes, checksum: dd504d205e07d1fcf8ea959630ba1de7 (MD5)
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2017-06-10T21:50:24Z (GMT) No. of bitstreams: 2license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5)thesis.pdf: 1032940 bytes, checksum: dd504d205e07d1fcf8ea959630ba1de7 (MD5)
  • description.provenance : Submitted by Kai Zhao (zhaok@oregonstate.edu) on 2017-06-06T23:27:29ZNo. of bitstreams: 2license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5)thesis.pdf: 1032940 bytes, checksum: dd504d205e07d1fcf8ea959630ba1de7 (MD5)
  • description.provenance : Made available in DSpace on 2017-06-12T23:05:24Z (GMT). No. of bitstreams: 2license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5)thesis.pdf: 1032940 bytes, checksum: dd504d205e07d1fcf8ea959630ba1de7 (MD5) Previous issue date: 2017-05-30

Relationships

In Administrative Set:
Last modified: 02/19/2018

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items