{"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/a-deep-reinforced-model-for-abstractive","title":"A Deep Reinforced Model for Abstractive Summarization","arxiv_id":"1705.04304","date":"2017-05-11","proceeding":"ICLR 2018 1","authors":["Romain Paulus","Caiming Xiong","Richard Socher"],"abstract":"Attentional, RNN-based encoder-decoder models for abstractive summarization\nhave achieved good performance on short input and output sequences. For longer\ndocuments and summaries however these models often include repetitive and\nincoherent phrases. We introduce a neural network model with a novel\nintra-attention that attends over the input and continuously generated output\nseparately, and a new training method that combines standard supervised word\nprediction and reinforcement learning (RL). Models trained only with supervised\nlearning often exhibit \"exposure bias\" - they assume ground truth is provided\nat each step during training. However, when standard word prediction is\ncombined with the global sequence prediction training of RL the resulting\nsummaries become more readable. We evaluate this model on the CNN/Daily Mail\nand New York Times datasets. Our model obtains a 41.16 ROUGE-1 score on the\nCNN/Daily Mail dataset, an improvement over previous state-of-the-art models.\nHuman evaluation also shows that our model produces higher quality summaries.","url_abs":"http://arxiv.org/abs/1705.04304v3","url_pdf":"http://arxiv.org/pdf/1705.04304v3.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":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/AndreyKolomiets/News_Headline_Generation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/Hmkhalla/NLP-summarizer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/JRC1995/Abstractive-Summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/Kumar-Tarun/summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/VD44/Rouge-L-Tensorflow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/cosmoquester/2021-dialogue-summary-competition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/manshri/tesum","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/oceanypt/A-DEEP-REINFORCED-MODEL-FOR-ABSTRACTIVE-SUMMARIZATION","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/rohithreddy024/Text-Summarizer-Pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"a-deep-reinforced-model-for-abstractive","repo_url":"https://github.com/theamrzaki/text_summurization_abstractive_methods","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"text-summarization","task_name":"Text Summarization"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/document-summarization-on-cnn-daily-mail","task":"Document Summarization","dataset":"CNN / Daily Mail","model":"ML + RL (Paulus et al., 2017)","rank_in_archive_order":20,"of":26,"metrics":{"ROUGE-1":"39.87","ROUGE-2":"15.82","ROUGE-L":"36.90"},"uses_additional_data":false},{"leaderboard":"/sota/document-summarization-on-cnn-daily-mail","task":"Document Summarization","dataset":"CNN / Daily Mail","model":"ML + Intra-Attention (Paulus et al., 2017)","rank_in_archive_order":24,"of":26,"metrics":{"ROUGE-1":"38.30","ROUGE-2":"14.81","ROUGE-L":"35.49"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-cnn-daily-mail-2","task":"Text Summarization","dataset":"CNN / Daily Mail (Anonymized)","model":"ML+RL, with intra-attention","rank_in_archive_order":6,"of":13,"metrics":{"ROUGE-1":"39.87","ROUGE-2":"15.82","ROUGE-L":"36.90"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.04304","atlas_url":"https://app.syntology.ai/?focus=1705.04304","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":"1705.04304"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.04304\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.04304"},"call":"get_concepts_for_paper(arxiv_id=\"1705.04304\")"}],"by_repo":[{"repo":"AndreyKolomiets/News_Headline_Generation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Hmkhalla/NLP-summarizer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JRC1995/Abstractive-Summarization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Kumar-Tarun/summarization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"VD44/Rouge-L-Tensorflow","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"cosmoquester/2021-dialogue-summary-competition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1910.13461","2106.14448"],"harvested_for_calls":[{"arxiv_id":"1910.13461","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.13461"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.13461\")"},{"arxiv_id":"2106.14448","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.14448"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.14448\")"}]},{"repo":"manshri/tesum","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"oceanypt/A-DEEP-REINFORCED-MODEL-FOR-ABSTRACTIVE-SUMMARIZATION","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rohithreddy024/Text-Summarizer-Pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1704.04368"],"harvested_for_calls":[{"arxiv_id":"1704.04368","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.04368"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.04368\")"}]},{"repo":"theamrzaki/text_summurization_abstractive_methods","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":"c3e07e3d0c07b0f112be7ff8a5c9f63571c375f17afc0a4c916b27c36e3854bb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}