REVIEW 4 cited by
Improve Unsupervised Domain Adaptation with Mixup Training
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
read the original abstract
Unsupervised domain adaptation studies the problem of utilizing a relevant source domain with abundant labels to build predictive modeling for an unannotated target domain. Recent work observe that the popular adversarial approach of learning domain-invariant features is insufficient to achieve desirable target domain performance and thus introduce additional training constraints, e.g. cluster assumption. However, these approaches impose the constraints on source and target domains individually, ignoring the important interplay between them. In this work, we propose to enforce training constraints across domains using mixup formulation to directly address the generalization performance for target data. In order to tackle potentially huge domain discrepancy, we further propose a feature-level consistency regularizer to facilitate the inter-domain constraint. When adding intra-domain mixup and domain adversarial learning, our general framework significantly improves state-of-the-art performance on several important tasks from both image classification and human activity recognition.
Forward citations
Cited by 4 Pith papers
-
Face4FairShifts: A Large Image Benchmark for Fairness and Robust Learning across Visual Domains
A new face benchmark with four visual domains and fairness-sensitive labels provides larger measured distribution shifts and lower baseline performance than existing fairness datasets.
-
Entangled by Design: Spurious Intra-Variable Signal Routing in Tabular In-Context Learners
In-context learners route predictions through a spurious component inside a composite feature whenever that component correlates with the label, and the routing persists as context grows.
-
Adversarial Data Augmentation for Single Domain Generalization via Lyapunov Exponent-Guided Optimization
LEAwareSGD modulates the learning rate with a Lyapunov exponent estimate and claims state-of-the-art accuracy on three single-domain generalization benchmarks, but the method is underspecified and its hyperparameters ...
-
Single Domain Generalization in Diabetic Retinopathy: A Neuro-Symbolic Learning Approach
KG-DG fuses YOLO-derived lesion features with a frozen ViT via confidence-based fusion and claims gains in diabetic retinopathy domain generalization, but the central KL-divergence mechanism and the MDG headline are c...
Discussion (0). Sign in to comment.