Pith. sign in

REVIEW 2 cited by

Adversarial Multi-task Learning for Text Classification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1704.05742 v1 pith:CMG7JD3S submitted 2017-04-19 cs.CL

classification cs.CL
keywords learningsharedtasksfeaturesmulti-taskadversarialclassificationknowledge
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Neural network models have shown their promising opportunities for multi-task learning, which focus on learning the shared layers to extract the common and task-invariant features. However, in most existing approaches, the extracted shared features are prone to be contaminated by task-specific features or the noise brought by other tasks. In this paper, we propose an adversarial multi-task learning framework, alleviating the shared and private latent feature spaces from interfering with each other. We conduct extensive experiments on 16 different text classification tasks, which demonstrates the benefits of our approach. Besides, we show that the shared knowledge learned by our proposed model can be regarded as off-the-shelf knowledge and easily transferred to new tasks. The datasets of all 16 tasks are publicly available at \url{http://nlp.fudan.edu.cn/data/}

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dynamic Domain Information Modulation Algorithm for Multi-domain Sentiment Analysis

    cs.CL 2025-05 reject novelty 6.0 of 10

    A new algorithm (DAMA) learns a per-domain scalar step size that modulates the input's domain information via gradients, yielding a modest 0.3% average accuracy improvement over a multi-task baseline.

  2. Empirical Evaluation of Multi-task Learning in Deep Neural Networks for Natural Language Processing

    cs.CL 2019-08 reject novelty 6.0 of 10

    Across nine NLP datasets, multi-task learning with linguistic-hierarchy supervision gives the largest average gain among five MTL mechanisms, and the best hybrid combines hierarchies, gating, and label embedding, not ...

Pith tools