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

Kurt Wan-Duo Ma

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

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

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
2 papers
Deep learning architectures and training · 77% Representation and self-supervised learning · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › neural network training
backpropagation-free training
0.412020
The HSIC Bottleneck: Deep Learning without Back-Propagation · AAAI 2020
Machine learning › Representation and self-supervised learning
information bottleneck
0.412020
The HSIC Bottleneck: Deep Learning without Back-Propagation · AAAI 2020
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
Machine learning › Deep learning architectures and training › training dynamics
vanishing gradient
0.112020
The HSIC Bottleneck: Deep Learning without Back-Propagation · AAAI 2020

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

stochastic gradient descent · 0.4hilbert-schmidt independence criterion · 0.4initialization · 0.3batch normalization · 0.3
YearPublicationVenuePosition
2020 The HSIC Bottleneck: Deep Learning without Back-Propagation
abstract
We introduce the HSIC (Hilbert-Schmidt independence criterion) bottleneck for training deep neural networks. The HSIC bottleneck is an alternative to the conventional cross-entropy loss and backpropagation that has a number of distinct advantages. It mitigates exploding and vanishing gradients, resulting in the ability to learn very deep networks without skip connections. There is no requirement for symmetric feedback or update locking. We find that the HSIC bottleneck provides performance on MNIST/FashionMNIST/CIFAR10 classification comparable to backpropagation with a cross-entropy target, even when the system is not encouraged to make the output resemble the classification labels. Appending a single layer trained with SGD (without backpropagation) to reformat the information further improves performance.
Kurt Wan-Duo Ma, John P. Lewis, W. Bastiaan Kleijn
AAAI1
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
ICML5