{"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":"/method/multiplicative-attention","slug":"multiplicative-attention","name":"Multiplicative Attention","full_name":"Multiplicative Attention","full_name_withheld":false,"description_markdown":"**Multiplicative Attention** is an attention mechanism where the alignment score function is calculated as:\r\n\r\n$$f_{att}\\left(\\textbf{h}_{i}, \\textbf{s}\\_{j}\\right) = \\mathbf{h}\\_{i}^{T}\\textbf{W}\\_{a}\\mathbf{s}\\_{j}$$\r\n\r\nHere $\\mathbf{h}$ refers to the hidden states for the encoder/source, and $\\mathbf{s}$ is the hidden states for the decoder/target. The function above is thus a type of alignment score function. We can use a matrix of alignment scores to show the correlation between source and target words, as the Figure to the right shows. Within a neural network, once we have the alignment scores, we calculate the final scores using a [softmax](https://paperswithcode.com/method/softmax) function of these alignment scores (ensuring it sums to 1).\r\n\r\nAdditive and multiplicative attention are similar in complexity, although multiplicative attention is faster and more space-efficient in practice as it can be implemented more efficiently using matrix multiplication. Both variants perform similar for small dimensionality $d_{h}$ of the decoder states, but [additive attention](https://paperswithcode.com/method/additive-attention) performs better for larger dimensions. One way to mitigate this is to scale $f_{att}\\left(\\textbf{h}_{i}, \\textbf{s}\\_{j}\\right)$ by $1/\\sqrt{d\\_{h}}$ as with [scaled dot-product attention](https://paperswithcode.com/method/scaled).","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://ruder.io/deep-learning-nlp-best-practices/","title":"Deep Learning for NLP Best Practices by Sebastian Ruder","url_on_a_paper_host":false},"code_snippet_url":"https://github.com/LukasMut/ATNLP/blob/0aa097062dd5c520cfd163c0bfd0cb4a945c3430/models/Attention.py#L37","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Attention Mechanisms","url":"/methods/category/attention-mechanisms","pwc_aliases":["attention-mechanisms-1"]}],"n_papers_tagged":6,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/hierarchical-attention-models-for-multi","slug":"hierarchical-attention-models-for-multi","title":"Hierarchical Attention Models for Multi-Relational Graphs","date":"2024-04-14","arxiv_id":"2404.09365","n_code_links":1,"syntology":null},{"paper":"/paper/arithmetic-feature-interaction-is-necessary","slug":"arithmetic-feature-interaction-is-necessary","title":"Arithmetic Feature Interaction Is Necessary for Deep Tabular Learning","date":"2024-02-04","arxiv_id":"2402.02334","n_code_links":1,"syntology":null},{"paper":null,"slug":"global-pointer-novel-efficient-span-based","title":"Global Pointer: Novel Efficient Span-based Approach for Named Entity Recognition","date":"2022-08-05","arxiv_id":"2208.03054","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-based-non-intrusive-multi","slug":"deep-learning-based-non-intrusive-multi","title":"Deep Learning-based Non-Intrusive Multi-Objective Speech Assessment Model with Cross-Domain Features","date":"2021-11-03","arxiv_id":"2111.02363","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dhimasryan/MOSA-Net-Cross-Domain"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/stoi-net-a-deep-learning-based-non-intrusive","slug":"stoi-net-a-deep-learning-based-non-intrusive","title":"STOI-Net: A Deep Learning based Non-Intrusive Speech Intelligibility Assessment Model","date":"2020-11-09","arxiv_id":"2011.04292","n_code_links":1,"syntology":null},{"paper":"/paper/effective-approaches-to-attention-based","slug":"effective-approaches-to-attention-based","title":"Effective Approaches to Attention-based Neural Machine Translation","date":"2015-08-17","arxiv_id":"1508.04025","n_code_links":44,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":5,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":6,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/multiplicative-attention/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/multiplicative-attention/papers/ran/1","json":"/method/multiplicative-attention/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/graph-attention","name":"Graph Attention","papers":1},{"task":"/task/image-guided-story-ending-generation","name":"Image-guided Story Ending Generation","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/cg","name":"NER","papers":1},{"task":"/task/nmt","name":"NMT","papers":1},{"task":"/task/named-entity-recognition-1","name":"Named Entity Recognition","papers":1},{"task":"/task/named-entity-recognition-ner","name":"Named Entity Recognition (NER)","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":null,"name":"Relation","papers":1},{"task":"/task/sentence","name":"Sentence","papers":1},{"task":"/task/speech-enhancement","name":"Speech Enhancement","papers":1},{"task":"/task/translation","name":"Translation","papers":1},{"task":"/task/named-entity-recognition","name":"named-entity-recognition","papers":1}],"tasks_shown":16,"n_tasks":16,"usage_by_year":[{"year":"2015","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2024","papers":2}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/multiplicative-attention"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Multiplicative%20Attention","read_at":"2026-10-05T00:59:26+00:00","query":"Multiplicative Attention","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Multiplicative Attention' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["TF-ATTENTION","TC-ATTENTION","EL-Attention","SS-Attention","VC-Attention","RBS-Attention","MAC-Attention","max-attention"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"9bba03c5d6f24caabedf77e72f57867c8d25ad141571b0485346be7a22dcffdb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}