LGCVMLNov 20, 2017

Virtual Adversarial Ladder Networks For Semi-supervised Learning

arXiv:1711.07476v2
Originality Incremental advance
AI Analysis

This work addresses the problem of reducing labeling costs in machine learning for practitioners, offering an incremental improvement by fusing existing methods to enhance performance and robustness in semi-supervised settings.

The paper tackles semi-supervised learning by combining ladder networks and virtual adversarial training into a new model class, achieving near-supervised accuracy with only 5 labels per class on MNIST, such as a 1.42% error rate compared to 1.62% for ladder networks, and significantly improving robustness to adversarial examples with a 2.4% error rate versus 68.6% for ladder networks.

Semi-supervised learning (SSL) partially circumvents the high cost of labeling data by augmenting a small labeled dataset with a large and relatively cheap unlabeled dataset drawn from the same distribution. This paper offers a novel interpretation of two deep learning-based SSL approaches, ladder networks and virtual adversarial training (VAT), as applying distributional smoothing to their respective latent spaces. We propose a class of models that fuse these approaches. We achieve near-supervised accuracy with high consistency on the MNIST dataset using just 5 labels per class: our best model, ladder with layer-wise virtual adversarial noise (LVAN-LW), achieves 1.42% +/- 0.12 average error rate on the MNIST test set, in comparison with 1.62% +/- 0.65 reported for the ladder network. On adversarial examples generated with L2-normalized fast gradient method, LVAN-LW trained with 5 examples per class achieves average error rate 2.4% +/- 0.3 compared to 68.6% +/- 6.5 for the ladder network and 9.9% +/- 7.5 for VAT.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes