Pith. sign in

REVIEW 3 cited by

A Simple but Tough-to-Beat Data Augmentation Approach for Natural Language Understanding and Generation

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 2009.13818 v2 pith:FJ2RAQVV submitted 2020-09-29 cs.CL cs.AI

classification cs.CLcs.AI
keywords cutofftrainingadversarialaugmentationdataeffectivefurthergeneration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Adversarial training has been shown effective at endowing the learned representations with stronger generalization ability. However, it typically requires expensive computation to determine the direction of the injected perturbations. In this paper, we introduce a set of simple yet effective data augmentation strategies dubbed cutoff, where part of the information within an input sentence is erased to yield its restricted views (during the fine-tuning stage). Notably, this process relies merely on stochastic sampling and thus adds little computational overhead. A Jensen-Shannon Divergence consistency loss is further utilized to incorporate these augmented samples into the training objective in a principled manner. To verify the effectiveness of the proposed strategies, we apply cutoff to both natural language understanding and generation problems. On the GLUE benchmark, it is demonstrated that cutoff, in spite of its simplicity, performs on par or better than several competitive adversarial-based approaches. We further extend cutoff to machine translation and observe significant gains in BLEU scores (based upon the Transformer Base model). Moreover, cutoff consistently outperforms adversarial training and achieves state-of-the-art results on the IWSLT2014 German-English dataset.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Contrastive Representation Regularization for Vision-Language-Action Models

    cs.RO 2025-10 conditional novelty 6.0 of 10

    Adding a robot-state-aware contrastive loss to VLA training improves manipulation success on RoboCasa-Kitchen and real-robot tasks.

  2. Intended Target Identification for Anomia Patients with Gradient-based Selective Augmentation

    cs.CL 2025-06 conditional novelty 6.0 of 10

    GradSelect uses gradient signals to selectively perturb and expand circumlocution text, improving retrieval of intended target items for anomia patients.

  3. Optimal Multi-Task Learning at Regularization Horizon for Speech Translation Task

    cs.CL 2025-09 conditional novelty 4.0 of 10

    Combining consistency regularization, R-drop, and the MT loss weight into a single scalar 'total regularization' predicts speech translation quality, and tuning near its optimum yields near-SOTA BLEU on MuST-C.

Pith tools