pith. sign in

arxiv: 1301.2115 · v1 · pith:TSPFCXSHnew · submitted 2013-01-10 · 📊 stat.ML · cs.LG

Domain Generalization via Invariant Feature Representation

classification 📊 stat.ML cs.LG
keywords domainsgeneralizationinvariantalgorithmanalysisdicadissimilaritydomain
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

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

    cs.LG 2025-02 unverdicted novelty 6.0

    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...