{"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-step-by-step-gradient-penalty-with","title":"A Step-by-Step Gradient Penalty with Similarity Calculation for Text Summary Generation","arxiv_id":null,"date":"2022-09-20","proceeding":"Neural Processing Letters 2022 9","authors":["Shuai Zhao"],"abstract":"The summary generation model equipped with gradient penalty avoids overfitting and makes the model more stable. However, the traditional gradient penalty faces two issues: (i) calculating the gradient twice increases training time, and (ii) the disturbance factor requires repeated trials to find the best value. To this end, we propose a step-by-step gradient penalty model with similarity calculation (S2SGP). Firstly, the step-by-step gradient penalty is applied to the summary generation model, effectively reducing the training time without sacrificing accuracy. Secondly, the similarity score between reference and candidate summary is calculated as disturbance factor. To show the performance of our proposed solution, we conduct experiments on four summary generation datasets, among which the EDUSum dataset is newly produced by us. Experimental results show that S2SGP effectively reduces training time, and the disturbance factors do not rely on repeated trials. Especially, our model outperforms the baseline by more than 2.4 ROUGE-L points when tested on the CSL dataset.","url_abs":"https://link.springer.com/article/10.1007/s11063-022-11031-0","url_pdf":"https://link.springer.com/article/10.1007/s11063-022-11031-0","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-step-by-step-gradient-penalty-with","repo_url":"https://github.com/shuaizhao95/EDUsum-dataset","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"}],"methods":[{"method_slug":"csl","method_name":"CSL"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/abstractive-text-summarization-on-edusum","task":"Abstractive Text Summarization","dataset":"EDUsum","model":"Seq2seq","rank_in_archive_order":1,"of":5,"metrics":{"ROUGE-1":"48.62","ROUGE-2":"32.32","ROUGE-L":"44.13"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-edusum","task":"Abstractive Text Summarization","dataset":"EDUsum","model":"BERT","rank_in_archive_order":2,"of":5,"metrics":{"ROUGE-1":"62.37","ROUGE-2":"50.70","ROUGE-L":"59.40"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-edusum","task":"Abstractive Text Summarization","dataset":"EDUsum","model":"RoBERTa","rank_in_archive_order":3,"of":5,"metrics":{"ROUGE-1":"63.22","ROUGE-2":"51.34","ROUGE-L":"60.26"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-edusum","task":"Abstractive Text Summarization","dataset":"EDUsum","model":"NEZHA","rank_in_archive_order":4,"of":5,"metrics":{"ROUGE-1":"63.91","ROUGE-2":"51.88","ROUGE-L":"61.00"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-edusum","task":"Abstractive Text Summarization","dataset":"EDUsum","model":"GP_Step_Sim","rank_in_archive_order":5,"of":5,"metrics":{"ROUGE-1":"64.48","ROUGE-2":"52.70","ROUGE-L":"61.91"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"shuaizhao95/EDUsum-dataset","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":"5f673efb3ee2bbec6c2f720c4145289ecf318c8abbf8ca6a33e81be6e0f5bea3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}