{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/information-transport-based-policy-for","title":"Information-Transport-based Policy for Simultaneous Translation","arxiv_id":"2210.12357","date":"2022-10-22","proceeding":null,"authors":["Shaolei Zhang","Yang Feng"],"abstract":"Simultaneous translation (ST) outputs translation while receiving the source inputs, and hence requires a policy to determine whether to translate a target token or wait for the next source token. The major challenge of ST is that each target token can only be translated based on the current received source tokens, where the received source information will directly affect the translation quality. So naturally, how much source information is received for the translation of the current target token is supposed to be the pivotal evidence for the ST policy to decide between translating and waiting. In this paper, we treat the translation as information transport from source to target and accordingly propose an Information-Transport-based Simultaneous Translation (ITST). ITST quantifies the transported information weight from each source token to the current target token, and then decides whether to translate the target token according to its accumulated received information. Experiments on both text-to-text ST and speech-to-text ST (a.k.a., streaming speech translation) tasks show that ITST outperforms strong baselines and achieves state-of-the-art performance.","url_abs":"https://arxiv.org/abs/2210.12357v2","url_pdf":"https://arxiv.org/pdf/2210.12357v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"information-transport-based-policy-for","repo_url":"https://github.com/ictnlp/itst","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"speech-to-text","task_name":"Speech-to-Text"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2210.12357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12357"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ictnlp/itst","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":3,"unverified":2},"by_repo_kind":{"official":{"samples":5,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"samples":[{"code_sha256_prefix":"96cbb5e9ca5b6be0","entry":"Embedding","repo":"ictnlp/itst","repo_kind":"official","path":"fairseq/models/transformer_itst.py","file_url":"https://github.com/ictnlp/itst/blob/HEAD/fairseq/models/transformer_itst.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"96cbb5e9ca5b6be0"}},{"code_sha256_prefix":"8cd8cb0d1e9e63e4","entry":"Linear","repo":"ictnlp/itst","repo_kind":"official","path":"fairseq/models/transformer_itst.py","file_url":"https://github.com/ictnlp/itst/blob/HEAD/fairseq/models/transformer_itst.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"8cd8cb0d1e9e63e4"}},{"code_sha256_prefix":"26da4f92ba56e785","entry":"label_smoothed_nll_loss","repo":"ictnlp/itst","repo_kind":"official","path":"fairseq/criterions/label_smoothed_cross_entropy_with_itst_s2t_flexible_predecision.py","file_url":"https://github.com/ictnlp/itst/blob/HEAD/fairseq/criterions/label_smoothed_cross_entropy_with_itst_s2t_flexible_predecision.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"26da4f92ba56e785"}},{"code_sha256_prefix":"135559544a970625","entry":"bulid_weight_matrix_s2t","repo":"ictnlp/itst","repo_kind":"official","path":"fairseq/criterions/label_smoothed_cross_entropy_with_itst_s2t_flexible_predecision.py","file_url":"https://github.com/ictnlp/itst/blob/HEAD/fairseq/criterions/label_smoothed_cross_entropy_with_itst_s2t_flexible_predecision.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"135559544a970625"}},{"code_sha256_prefix":"172f3694ad04fb04","entry":"bulid_weight_matrix_t2t","repo":"ictnlp/itst","repo_kind":"official","path":"fairseq/criterions/label_smoothed_cross_entropy_with_itst_t2t.py","file_url":"https://github.com/ictnlp/itst/blob/HEAD/fairseq/criterions/label_smoothed_cross_entropy_with_itst_t2t.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"mcp_get_code":{"code_sha256":"172f3694ad04fb04"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}