Skip to content
OpenTrain AIFor AI Companies

Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learning

Takeru Miyato, Shin‐ichi Maeda, Masanori Koyama, Shin IshiiPublished Jul 23, 2018
DOI Publisher
Researcher verdict
Context only
Use as context only
Benchmark evidence
Thin evidence
Verify before relying
Time to first repro
A few days
Plan setup time
Risk flags
1
Review before use

Abstract

Domain fit: AI-adjacent · Paper appears method- or tooling-adjacent to AI workflows with partial ecosystem coverage.

We propose a new regularization method based on virtual adversarial loss: a new measure of local smoothness of the conditional label distribution given input. Virtual adversarial loss is defined as the robustness of the conditional label distribution around each input data point against local perturbation. Unlike adversarial training, our method defines the adversarial direction without label information and is hence applicable to semi-supervised learning. Because the directions in which we smooth the model are only "virtually" adversarial, we call our method virtual adversarial training (VAT). The computational cost of VAT is relatively low. For neural networks, the approximated gradient of virtual adversarial loss can be computed with no more than two pairs of forward- and back-propagations. In our experiments, we applied VAT to supervised and semi-supervised learning tasks on multiple benchmark datasets. With a simple enhancement of the algorithm based on the entropy minimization principle, our VAT achieves state-of-the-art performance for semi-supervised learning tasks on SVHN and CIFAR-10.

Results and benchmarks

Freshness tier: cold
We propose a new regularization method based on virtual adversarial loss: a new measure of local smoothness of the conditional label distribution given input.

Implementation

No direct implementation yet

Maintained implementation evidence is not confirmed for this paper yet.

Use the implementation status and reproduction sections for the current action plan.

Implementation evidence summary
Confidence: medium

prakhar1989/awesome-courses is the closest maintained adjacent implementation (Matches contextual method/domain keyword: computer science). It is not paper-verified; validate algorithm and evaluation setup against the paper before trusting reported metrics. Community adoption signal: 70625 GitHub stars.

Reproduction risks
  • Adjacent implementations are not paper-verified
  • Recommended repository is adjacent and not paper-verified.

Reproduction readiness

Time to first repro: days
Last checked: Aug 24, 2026

No repo

No verified implementation available

  • No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.

Hardware requirements

  • Expect multi-day setup/compute for meaningful reproduction based on current guidance.

Repositories and ecosystem

Closest related implementations

These are not paper-verified. Use them as reference points when no direct implementation is available.

No additional verified repositories beyond the primary recommendation.

Hugging Face artifacts

No trustworthy direct or curated related Hugging Face artifacts were found yet. Use targeted searches to quickly locate candidate models, datasets, and demos.

Tip: start with models, then check datasets and spaces if you need evaluation data or demos.

Research context

2,870

Citations

92

References

Tasks

Adversarial system, Computer science, Regularization (linguistics), Entropy (arrow of time), Minification, Supervised learning, Semi-supervised learning, Cross entropy

Methods

None detected

Domains

Artificial intelligence, Machine learning

Evaluation and human feedback data

Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.

Open in HFEPX
Explore similar papers