{"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/generative-adversarial-network-for","title":"Generative Adversarial Network for Abstractive Text Summarization","arxiv_id":"1711.09357","date":"2017-11-26","proceeding":null,"authors":["Linqing Liu","Yao Lu","Min Yang","Qiang Qu","Jia Zhu","Hongyan Li"],"abstract":"In this paper, we propose an adversarial process for abstractive text\nsummarization, in which we simultaneously train a generative model G and a\ndiscriminative model D. In particular, we build the generator G as an agent of\nreinforcement learning, which takes the raw text as input and predicts the\nabstractive summarization. We also build a discriminator which attempts to\ndistinguish the generated summary from the ground truth summary. Extensive\nexperiments demonstrate that our model achieves competitive ROUGE scores with\nthe state-of-the-art methods on CNN/Daily Mail dataset. Qualitatively, we show\nthat our model is able to generate more abstractive, readable and diverse\nsummaries.","url_abs":"http://arxiv.org/abs/1711.09357v1","url_pdf":"http://arxiv.org/pdf/1711.09357v1.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":"generative-adversarial-network-for","repo_url":"https://github.com/iwangjian/textsum-gan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":null,"task_name":"Generative Adversarial Network"},{"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":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/text-summarization-on-cnn-daily-mail-2","task":"Text Summarization","dataset":"CNN / Daily Mail (Anonymized)","model":"GAN","rank_in_archive_order":5,"of":13,"metrics":{"ROUGE-1":"39.92","ROUGE-2":"17.65","ROUGE-L":"36.71"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.09357","atlas_url":"https://app.syntology.ai/?focus=1711.09357","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":"1711.09357"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.09357\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.09357"},"call":"get_concepts_for_paper(arxiv_id=\"1711.09357\")"}],"by_repo":[{"repo":"iwangjian/textsum-gan","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"9f2dd8d230546ba65e9872786c90073ab90cb330835d190fbde35f04d0737a67","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}