{"total":15,"rows":[{"id":"2210.01241","title":"Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimization","created":"2022-10-03","cited_by_count":246,"area":null},{"id":"2306.11816","title":"Learning to Generate Better Than Your LLM","created":"2023-06-20","cited_by_count":49,"area":null},{"id":"2104.01853","title":"Rethinking Perturbations in Encoder-Decoders for Fast Training","created":"2021-04-05","cited_by_count":17,"area":null},{"id":"2108.02401","title":"WeChat Neural Machine Translation Systems for WMT21","created":"2021-08-05","cited_by_count":11,"area":null},{"id":"2108.12963","title":"Scheduled Sampling Based on Decoding Steps for Neural Machine Translation","created":"2021-08-30","cited_by_count":11,"area":null},{"id":"2107.10427","title":"Confidence-Aware Scheduled Sampling for Neural Machine Translation","created":"2021-07-22","cited_by_count":10,"area":null},{"id":"2106.15880","title":"Mixed Cross Entropy Loss for Neural Machine Translation","created":"2021-06-30","cited_by_count":8,"area":null},{"id":"2201.08124","title":"Cross-Lingual Text-to-Speech Using Multi-Task Learning and Speaker Classifier Joint Training","created":"2022-01-20","cited_by_count":7,"area":null},{"id":"2310.18830","title":"Translating away Translationese without Parallel Data","created":"2023-10-28","cited_by_count":5,"area":null},{"id":"2104.01264","title":"Attention Forcing for Machine Translation","created":"2021-04-02","cited_by_count":3,"area":null},{"id":"2211.03217","title":"Deliberation Networks and How to Train Them","created":"2022-11-06","cited_by_count":0,"area":null},{"id":"2211.03237","title":"Parallel Attention Forcing for Machine Translation","created":"2022-11-06","cited_by_count":0,"area":null},{"id":"2301.13753","title":"Dynamic Scheduled Sampling with Imitation Loss for Neural Text Generation","created":"2023-01-31","cited_by_count":0,"area":null},{"id":"2406.09393","title":"Improving Autoregressive Training with Dynamic Oracles","created":"2024-06-13","cited_by_count":0,"area":null},{"id":"2606.21497","title":"Breaking Chains with Trees: Model-Parallel Deep Learning with $\\mathcal{O}(\\log N)$ Time Complexity","created":"2026-06-19","cited_by_count":0,"area":null}],"next_cursor":null}