What is recorded here?
Used learned transform/carry gates to interpolate between nonlinear updates and identity paths in feed-forward layers, enabling directly trained very deep networks.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Inherits LSTM gating and deep-network initialization; distinct from later ungated residual-network design, not invention of all skip connections. Initial sigmoid gates approximate but never exactly attain hard zero/one; hundreds-layer experiments do not prove optimization independent of arbitrary depth or problem.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Rupesh Kumar Srivastava; Klaus Greff; Jürgen Schmidhuber
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Highway networks: learned transform and carry gates for depth
Used learned transform/carry gates to interpolate between nonlinear updates and identity paths in feed-forward layers, enabling directly trained very deep networks.
Scientific scope
Inherits LSTM gating and deep-network initialization; distinct from later ungated residual-network design, not invention of all skip connections. Initial sigmoid gates approximate but never exactly attain hard zero/one; hundreds-layer experiments do not prove optimization independent of arbitrary depth or problem.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Rupesh Kumar Srivastava; Klaus Greff; Jürgen Schmidhuber
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.