Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Bridging Domain Invariance and Diversity: A Fine-Grained Risk Bound for Domain Generalization

Дата публикации: 17-08-2026 20:26:00


Domain-invariant representation learning and domain augmentation algorithms are two principal methodological paradigms for addressing domain generalization. They are widely employed in the machine learning literature to enhance domain invariance and domain diversity, respectively. However, existing risk bounds for domain generalization do not simultaneously capture the contributions of both approaches. This limitation arises because bounds derived directly in the original latent space are typically too coarse-grained and ambiguous to characterize how invariance and diversity jointly influence generalization. Since these two properties are often regarded as being inherently contradictory, it becomes difficult to disentangle and rigorously characterize their individual effects. To address this issue, we first observe that the latent representation space can be decomposed into several distinct subspaces, each exhibiting different characteristics and therefore being better suited for analyzing the respective roles of domain invariance and domain diversity. Building on this observation, we propose a unified analytical framework for domain generalization. Specifically, we introduce a Tri-Space Latent Representation and establish its unique decomposability via a direct-sum decomposition. Under this decomposition, each data representation can be uniquely partitioned into three components: domain-invariant features, spurious invariant features, and domain-variant features. Within this framework, we derive a finer-grained bound on the target-domain risk, which consists of two principal terms corresponding to domain diversity and invariant factors. By theoretically analyzing these two terms, we show that domain-invariant representation learning and domain augmentation are both effective and, crucially, compatible strategies for addressing domain generalization. Finally, we design two sets of experiments to empirically validate the relationship between domain invariance and domain diversity, and to examine their respective effects on domain generalization performance.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1 Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical loss 01017-08-2026
2 Identifying Weight-Variant Latent Causal Models 05.717-08-2026
3 Kernel Mean Embedding Deviation Subspace for Unsupervised Learning with Heterogeneous Data 05.717-08-2026
4 Enhancing Accuracy in Generative Models via Knowledge Transfer 06.6617-08-2026
5 Sparse Topic Modeling via Spectral Decomposition and Thresholding 09.1817-08-2026
6 Nested Subspace Learning with Flags 0717-08-2026
7 High-Dimensional Analysis of Gradient Flow for Extensive-Width Quadratic Neural Networks 08.717-08-2026
8 End-to-End Deep Learning for Predicting Metric Space-Valued Outputs 010.6617-08-2026
9 Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective 010.9417-08-2026
10 Doubly Debiased Robust Subsampling for Transfer Learning 08.0617-08-2026

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 7. Источник: jmlr.org.