Pith. sign in

REVIEW 2 cited by

Domain Generalization via Invariant Feature Representation

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 1301.2115 v1 pith:TSPFCXSH submitted 2013-01-10 stat.ML cs.LG

classification stat.MLcs.LG
keywords domainsgeneralizationinvariantalgorithmanalysisdicadissimilaritydomain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper investigates domain generalization: How to take knowledge acquired from an arbitrary number of related domains and apply it to previously unseen domains? We propose Domain-Invariant Component Analysis (DICA), a kernel-based optimization algorithm that learns an invariant transformation by minimizing the dissimilarity across domains, whilst preserving the functional relationship between input and output variables. A learning-theoretic analysis shows that reducing dissimilarity improves the expected generalization ability of classifiers on new domains, motivating the proposed algorithm. Experimental results on synthetic and real-world datasets demonstrate that DICA successfully learns invariant features and improves classifier performance in practice.

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. Moment Alignment: Unifying Gradient and Hessian Matching for Domain Generalization

    cs.LG 2025-06 reject novelty 6.0 of 10

    A unified moment-alignment theory bounds target-domain error by cross-domain differences in loss derivatives, and the new CMA algorithm implements exact gradient and Hessian matching in closed form.

  2. DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Tasks

    cs.LG 2025-02 unverdicted novelty 6.0 of 10

    DUET is a global-to-local method that optimizes LLM training data mixtures via Bayesian optimization guided by influence-based selection and feedback from unseen evaluation tasks, with a regret bound showing convergen...

Pith tools