{"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/adaptively-sparse-transformers","title":"Adaptively Sparse Transformers","arxiv_id":"1909.00015","date":"2019-08-30","proceeding":"IJCNLP 2019 11","authors":["Gonçalo M. Correia","Vlad Niculae","André F. T. Martins"],"abstract":"Attention mechanisms have become ubiquitous in NLP. Recent architectures, notably the Transformer, learn powerful context-aware word representations through layered, multi-headed attention. The multiple heads learn diverse types of word relationships. However, with standard softmax attention, all attention heads are dense, assigning a non-zero weight to all context words. In this work, we introduce the adaptively sparse Transformer, wherein attention heads have flexible, context-dependent sparsity patterns. This sparsity is accomplished by replacing softmax with $\\alpha$-entmax: a differentiable generalization of softmax that allows low-scoring words to receive precisely zero weight. Moreover, we derive a method to automatically learn the $\\alpha$ parameter -- which controls the shape and sparsity of $\\alpha$-entmax -- allowing attention heads to choose between focused or spread-out behavior. Our adaptively sparse Transformer improves interpretability and head diversity when compared to softmax Transformers on machine translation datasets. Findings of the quantitative and qualitative analysis of our approach include that heads in different layers learn different sparsity preferences and tend to be more diverse in their attention distributions than softmax Transformers. Furthermore, at no cost in accuracy, sparsity in attention heads helps to uncover different head specializations.","url_abs":"https://arxiv.org/abs/1909.00015v2","url_pdf":"https://arxiv.org/pdf/1909.00015v2.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":"adaptively-sparse-transformers","repo_url":"https://github.com/deep-spin/entmax","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"adaptively-sparse-transformers","repo_url":"https://github.com/prajjwal1/adaptive_transformer","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"adaptively-sparse-transformers","repo_url":"https://github.com/prajjwal1/fluence","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"translation","task_name":"Translation"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"adaptively-sparse-transformer","method_name":"Adaptively Sparse Transformer"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"attention-dropout","method_name":"Attention Dropout"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"cosine-annealing","method_name":"Cosine Annealing"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"interpretability","method_name":"Interpretability"},{"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":"linear-warmup-with-cosine-annealing","method_name":"Linear Warmup With Cosine Annealing"},{"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":"relu","method_name":"ReLU"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"sparse-transformer","method_name":"Sparse Transformer"},{"method_slug":"transformer","method_name":"Transformer"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"adaptively-sparse-transformer","name":"Adaptively Sparse Transformer","full_name":"Adaptively Sparse Transformer"}],"results":[{"leaderboard":"/sota/machine-translation-on-iwslt2017-german","task":"Machine Translation","dataset":"IWSLT2017 German-English","model":"Adaptively Sparse Transformer (alpha-entmax)","rank_in_archive_order":1,"of":2,"metrics":{"BLEU score":"29.9"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-iwslt2017-german","task":"Machine Translation","dataset":"IWSLT2017 German-English","model":"Adaptively Sparse Transformer (1.5-entmax)","rank_in_archive_order":2,"of":2,"metrics":{"BLEU score":"29.83"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-wmt2014-english-german","task":"Machine Translation","dataset":"WMT2014 English-German","model":"Adaptively Sparse Transformer (alpha-entmax)","rank_in_archive_order":54,"of":91,"metrics":{"BLEU score":"26.93"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-wmt2014-english-german","task":"Machine Translation","dataset":"WMT2014 English-German","model":"Adaptively Sparse Transformer (1.5-entmax)","rank_in_archive_order":66,"of":91,"metrics":{"BLEU score":"25.89"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-wmt2016-romanian","task":"Machine Translation","dataset":"WMT2016 Romanian-English","model":"Adaptively Sparse Transformer (1.5-entmax)","rank_in_archive_order":9,"of":21,"metrics":{"BLEU score":"33.1"},"uses_additional_data":false},{"leaderboard":"/sota/machine-translation-on-wmt2016-romanian","task":"Machine Translation","dataset":"WMT2016 Romanian-English","model":"Adaptively Sparse Transformer (alpha-entmax)","rank_in_archive_order":12,"of":21,"metrics":{"BLEU score":"32.89"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.00015","atlas_url":"https://app.syntology.ai/?focus=1909.00015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00015"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.00015"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.00015"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.00015\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1909.00015"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.00015\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.00015"},"call":"get_concepts_for_paper(arxiv_id=\"1909.00015\")"}],"by_repo":[{"repo":"deep-spin/entmax","kind":"official","samples":2,"ran":2,"instrument":2,"unverified":0},{"repo":"prajjwal1/adaptive_transformer","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"prajjwal1/fluence","kind":"listed","samples":1,"ran":1,"instrument":1,"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1909.00015.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1909.00015.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/prajjwal1/adaptive_transformer","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/prajjwal1/fluence","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/deep-spin/entmax","reach":null}],"summary":{"ran_draft_wrong":3},"n_samples":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":2,"ran":2,"n_ran_checked":0,"n_instrument":2,"repositories":1},"listed":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"e41b90069aeca727","code_sha256_prefix":"e41b90069aeca727","entry":"entmax15","repo":"deep-spin/entmax","repo_kind":"official","path":"entmax/activations.py","file_url":"https://github.com/deep-spin/entmax/blob/HEAD/entmax/activations.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"X:Tensor/2/float, dim:int/0/int, k:NoneType/0/?, return_support_size:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e41b90069aeca727"},"code_page":"/code/entmax15","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e41b90069aeca727"}},{"code_sha256":"8e929f00b60fd451","code_sha256_prefix":"8e929f00b60fd451","entry":"entmax_bisect","repo":"prajjwal1/fluence","repo_kind":"listed","path":"fluence/adaptive/entmax.py","file_url":"https://github.com/prajjwal1/fluence/blob/HEAD/fluence/adaptive/entmax.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"X:Tensor/2/float, alpha:float/0/float, dim:int/0/int, n_iter:int/0/int, ensure_sum_one:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/entmax-bisect","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8e929f00b60fd451"}},{"code_sha256":"df0db81c189b01e7","code_sha256_prefix":"df0db81c189b01e7","entry":"sparsemax","repo":"deep-spin/entmax","repo_kind":"official","path":"entmax/activations.py","file_url":"https://github.com/deep-spin/entmax/blob/HEAD/entmax/activations.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"X:Tensor/2/float, dim:int/0/int, k:NoneType/0/?, return_support_size:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"df0db81c189b01e7"},"code_page":"/code/sparsemax","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"df0db81c189b01e7"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"83f9188ec3d78827446721fc6dadaafdcd22812dec1e1831c9dbf5d6050a7dd8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}