Pith. sign in

REVIEW 3 cited by

Revisiting Self-Training for Neural Sequence 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 1909.13788 v3 pith:XMTRJKNE submitted 2019-09-30 cs.LG cs.CLstat.ML

classification cs.LGcs.CLstat.ML
keywords self-trainingdataunlabeledgenerationmodelsequenceablebaseline
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Self-training is one of the earliest and simplest semi-supervised methods. The key idea is to augment the original labeled dataset with unlabeled data paired with the model's prediction (i.e. the pseudo-parallel data). While self-training has been extensively studied on classification problems, in complex sequence generation tasks (e.g. machine translation) it is still unclear how self-training works due to the compositionality of the target space. In this work, we first empirically show that self-training is able to decently improve the supervised baseline on neural sequence generation tasks. Through careful examination of the performance gains, we find that the perturbation on the hidden states (i.e. dropout) is critical for self-training to benefit from the pseudo-parallel data, which acts as a regularizer and forces the model to yield close predictions for similar unlabeled inputs. Such effect helps the model correct some incorrect predictions on unlabeled data. To further encourage this mechanism, we propose to inject noise to the input space, resulting in a "noisy" version of self-training. Empirical study on standard machine translation and text summarization benchmarks shows that noisy self-training is able to effectively utilize unlabeled data and improve the performance of the supervised baseline by a large margin.

Discussion (0). Sign in 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. Direct Diffusion Score Preference Optimization via Stepwise Contrastive Policy-Pair Supervision

    cs.CV 2025-12 conditional novelty 6.0 of 10

    Diffusion image models can be aligned without human labels by supervising every denoising step with score targets from original versus degraded prompts.

  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. EvolveSearch: An Iterative Self-Evolving Search Agent

    cs.CL 2025-05 conditional novelty 5.0 of 10

    An iterative loop of RL and filtered SFT on the agent's own rollouts improves a 7B web-search agent by a few accuracy points on multi-hop QA benchmarks.

Pith tools