{"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/sparsifying-transformer-models-with-trainable","title":"Sparsifying Transformer Models with Trainable Representation Pooling","arxiv_id":null,"date":"2021-11-16","proceeding":"ACL ARR November 2021 11","authors":["Anonymous"],"abstract":"We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on the task-specific parts of an input. \nA reduction of quadratic time and memory complexity to sublinear was achieved due to a robust trainable top-$k$ operator.\nOur experiments on a challenging long document summarization task show that even our simple baseline performs comparably to the current SOTA, and with trainable pooling we can retain its top quality, while being $1.8\\times$ faster during training, $4.5\\times$ faster during inference and up to $13\\times$ more computationally efficient in the decoder.\n","url_abs":"https://openreview.net/forum?id=c3wXWy6xe3O","url_pdf":"https://openreview.net/pdf?id=c3wXWy6xe3O","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":[],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"document-summarization","task_name":"Document Summarization"},{"task_slug":"text-summarization","task_name":"Text Summarization"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/document-summarization-on-arxiv","task":"Document Summarization","dataset":"Arxiv HEP-TH citation graph","model":"DeepPyramidion","rank_in_archive_order":1,"of":1,"metrics":{"ROUGE-1":"47.15"},"uses_additional_data":false},{"leaderboard":"/sota/document-summarization-on-arxiv-summarization","task":"Document Summarization","dataset":"arXiv Summarization Dataset","model":"DeepPyramidion","rank_in_archive_order":1,"of":1,"metrics":{"Rouge-2":"19.99"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-arxiv","task":"Text Summarization","dataset":"Arxiv HEP-TH citation graph","model":"DeepPyramidion","rank_in_archive_order":11,"of":28,"metrics":{"ROUGE-1":"47.15","ROUGE-2":"19.99"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-arxiv","task":"Text Summarization","dataset":"Arxiv HEP-TH citation graph","model":"Blockwise(baseline)","rank_in_archive_order":12,"of":28,"metrics":{"ROUGE-1":"46.85","ROUGE-2":"19.39"},"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6328789313f659cdc6f90a15ea6661e5e34bf766d485f5b05eb0314794bc28b3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}