{"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/mlstm","slug":"mlstm","name":"mLSTM","full_name":"Multiplicative LSTM","full_name_withheld":false,"description_markdown":"A **Multiplicative LSTM (mLSTM)** is a  recurrent neural network architecture for sequence modelling that combines the long short-term memory ([LSTM](https://paperswithcode.com/method/lstm)) and multiplicative recurrent neural network ([mRNN](https://paperswithcode.com/method/mrnn)) architectures. The mRNN and LSTM architectures can be combined by adding connections from the mRNN’s intermediate state $m\\_{t}$ to each gating units in the LSTM.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Multiplicative LSTM for sequence modelling","paper":"/paper/multiplicative-lstm-for-sequence-modelling","first_author":"Ben Krause","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/multiplicative-lstm-for-sequence-modelling"},"source":{"url":"http://arxiv.org/abs/1609.07959v3","title":"Multiplicative LSTM for sequence modelling","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Recurrent Neural Networks","url":"/methods/category/recurrent-neural-networks","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":"/paper/nr4der-neural-re-ranking-for-diversified","slug":"nr4der-neural-re-ranking-for-diversified","title":"NR4DER: Neural Re-ranking for Diversified Exercise Recommendation","date":"2025-06-01","arxiv_id":"2506.06341","n_code_links":1,"syntology":null},{"paper":null,"slug":"moxe-mixture-of-xlstm-experts-with-entropy","title":"MoxE: Mixture of xLSTM Experts with Entropy-Aware Routing for Efficient Language Modeling","date":"2025-05-01","arxiv_id":"2505.01459","n_code_links":0,"syntology":null},{"paper":"/paper/tiled-flash-linear-attention-more-efficient","slug":"tiled-flash-linear-attention-more-efficient","title":"Tiled Flash Linear Attention: More Efficient Linear RNN and xLSTM Kernels","date":"2025-03-18","arxiv_id":"2503.14376","n_code_links":1,"syntology":null},{"paper":"/paper/deltaproduct-increasing-the-expressivity-of","slug":"deltaproduct-increasing-the-expressivity-of","title":"DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products","date":"2025-02-14","arxiv_id":"2502.10297","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sustcsonglin/flash-linear-attention"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"paper":"/paper/unlocking-state-tracking-in-linear-rnns","slug":"unlocking-state-tracking-in-linear-rnns","title":"Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues","date":"2024-11-19","arxiv_id":"2411.12537","n_code_links":2,"syntology":{"ran":5,"of":8,"n_ran_checked":2,"n_instrument":3,"unverified":3,"pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["automl/unlocking_state_tracking"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/xlstm-extended-long-short-term-memory","slug":"xlstm-extended-long-short-term-memory","title":"xLSTM: Extended Long Short-Term Memory","date":"2024-05-07","arxiv_id":"2405.04517","n_code_links":5,"syntology":{"ran":7,"of":9,"n_ran_checked":7,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["nx-ai/xlstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/multiplicative-lstm-for-sequence-modelling","slug":"multiplicative-lstm-for-sequence-modelling","title":"Multiplicative LSTM for sequence modelling","date":"2016-09-26","arxiv_id":"1609.07959","n_code_links":1,"syntology":null}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"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":3,"papers_where_code_ran_first_page":"/method/mlstm/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/mlstm/papers/ran/1","json":"/method/mlstm/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":6},{"task":"/task/language-modeling","name":"Language Modeling","papers":5},{"task":"/task/mamba","name":"Mamba","papers":3},{"task":"/task/density-estimation","name":"Density Estimation","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/math","name":"Math","papers":1},{"task":"/task/mixture-of-experts","name":"Mixture-of-Experts","papers":1},{"task":"/task/re-ranking","name":"Re-Ranking","papers":1},{"task":"/task/state-space-models","name":"State Space Models","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2016","papers":1},{"year":"2024","papers":2},{"year":"2025","papers":4}],"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/mlstm"},"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=mLSTM","read_at":"2026-10-05T00:59:11+00:00","query":"mLSTM","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":"1609.07959","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 'mLSTM' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["mLSTM variant with sigmoid input gate"],"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":"81f924189499a97cebfad4178161fca216aaef02671b2a7ac42262481c77aca3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}