Reinforcement Learning based Curriculum Optimization for Neural Machine Translation
We consider the problem of making efficient use of heterogeneous training data in neural machine translation (NMT). Specifically, given a training dataset with a sentence-level feature such as noise, we seek an optimal curriculum, or order for presenting examples to the system during training. Our c...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Kumar, Gaurav Foster, George Cherry, Colin Krikun, Maxim |
description | We consider the problem of making efficient use of heterogeneous training
data in neural machine translation (NMT). Specifically, given a training
dataset with a sentence-level feature such as noise, we seek an optimal
curriculum, or order for presenting examples to the system during training. Our
curriculum framework allows examples to appear an arbitrary number of times,
and thus generalizes data weighting, filtering, and fine-tuning schemes. Rather
than relying on prior knowledge to design a curriculum, we use reinforcement
learning to learn one automatically, jointly with the NMT system, in the course
of a single training run. We show that this approach can beat uniform and
filtering baselines on Paracrawl and WMT English-to-French datasets by up to
+3.4 BLEU, and match the performance of a hand-designed, state-of-the-art
curriculum. |
doi_str_mv | 10.48550/arxiv.1903.00041 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1903_00041</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1903_00041</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-a99203cf243fa969700942aeef94301ae5e0602ea47ff71e46e9a7901ad4ca6d3</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woJYHYMIvkHAdOzYeq4g_KVAJskcX5xosJW7lJAh4-rah0zccfUc6jF0LyNVdWcItpp_wnQsLMgcAJS7Z-xuF6HfJ0UBx4jVhiiF-8g8cqePVnFJwcz8PfLufwhD-cAq7yI8H_kpzwp6_oPsKkXiTMI79gtfswmM_0tV5V6x5uG-qp6zePj5XmzpDbUSG1hYgnS-U9Gi1NQBWFUjkrZIgkEoCDQWhMt4bQUqTRWOPpFMOdSdX7OZfu1S1-xQGTL_tqa5d6uQBx11LYQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Reinforcement Learning based Curriculum Optimization for Neural Machine Translation</title><source>arXiv.org</source><creator>Kumar, Gaurav ; Foster, George ; Cherry, Colin ; Krikun, Maxim</creator><creatorcontrib>Kumar, Gaurav ; Foster, George ; Cherry, Colin ; Krikun, Maxim</creatorcontrib><description>We consider the problem of making efficient use of heterogeneous training
data in neural machine translation (NMT). Specifically, given a training
dataset with a sentence-level feature such as noise, we seek an optimal
curriculum, or order for presenting examples to the system during training. Our
curriculum framework allows examples to appear an arbitrary number of times,
and thus generalizes data weighting, filtering, and fine-tuning schemes. Rather
than relying on prior knowledge to design a curriculum, we use reinforcement
learning to learn one automatically, jointly with the NMT system, in the course
of a single training run. We show that this approach can beat uniform and
filtering baselines on Paracrawl and WMT English-to-French datasets by up to
+3.4 BLEU, and match the performance of a hand-designed, state-of-the-art
curriculum.</description><identifier>DOI: 10.48550/arxiv.1903.00041</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>2019-02</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1903.00041$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1903.00041$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Kumar, Gaurav</creatorcontrib><creatorcontrib>Foster, George</creatorcontrib><creatorcontrib>Cherry, Colin</creatorcontrib><creatorcontrib>Krikun, Maxim</creatorcontrib><title>Reinforcement Learning based Curriculum Optimization for Neural Machine Translation</title><description>We consider the problem of making efficient use of heterogeneous training
data in neural machine translation (NMT). Specifically, given a training
dataset with a sentence-level feature such as noise, we seek an optimal
curriculum, or order for presenting examples to the system during training. Our
curriculum framework allows examples to appear an arbitrary number of times,
and thus generalizes data weighting, filtering, and fine-tuning schemes. Rather
than relying on prior knowledge to design a curriculum, we use reinforcement
learning to learn one automatically, jointly with the NMT system, in the course
of a single training run. We show that this approach can beat uniform and
filtering baselines on Paracrawl and WMT English-to-French datasets by up to
+3.4 BLEU, and match the performance of a hand-designed, state-of-the-art
curriculum.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woJYHYMIvkHAdOzYeq4g_KVAJskcX5xosJW7lJAh4-rah0zccfUc6jF0LyNVdWcItpp_wnQsLMgcAJS7Z-xuF6HfJ0UBx4jVhiiF-8g8cqePVnFJwcz8PfLufwhD-cAq7yI8H_kpzwp6_oPsKkXiTMI79gtfswmM_0tV5V6x5uG-qp6zePj5XmzpDbUSG1hYgnS-U9Gi1NQBWFUjkrZIgkEoCDQWhMt4bQUqTRWOPpFMOdSdX7OZfu1S1-xQGTL_tqa5d6uQBx11LYQ</recordid><startdate>20190228</startdate><enddate>20190228</enddate><creator>Kumar, Gaurav</creator><creator>Foster, George</creator><creator>Cherry, Colin</creator><creator>Krikun, Maxim</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20190228</creationdate><title>Reinforcement Learning based Curriculum Optimization for Neural Machine Translation</title><author>Kumar, Gaurav ; Foster, George ; Cherry, Colin ; Krikun, Maxim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-a99203cf243fa969700942aeef94301ae5e0602ea47ff71e46e9a7901ad4ca6d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Kumar, Gaurav</creatorcontrib><creatorcontrib>Foster, George</creatorcontrib><creatorcontrib>Cherry, Colin</creatorcontrib><creatorcontrib>Krikun, Maxim</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kumar, Gaurav</au><au>Foster, George</au><au>Cherry, Colin</au><au>Krikun, Maxim</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reinforcement Learning based Curriculum Optimization for Neural Machine Translation</atitle><date>2019-02-28</date><risdate>2019</risdate><abstract>We consider the problem of making efficient use of heterogeneous training
data in neural machine translation (NMT). Specifically, given a training
dataset with a sentence-level feature such as noise, we seek an optimal
curriculum, or order for presenting examples to the system during training. Our
curriculum framework allows examples to appear an arbitrary number of times,
and thus generalizes data weighting, filtering, and fine-tuning schemes. Rather
than relying on prior knowledge to design a curriculum, we use reinforcement
learning to learn one automatically, jointly with the NMT system, in the course
of a single training run. We show that this approach can beat uniform and
filtering baselines on Paracrawl and WMT English-to-French datasets by up to
+3.4 BLEU, and match the performance of a hand-designed, state-of-the-art
curriculum.</abstract><doi>10.48550/arxiv.1903.00041</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1903.00041 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1903_00041 |
source | arXiv.org |
subjects | Computer Science - Computation and Language |
title | Reinforcement Learning based Curriculum Optimization for Neural Machine Translation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T16%3A24%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reinforcement%20Learning%20based%20Curriculum%20Optimization%20for%20Neural%20Machine%20Translation&rft.au=Kumar,%20Gaurav&rft.date=2019-02-28&rft_id=info:doi/10.48550/arxiv.1903.00041&rft_dat=%3Carxiv_GOX%3E1903_00041%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |