File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Trainable greedy decoding for neural machine translation

TitleTrainable greedy decoding for neural machine translation
Authors
Issue Date2017
PublisherAssociation for Computational Linguistics. The Proceedings' web site is located at http://aclweb.org/anthology/D/D17/#1000
Citation
Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), Copenhagen, Denmark, 9-11 September 2017, p. 1968–1978 How to Cite?
AbstractRecent research in neural machine translation has largely focused on two aspects; neural network architectures and end-toend learning algorithms. The problem of decoding, however, has received relatively little attention from the research community. In this paper, we solely focus on the problem of decoding given a trained neural machine translation model. Instead of trying to build a new decoding algorithm for any specific decoding objective, we propose the idea of trainable decoding algorithm in which we train a decoding algorithm to find a translation that maximizes an arbitrary decoding objective. More specifically, we design an actor that observes and manipulates the hidden state of the neural machine translation decoder and propose to train it using a variant of deterministic policy gradient. We extensively evaluate the proposed algorithm using four language pairs and two decoding objectives, and show that we can indeed train a trainable greedy decoder that generates a better translation (in terms of a target decoding objective) with minimal computational overhead.
Persistent Identifierhttp://hdl.handle.net/10722/262431

 

DC FieldValueLanguage
dc.contributor.authorGu, J-
dc.contributor.authorCho, K-
dc.contributor.authorLi, VOK-
dc.date.accessioned2018-09-28T04:59:13Z-
dc.date.available2018-09-28T04:59:13Z-
dc.date.issued2017-
dc.identifier.citationProceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), Copenhagen, Denmark, 9-11 September 2017, p. 1968–1978-
dc.identifier.urihttp://hdl.handle.net/10722/262431-
dc.description.abstractRecent research in neural machine translation has largely focused on two aspects; neural network architectures and end-toend learning algorithms. The problem of decoding, however, has received relatively little attention from the research community. In this paper, we solely focus on the problem of decoding given a trained neural machine translation model. Instead of trying to build a new decoding algorithm for any specific decoding objective, we propose the idea of trainable decoding algorithm in which we train a decoding algorithm to find a translation that maximizes an arbitrary decoding objective. More specifically, we design an actor that observes and manipulates the hidden state of the neural machine translation decoder and propose to train it using a variant of deterministic policy gradient. We extensively evaluate the proposed algorithm using four language pairs and two decoding objectives, and show that we can indeed train a trainable greedy decoder that generates a better translation (in terms of a target decoding objective) with minimal computational overhead.-
dc.languageeng-
dc.publisherAssociation for Computational Linguistics. The Proceedings' web site is located at http://aclweb.org/anthology/D/D17/#1000-
dc.relation.ispartofProceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP)-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.titleTrainable greedy decoding for neural machine translation-
dc.typeConference_Paper-
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLi, VOK=rp00150-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.18653/v1/D17-1210-
dc.identifier.scopuseid_2-s2.0-85054212304-
dc.identifier.hkuros292192-
dc.identifier.spage1968-
dc.identifier.epage1978-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats