Show simple item record

dc.contributor.authorKhani, Fereshte
dc.contributor.authorRinard, Martin
dc.contributor.authorLiang, Percy
dc.date.accessioned2021-11-01T18:43:45Z
dc.date.available2021-11-01T18:43:45Z
dc.date.issued2016
dc.identifier.urihttps://hdl.handle.net/1721.1/137040
dc.description.abstract© 2016 Association for Computational Linguistics. Can we train a system that, on any new input, either says "don't know" or makes a prediction that is guaranteed to be correct? We answer the question in the affirmative provided our model family is wellspecified. Specifically, we introduce the unanimity principle: only predict when all models consistent with the training data predict the same output. We operationalize this principle for semantic parsing, the task of mapping utterances to logical forms. We develop a simple, efficient method that reasons over the infinite set of all consistent models by only checking two of the models. We prove that our method obtains 100% precision even with a modest amount of training data from a possibly adversarial distribution. Empirically, we demonstrate the effectiveness of our approach on the standard GeoQuery dataset.en_US
dc.language.isoen
dc.publisherAssociation for Computational Linguisticsen_US
dc.relation.isversionof10.18653/v1/p16-1090en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleUnanimous Prediction for 100\% Precision with Application to Learning Semantic Mappingsen_US
dc.typeArticleen_US
dc.identifier.citationKhani, Fereshte, Rinard, Martin and Liang, Percy. 2016. "Unanimous Prediction for 100\% Precision with Application to Learning Semantic Mappings."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-07-02T16:16:35Z
dspace.date.submission2019-07-02T16:16:36Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record