Methods › Sequential › Recurrent Neural Networks › mRNN

Multiplicative RNN

mRNN

introduced 2011 1 paper tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

A Multiplicative RNN (mRNN) is a type of recurrent neural network with multiplicative connections. In a standard RNN, the current input xₜ is first transformed via the visible-to-hidden weight matrix Wₕₓ and then contributes additively to the input for the current hidden state. An mRNN allows the current input (a character in the original example) to affect the hidden state dynamics by determining the entire hidden-to-hidden matrix (which defines the non-linear dynamics) in addition to providing an additive bias.

To achieve this goal, the authors modify the RNN so that its hidden-to-hidden weight matrix is a (learned) function of the current input xₜ:

hₜ = tanh(Wₕₓxₜ + Wₕₕ^((x_y))hₜ₋₁ + bₕ)

oₜ = Wₒₕhₜ + bₒ

This is the same as the equations for a standard RNN, except that Wₕₕ is replaced with W⁽ˣᵗ⁾ₕₕ. allowing each input (character) to specify a different hidden-to-hidden weight matrix.

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 0 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

1 task the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Ensemble Learning1

Usage over time archive 2025-07-28

Papers per year tagged with mRNN: 2023 to 2023, peak 1 1 0 2023: 1 paper 2023
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Recurrent Neural Networks

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections