Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learning
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
We propose a new regularization method based on virtual adversarial loss: a new measure of local smoothness of the conditional label distribution given input.
Benchmark evidence is limited
Evidence graph: 3 refs, 3 links.
Utility signals: depth 100/100, grounding 85/100, status high.
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.
No verified maintained repo yet
There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.
- No maintained paper-verified implementation was found; start with the closest related repositories below.
- Compare repo methods against the paper equations/algorithm before trusting metrics.
- Create a minimal baseline implementation from the paper and use adjacent repos as references.
Time to first repro: a few days
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.
- Adjacent implementations are not paper-verified
- Recommended repository is adjacent and not paper-verified.
Reproduction readiness
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.
- prakhar1989/awesome-courses Adjacent · Confidence: Medium · 70,625 stars
Matches contextual method/domain keyword: computer science
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
Related papers
- A safe semi-supervised kernel minimum squared error algorithmSearch on Paper2Code
2015 · Semantic similarity
- Empowering Imbalanced Data in Supervised Learning: A Semi-supervised Learning ApproachSearch on Paper2Code
2014 · Semantic similarity
- Recommender system designed using an ensemble approach to semi-supervised learningSearch on Paper2Code
2022 · Semantic similarity
- Weakly Supervised Learning: What Could It Do and What Could Not?Search on Paper2Code
2010 · Semantic similarity
- A risk degree-based safe semi-supervised learning algorithmSearch on Paper2Code
2015 · Semantic similarity
Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.
Open in HFEPXJump to Paper2Code search queries derived from this paper's research context.