{"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/holographic-reduced-representation","slug":"holographic-reduced-representation","name":"Holographic Reduced Representation","full_name":"Holographic Reduced Representation","full_name_withheld":false,"description_markdown":"**Holographic Reduced Representations** are a simple mechanism to represent an associative array of key-value pairs in a fixed-size vector. Each individual key-value pair is the same size as the entire associative array; the array is represented by the sum of the pairs. Concretely, consider a complex vector key $r = (a\\_{r}[1]e^{iφ\\_{r}[1]}, a\\_{r}[2]e^{iφ\\_{r}[2]}, \\dots)$, which is the same size as the complex vector value x. The pair is \"bound\" together by element-wise complex multiplication, which multiplies the moduli and adds the phases of the elements:\r\n\r\n$$ y = r \\otimes x $$\r\n\r\n$$ y =  \\left(a\\_{r}[1]a\\_{x}[1]e^{i(φ\\_{r}[1]+φ\\_{x}[1])}, a\\_{r}[2]a\\_{x}[2]e^{i(φ\\_{r}[2]+φ\\_{x}[2])}, \\dots\\right) $$\r\n\r\nGiven keys $r\\_{1}$, $r\\_{2}$, $r\\_{3}$ and input vectors $x\\_{1}$, $x\\_{2}$, $x\\_{3}$, the associative array is:\r\n\r\n$$c = r\\_{1} \\otimes x\\_{1} + r\\_{2} \\otimes x\\_{2} + r\\_{3} \\otimes x\\_{3} $$\r\n\r\nwhere we call $c$ a memory trace. Define the key inverse:\r\n\r\n$$ r^{-1} = \\left(a\\_{r}[1]^{−1}e^{−iφ\\_{r}[1]}, a\\_{r}[2]^{−1}e^{−iφ\\_{r}[2]}, \\dots\\right) $$\r\n\r\nTo retrieve the item associated with key $r\\_{k}$, we multiply the memory trace element-wise by the vector $r^{-1}\\_{k}$. For example: \r\n\r\n$$ r\\_{2}^{−1} \\otimes c = r\\_{2}^{-1} \\otimes \\left(r\\_{1} \\otimes x\\_{1} + r\\_{2} \\otimes x\\_{2} + r\\_{3} \\otimes x\\_{3}\\right) $$\r\n\r\n$$ r\\_{2}^{−1} \\otimes c = x\\_{2} + r^{-1}\\_{2} \\otimes \\left(r\\_{1} \\otimes x\\_{1} + r\\_{3} \\otimes x3\\right) $$\r\n\r\n$$ r\\_{2}^{−1} \\otimes c = x\\_{2} + noise $$\r\n\r\nThe product is exactly $x\\_{2}$ together with a noise term. If the phases of the elements of the key vector are randomly distributed, the noise term has zero mean.\r\n\r\nSource: [Associative LSTMs](https://arxiv.org/pdf/1602.03032.pdf)","description_state":"present","introduced_year":2003,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Miscellaneous Components","url":"/methods/category/miscellaneous-components","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":null,"slug":"improved-cleanup-and-decoding-of-fractional","title":"Improved Cleanup and Decoding of Fractional Power Encodings","date":"2024-11-30","arxiv_id":"2412.00488","n_code_links":0,"syntology":null},{"paper":null,"slug":"audio-fingerprinting-with-holographic-reduced","title":"Audio Fingerprinting with Holographic Reduced Representations","date":"2024-06-19","arxiv_id":"2406.13139","n_code_links":0,"syntology":null},{"paper":null,"slug":"residual-and-attentional-architectures-for","title":"Residual and Attentional Architectures for Vector-Symbols","date":"2022-07-18","arxiv_id":"2207.08953","n_code_links":0,"syntology":null},{"paper":"/paper/associative-long-short-term-memory","slug":"associative-long-short-term-memory","title":"Associative Long Short-Term Memory","date":"2016-02-09","arxiv_id":"1602.03032","n_code_links":3,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/memorization","name":"Memorization","papers":1},{"task":null,"name":"Position","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2016","papers":1},{"year":"2022","papers":1},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/holographic-reduced-representation"},"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=Holographic%20Reduced%20Representation","read_at":"2026-10-05T00:57:36+00:00","query":"Holographic Reduced Representation","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 'Holographic Reduced Representation' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Holographic Reduced Representations with a projection step","Holographic Reduced Representations (HRR) for disentanglement","reduced-order modeling approach via implicit neural representations","representation-CJ","RCI representation","Representation Gap","Beta Representation","Gene representation"],"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":"fb9b286d07c48bb297c2515cf1f18d208baa935ba94ae2bf75021fbab12dde58","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}