Kernel-Based Generative Adversarial Networks for Weakly Supervised Learning

6Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, Deep Learning methods have become very popular in NLP classification tasks, due to their ability to reach high performances by relying on very simple input representations. One of the drawbacks in training deep architectures is the large amount of annotated data required for effective training. One recent promising method to enable semi-supervised learning in deep architectures has been formalized within Semi-Supervised Generative Adversarial Networks (SS-GANs). In this paper, an SS-GAN is shown to be effective in semantic processing tasks operating in low-dimensional embeddings derived by the unsupervised approximation of rich Reproducing Kernel Hilbert Spaces. Preliminary analyses over a sentence classification task show that the proposed Kernel-based GAN achieves promising results when only 1% of labeled examples are used.

Cite

CITATION STYLE

APA

Croce, D., Castellucci, G., & Basili, R. (2019). Kernel-Based Generative Adversarial Networks for Weakly Supervised Learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11946 LNAI, pp. 336–347). Springer. https://doi.org/10.1007/978-3-030-35166-3_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free