paper-with-me

홈 › Papers

Domain Generalization through Spatial Relation Induction over Visual Primitives

2026-05-07 · Dat Nguyen, Duc-Duy Nguyen arxiv

Domain generalization requires identifying stable representations that support reliable classification across domains. Most existing methods seek such stability through improving the training process, for example, through model selection strategies, data augmentation, or feature-alignment objectives. Although these strategies can be effective, they leave the representation learning of structural composition implicit, which may limit performance on compositional domain generalization benchmarks. In this work, we propose Primitive-Aware Relational Structure for domain gEneralization (PARSE), an image classification framework that factors visual recognition into visual primitives and their relational composition. We represent these compositions using soft binary, ternary, and quaternary predicates over primitive locations, yielding differentiable measures of spatial alignment that can be learned end-to-end. To learn primitives and relational structures jointly, we design an end-to-end architecture with three components: (1) a convolutional neural network (CNN) backbone that extracts general visual features, (2) a concept bottleneck layer that maps these features to primitive heatmaps with differentiable spatial coordinates, and (3) a structural scoring layer that evaluates candidate spatial relations among the detected primitives. We then compute class probability from the joint evidence of its class-specific relational compositions. Across CUB-DG and the DomainBed benchmark suite,PARSE improves accuracy by over 4.5 percentage points on CUB-DG and remains competitive with existing DG methods on DomainBed.

📄 PDF Abstract BibTeX arXiv:2605.06043

Code (0)

등록된 구현이 없습니다.

Tasks

Representation LearningDomain GeneralizationImage ClassificationData Augmentation

Similar Papers 제목 키워드 기반

Relation Schema Induction using Tensor Factorization with Side Information

2016-05-12 · EMNLP 2016 11 · Madhav Nimishakavi, Uday Singh Saini, Partha Talukdar

Given a set of documents from a specific domain (e.g., medical research journals), how do we automatically build a Knowledge Graph (KG) for that domain? Automatic identification of relations and their schemas, i.e., type…

Open Information ExtractionRelation

The Implications of the No-Free-Lunch Theorems for Meta-induction

2021-03-22 · David H. Wolpert

The important recent book by G. Schurz appreciates that the no-free-lunch theorems (NFL) have major implications for the problem of (meta) induction. Here I review the NFL theorems, emphasizing that they do not only conc…

Deep Spatial Domain Generalization

2022-10-03 · Dazhou Yu, Guangji Bai, Yun Li, Liang Zhao

Spatial autocorrelation and spatial heterogeneity widely exist in spatial data, which make the traditional machine learning model perform badly. Spatial domain generalization is a spatial extension of domain generalizati…

Domain GeneralizationGraph Neural NetworkSpatial Interpolation

Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic

2024-03-26 · Connor Pryor, Quan Yuan, Jeremiah Liu, Mehran Kazemi 외

Dialog Structure Induction (DSI) is the task of inferring the latent dialog structure (i.e., a set of dialog states and their temporal transitions) of a given goal-oriented dialog. It is a critical component for modern d…

Domain GeneralizationFew-Shot LearningGoal-Oriented Dialog

Map Induction: Compositional spatial submap learning for efficient exploration in novel environments

2021-10-23 · ICLR 2022 4 · Sugandha Sharma, Aidan Curtis, Marta Kryven, Josh Tenenbaum 외

Humans are expert explorers. Understanding the computational cognitive mechanisms that support this efficiency can advance the study of the human mind and enable more efficient exploration algorithms. We hypothesize that…

Efficient ExplorationProgram induction