Pith. sign in

REVIEW 2 cited by

Bridging Domains with Approximately Shared Features

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 2403.06424 v1 pith:KIK3X4ZH submitted 2024-03-11 stat.ML cs.CVcs.LG

classification stat.MLcs.CVcs.LG
keywords featureslearningapproximatelydomainssharedinvariantsourcechallenge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Multi-source domain adaptation aims to reduce performance degradation when applying machine learning models to unseen domains. A fundamental challenge is devising the optimal strategy for feature selection. Existing literature is somewhat paradoxical: some advocate for learning invariant features from source domains, while others favor more diverse features. To address the challenge, we propose a statistical framework that distinguishes the utilities of features based on the variance of their correlation to label $y$ across domains. Under our framework, we design and analyze a learning procedure consisting of learning approximately shared feature representation from source tasks and fine-tuning it on the target task. Our theoretical analysis necessitates the importance of learning approximately shared features instead of only the strictly invariant features and yields an improved population risk compared to previous results on both source and target tasks, thus partly resolving the paradox mentioned above. Inspired by our theory, we proposed a more practical way to isolate the content (invariant+approximately shared) from environmental features and further consolidate our theoretical findings.

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. Bridging Domain Adaptation and Graph Neural Networks: A Tensor-Based Framework for Effective Label Propagation

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A tensor-based GNN with pseudo-label-conditioned label propagation achieves state-of-the-art average accuracy on domain adaptive graph classification benchmarks.

  2. Elastic Representation: Mitigating Spurious Correlations for Group Robustness

    cs.LG 2025-02 conditional novelty 5.0 of 10

    Elastic Representation regularizes the last-layer representation with nuclear and Frobenius norms, improving worst-group accuracy on CelebA, Waterbirds, and CivilComments without needing group labels.

Pith tools