{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XPRZOV2YCSBYBFE26LW7DC64KD","short_pith_number":"pith:XPRZOV2Y","schema_version":"1.0","canonical_sha256":"bbe3975758148380949af2edf18bdc50f2d0c2aad1af0327aeff4e8c1b4e0f78","source":{"kind":"arxiv","id":"1704.03169","version":2},"attestation_state":"computed","paper":{"title":"Later-stage Minimum Bayes-Risk Decoding for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hideki Nakayama, Raphael Shu","submitted_at":"2017-04-11T06:48:45Z","abstract_excerpt":"For extended periods of time, sequence generation models rely on beam search algorithm to generate output sequence. However, the correctness of beam search degrades when the a model is over-confident about a suboptimal prediction. In this paper, we propose to perform minimum Bayes-risk (MBR) decoding for some extra steps at a later stage. In order to speed up MBR decoding, we compute the Bayes risks on GPU in batch mode. In our experiments, we found that MBR reranking works with a large beam size. Later-stage MBR decoding is shown to outperform simple MBR reranking in machine translation tasks"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1704.03169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-11T06:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"d9660c67bbe275b791d3602acdacdf9c17cc8f43d260f480bdf68de50d583bc9","abstract_canon_sha256":"36f555fa0973129448e32b890340b0108ffc2d2d33d822937db8a1a3c6816afd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:45.943618Z","signature_b64":"p8iNYNBCaIIbHDozQS89Cjw2ckAoTH4OecATcrfK3lRYc2Uoa9BeLyF17MB9o0B5ixGP/jiyXVjWTNtsaj/uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbe3975758148380949af2edf18bdc50f2d0c2aad1af0327aeff4e8c1b4e0f78","last_reissued_at":"2026-05-18T00:42:45.942837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:45.942837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Later-stage Minimum Bayes-Risk Decoding for Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hideki Nakayama, Raphael Shu","submitted_at":"2017-04-11T06:48:45Z","abstract_excerpt":"For extended periods of time, sequence generation models rely on beam search algorithm to generate output sequence. However, the correctness of beam search degrades when the a model is over-confident about a suboptimal prediction. In this paper, we propose to perform minimum Bayes-risk (MBR) decoding for some extra steps at a later stage. In order to speed up MBR decoding, we compute the Bayes risks on GPU in batch mode. In our experiments, we found that MBR reranking works with a large beam size. Later-stage MBR decoding is shown to outperform simple MBR reranking in machine translation tasks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03169","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.03169","created_at":"2026-05-18T00:42:45.942955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03169v2","created_at":"2026-05-18T00:42:45.942955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03169","created_at":"2026-05-18T00:42:45.942955+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPRZOV2YCSBY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPRZOV2YCSBYBFE2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPRZOV2Y","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD","json":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD.json","graph_json":"https://pith.science/api/pith-number/XPRZOV2YCSBYBFE26LW7DC64KD/graph.json","events_json":"https://pith.science/api/pith-number/XPRZOV2YCSBYBFE26LW7DC64KD/events.json","paper":"https://pith.science/paper/XPRZOV2Y"},"agent_actions":{"view_html":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD","download_json":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD.json","view_paper":"https://pith.science/paper/XPRZOV2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03169&json=true","fetch_graph":"https://pith.science/api/pith-number/XPRZOV2YCSBYBFE26LW7DC64KD/graph.json","fetch_events":"https://pith.science/api/pith-number/XPRZOV2YCSBYBFE26LW7DC64KD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD/action/storage_attestation","attest_author":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD/action/author_attestation","sign_citation":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD/action/citation_signature","submit_replication":"https://pith.science/pith/XPRZOV2YCSBYBFE26LW7DC64KD/action/replication_record"}},"created_at":"2026-05-18T00:42:45.942955+00:00","updated_at":"2026-05-18T00:42:45.942955+00:00"}