Pith. sign in

REVIEW 2 cited by

Free Lunch for Domain Adversarial Training: Environment Label Smoothing

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 2302.00194 v1 pith:4STBG2R6 submitted 2023-02-01 cs.LG

Free Lunch for Domain Adversarial Training: Environment Label Smoothing

classification cs.LG
keywords environmentdomaintrainingdiscriminatorlabellabelsnoisyadversarial
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A fundamental challenge for machine learning models is how to generalize learned models for out-of-distribution (OOD) data. Among various approaches, exploiting invariant features by Domain Adversarial Training (DAT) received widespread attention. Despite its success, we observe training instability from DAT, mostly due to over-confident domain discriminator and environment label noise. To address this issue, we proposed Environment Label Smoothing (ELS), which encourages the discriminator to output soft probability, which thus reduces the confidence of the discriminator and alleviates the impact of noisy environment labels. We demonstrate, both experimentally and theoretically, that ELS can improve training stability, local convergence, and robustness to noisy environment labels. By incorporating ELS with DAT methods, we are able to yield state-of-art results on a wide range of domain generalization/adaptation tasks, particularly when the environment labels are highly noisy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Online Variance Reduction for Domain Adaptation on Streaming Data

    cs.LG 2026-07 conditional novelty 6.0

    ARROW is a new streaming algorithm that reduces minibatch variance for MMD and CORAL by reweighting each incoming batch to match an exponential moving average of alignment statistics.

  2. Variance-reduced Domain Adaptation using Paired Sampling

    cs.LG 2026-07 conditional novelty 5.0

    PSDA pairs source-target examples into quadruplets via linear assignment problems, reducing the variance of MMD/CORAL minibatch gradient estimates and improving target-domain accuracy on Spawrious, Office-Home, and Humpbacks.