Methods › General › Attention Mechanisms › Highway networks

Highway networks

24 papers tagged archive 2025-07-28

Introduced by Rupesh Kumar Srivastava et al. in Highway Networks

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

There is plenty of theoretical and empirical evidence that depth of neural networks is a crucial ingredient for their success. However, network training becomes more difficult with increasing depth and training of very deep networks remains an open problem. In this extended abstract, we introduce a new architecture designed to ease gradient-based training of very deep networks. We refer to networks with this architecture as highway networks, since they allow unimpeded information flow across several layers on "information highways". The architecture is characterized by the use of gating units which learn to regulate the flow of information through a network. Highway networks with hundreds of layers can be trained directly using stochastic gradient descent and with a variety of activation functions, opening up the possibility of studying extremely deep and efficient architectures.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 4 listed of 4 in the graph, strongest link: mentioned on GitHub). The lookup matched a paper by its title, arXiv:1505.00387, not a method entry. This answer is about arXiv:1505.00387, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1505.00387 (its page on this site · its page on Syntology).

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: 24 · with a code link: 10 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 24 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 24 of 24, 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

20 shown of 36 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Language Modelling4
Language Modeling3
Speech Recognition3
speech-recognition3
Automatic Speech Recognition2
Automatic Speech Recognition (ASR)2
Image Classification2
Management2
Time Series Analysis2
Activity Recognition1
Attribute1
Decision Making1
Deep Learning1
Denoising1
General Classification1
Graph Neural Network1
Human Activity Recognition1
Image Captioning1
Learning-To-Rank1
Machine Translation1

Usage over time archive 2025-07-28

Papers per year tagged with Highway networks: 2015 to 2025, peak 6 6 0 2015: 2 papers 2015 2016: 2 papers 2016 2017: 6 papers 2017 2018: 5 papers 2018 2019: 1 paper 2019 2020: 1 paper 2020 2021: 0 papers 2021 2022: 2 papers 2022 2023: 0 papers 2023 2024: 3 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (24 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

Attention Mechanisms

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