Greedy Inference Algorithms for Structured and Neural Models
| dc.contributor.author | Sun, Qing | en |
| dc.contributor.committeechair | Batra, Dhruv | en |
| dc.contributor.committeechair | Huang, Jia-Bin | en |
| dc.contributor.committeemember | Abbott, A. Lynn | en |
| dc.contributor.committeemember | Parikh, Devi | en |
| dc.contributor.committeemember | Prakash, B. Aditya | en |
| dc.contributor.committeemember | Dhillon, Harpreet Singh | en |
| dc.contributor.department | Electrical Engineering | en |
| dc.date.accessioned | 2018-01-19T09:00:37Z | en |
| dc.date.available | 2018-01-19T09:00:37Z | en |
| dc.date.issued | 2018-01-18 | en |
| dc.description.abstract | A number of problems in Computer Vision, Natural Language Processing, and Machine Learning produce structured outputs in high-dimensional space, which makes searching for the global optimal solution extremely expensive. Thus, greedy algorithms, making trade-offs between precision and efficiency, are widely used. Unfortunately, they in general lack theoretical guarantees. In this thesis, we prove that greedy algorithms are effective and efficient to search for multiple top-scoring hypotheses from structured (neural) models: 1) Entropy estimation. We aim to find deterministic samples that are representative of Gibbs distribution via a greedy strategy. 2) Searching for a set of diverse and high-quality bounding boxes. We formulate this problem as the constrained maximization of a monotonic sub-modular function such that there exists a greedy algorithm having near-optimal guarantee. 3) Fill-in-the-blank. The goal is to generate missing words conditioned on context given an image. We extend Beam Search, a greedy algorithm applicable on unidirectional expansion, to bidirectional neural models when both past and future information have to be considered. We test our proposed approaches on a series of Computer Vision and Natural Language Processing benchmarks and show that they are effective and efficient. | en |
| dc.description.degree | Ph. D. | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:13673 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/81860 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | greedy algorithm | en |
| dc.subject | natural language processing | en |
| dc.subject | graph models | en |
| dc.subject | recurrent neural networks | en |
| dc.subject | beam search | en |
| dc.title | Greedy Inference Algorithms for Structured and Neural Models | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Electrical Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1