{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/prophetnet-predicting-future-n-gram-for","title":"ProphetNet: Predicting Future N-gram for Sequence-to-Sequence Pre-training","arxiv_id":"2001.04063","date":"2020-01-13","proceeding":null,"authors":["Weizhen Qi","Yu Yan","Yeyun Gong","Dayiheng Liu","Nan Duan","Jiusheng Chen","Ruofei Zhang","Ming Zhou"],"abstract":"This paper presents a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. Instead of optimizing one-step-ahead prediction in the traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction that predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. We pre-train ProphetNet using a base scale dataset (16GB) and a large-scale dataset (160GB), respectively. Then we conduct experiments on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks for abstractive summarization and question generation tasks. Experimental results show that ProphetNet achieves new state-of-the-art results on all these datasets compared to the models using the same scale pre-training corpus.","url_abs":"https://arxiv.org/abs/2001.04063v3","url_pdf":"https://arxiv.org/pdf/2001.04063v3.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":"prophetnet-predicting-future-n-gram-for","repo_url":"https://github.com/microsoft/ProphetNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"prophetnet-predicting-future-n-gram-for","repo_url":"https://github.com/huggingface/transformers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"prophetnet-predicting-future-n-gram-for","repo_url":"https://github.com/microsoft/ar2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"prophetnet-predicting-future-n-gram-for","repo_url":"https://github.com/MS-P3/code7/tree/main/xlm_prophetnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"prophetnet-predicting-future-n-gram-for","repo_url":"https://github.com/d294270681/ProphetNet-paddle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":{"status":"ok"}}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"question-generation","task_name":"Question Generation"},{"task_slug":"question-generation","task_name":"Question-Generation"},{"task_slug":"text-summarization","task_name":"Text Summarization"}],"methods":[{"method_slug":"prophetnet","method_name":"ProphetNet"}],"datasets_introduced":[],"methods_introduced":[{"slug":"prophetnet","name":"ProphetNet","full_name":"ProphetNet"}],"results":[{"leaderboard":"/sota/abstractive-text-summarization-on-cnn-daily","task":"Abstractive Text Summarization","dataset":"CNN / Daily Mail","model":"ProphetNet","rank_in_archive_order":17,"of":53,"metrics":{"ROUGE-1":"44.20","ROUGE-2":"21.17","ROUGE-L":"41.30"},"uses_additional_data":true},{"leaderboard":"/sota/question-generation-on-squad11","task":"Question Generation","dataset":"SQuAD1.1","model":"ProphetNet","rank_in_archive_order":6,"of":13,"metrics":{"BLEU-4":"23.91","METEOR":"26.6","ROUGE-L":"52.3"},"uses_additional_data":true},{"leaderboard":"/sota/text-summarization-on-gigaword","task":"Text Summarization","dataset":"GigaWord","model":"ProphetNet","rank_in_archive_order":9,"of":41,"metrics":{"ROUGE-1":"39.51","ROUGE-2":"20.42","ROUGE-L":"36.69"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.04063","atlas_url":"https://app.syntology.ai/?focus=2001.04063","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2001.04063"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.04063\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.04063"},"call":"get_concepts_for_paper(arxiv_id=\"2001.04063\")"}],"by_repo":[{"repo":"microsoft/ProphetNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2212.11685","2305.11738"],"harvested_for_calls":[{"arxiv_id":"2212.11685","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.11685"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.11685\")"},{"arxiv_id":"2305.11738","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.11738"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.11738\")"}]},{"repo":"huggingface/transformers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["1706.03762","1910.03771","2006.03654","2010.01057"],"harvested_for_calls":[{"arxiv_id":"1706.03762","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.03762"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.03762\")"},{"arxiv_id":"1910.03771","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.03771"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.03771\")"},{"arxiv_id":"2006.03654","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.03654"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.03654\")"},{"arxiv_id":"2010.01057","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.01057"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.01057\")"}]},{"repo":"microsoft/ar2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2110.03611","2201.10866"],"harvested_for_calls":[{"arxiv_id":"2110.03611","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.03611"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.03611\")"},{"arxiv_id":"2201.10866","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.10866"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.10866\")"}]},{"repo":"MS-P3/code7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"d294270681/ProphetNet-paddle","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4a96ab1f517587adc1ab4c70fcdb5a1a9e43be3415d14d43411c136fc964eb2a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}