Skip to content

Enhancing Practical Domain Generalization via Partially Shared Features.

Sep 2026 · IEEE Transactions on Pattern Analysis and Machine Intelligence · Vol PP, pp. 1-16 · 0 citations
Medicine

TL;DR

A new DG framework is introduced that focuses on learning partially shared features (PSFs)-features shared among subsets of source domains, which contain and generalize ESFs, which contain and generalize ESFs.

Abstract

Domain Generalization (DG) aims to enhance the performance of models trained on source domains when applied to out-of-distribution (OOD) domains. Traditional DG approaches typically rely on the causal model that assumes the observed data in each domain is generated by shared semantic variables, along with domain-specific non-semantic variables. This principle suggests that strong DG performance can be achieved by maximizing model dependence on semantic variables while minimizing that on non-semantic ones, guiding numerous prior works centered on learning entirely shared features (ESFs), which are features common across all source domains. However, this well-established causal model may inadequately represent real-world scenarios, as many domains often exhibit non-shared semantic variables-where each domain captures only a partial aspect of the overall semantics. For instance, a photorealistic painting might emphasize the color of an animal, while a sketch primarily focuses on its outline and shape. Hence, overly emphasizing ESFs risks suboptimal generalization, as the maximum dependency between ESFs and semantic variables can be notably compromised when semantic disparities across source domains grow. To this end, we first formalize a refined causal graph that characterizes such non-shared semantic variables. Then, we introduce a new DG framework that focuses on learning partially shared features (PSFs)-features shared among subsets of source domains, which contain and generalize ESFs. To implement this concept, we propose a framework to extend previous methods that learn ESFs by adopting an inverse meta-learning mechanism to learn PSFs. Experimental results show that our framework enhances the performance of various existing methods and outperforms many state-of-the-art methods, highlighting the advantages of further exploring PSFs to advance practical DG.

View source

Similar papers

Book Open access Aug 2026

Sparse Additive Models for Domain Generalization

This work incorporates an additive structure into the DG framework and employs ℓq,1 -norm regularization to induce sparsity, thereby enabling structured feature selection and enhancing interpretability and presents two distinct realizations: an additive kernel-based formulation and a neural additive model-based approac...

Jia-Yi Wang, Han Li · 0 citations
Aug 2026

Active Domain Adaptation Under Concept Shift.

This paper proposes ADA-CS, a plug-and-play module compatible with any ADA or ASFDA framework, and introduces a CSS metric to quantify the Concept Shift Severity across domains, revealing that non-negligible concept shift exists in many transfer tasks.

Zi-Kang Zhu, Yiyan Huang, Xing Yan · 1 citation
Open access Sep 2026

TDKG: Text-Guided Domain Knowledge Generalization with Cross-Modal Feature Alignment

Domain generalization (DG) attempts to generalize a model trained on single or multiple source domains to an unseen target domain. Motivated by the transferability of vision-language pretrained models, we argue that text can provide complementary semantic cues for domain generalization. In this paper, we develop a Text...

Si-Lei Shen, Jing-Yi Zhang, Yuxi Wang et al. · 0 citations
#natural language process... Preprint Sep 2026

Hierarchical Wasserstein Merging for Multi-Domain Multi-Task Learning: From Specialists to a Generalist

Multi-domain multi-task learning (MD-MTL) aims to build a single generalist model that performs well across heterogeneous domains and tasks. However, joint training often suffers from interference under distribution shifts. Existing model merging methods mostly operate on model parameters while overlooking the geometri...

Ming Cheng, Jiaying Gong, Hoda Eldardiry · 0 citations
#artificial intelligence Preprint Sep 2026

Which Tasks Survive Self-Supervised Learning?

Same-instance self-supervised learning (SSL) learns representations by enforcing consistency across two views of the same underlying instance. This principle alone, however, does not determine which downstream tasks remain recoverable from the learned representation. We study this question through \emph{semantic recove...

Achleshwar Luthra, Lucas Bryant, T. Zhu et al. · 0 citations
#machine learning Preprint Sep 2026

How Many Samples Are Enough for Learning Across Domains?

Understanding the fundamental mechanisms of learning is essential for designing systems with strong generalization. Recent studies have shown that increasing the number of training domains, or enlarging the distribution shift among them, improves generalization when each domain contains sufficiently many data samples....

Hong Zheng · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.