Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lennox Leary

dblp:195/6179 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › convolutional neural network
residual network
0.312017
The Shattered Gradients Problem: If resnets are the answer, then what is the question? · ICML 2017
Machine learning › Deep learning architectures and training
skip connections
0.312017
The Shattered Gradients Problem: If resnets are the answer, then what is the question? · ICML 2017
Machine learning › Deep learning architectures and training › training dynamics
vanishing and exploding gradients
0.312017
The Shattered Gradients Problem: If resnets are the answer, then what is the question? · ICML 2017

Methods — techniques the papers use, named apart from their topics

initialization · 0.3batch normalization · 0.3
YearPublicationVenuePosition
2017 The Shattered Gradients Problem: If resnets are the answer, then what is the question?
abstract
A long-standing obstacle to progress in deep learning is the problem of vanishing and exploding gradients. Although, the problem has largely been overcome via carefully constructed initializations and batch normalization, architectures incorporating skip-connections such as highway and resnets perform much better than standard feedforward architectures despite well-chosen initialization and batch normalization. In this paper, we identify the shattered gradients problem. Specifically, we show that the correlation between gradients in standard feedforward networks decays exponentially with depth resulting in gradients that resemble white noise whereas, in contrast, the gradients in architectures with skip-connections are far more resistant to shattering, decaying sublinearly. Detailed empirical evidence is presented in support of the analysis, on both fully-connected networks and convnets. Finally, we present a new “looks linear” (LL) initialization that prevents shattering, with preliminary experiments showing the new initialization allows to train very deep networks without the addition of skip-connections.
David Balduzzi, Marcus Frean, Lennox Leary, John P. Lewis, Kurt Wan-Duo Ma, Brian McWilliams
ICML3