Graph Integration for Diffusion-Based Manifold Alignment

• URL: http://arxiv.org/abs/2410.22978v1
• Date: Wed, 30 Oct 2024 12:43:44 GMT
• Title: Graph Integration for Diffusion-Based Manifold Alignment
• Authors: Jake S. Rhodes, Adam G. Rustad,
• Abstract summary: Multimodal data integration can enrich information content compared to single-source data. Manifold alignment is a form of data integration that seeks a shared, underlying low-dimensional representation of multiple data sources. In this paper, we introduce two semi-supervised manifold alignment methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Data from individual observations can originate from various sources or modalities but are often intrinsically linked. Multimodal data integration can enrich information content compared to single-source data. Manifold alignment is a form of data integration that seeks a shared, underlying low-dimensional representation of multiple data sources that emphasizes similarities between alternative representations of the same entities. Semi-supervised manifold alignment relies on partially known correspondences between domains, either through shared features or through other known associations. In this paper, we introduce two semi-supervised manifold alignment methods. The first method, Shortest Paths on the Union of Domains (SPUD), forms a unified graph structure using known correspondences to establish graph edges. By learning inter-domain geodesic distances, SPUD creates a global, multi-domain structure. The second method, MASH (Manifold Alignment via Stochastic Hopping), learns local geometry within each domain and forms a joint diffusion operator using known correspondences to iteratively learn new inter-domain correspondences through a random-walk approach. Through the diffusion process, MASH forms a coupling matrix that links heterogeneous domains into a unified structure. We compare SPUD and MASH with existing semi-supervised manifold alignment methods and show that they outperform competing methods in aligning true correspondences and cross-domain classification. In addition, we show how these methods can be applied to transfer label information between domains.

Related papers

• Heterogeneous co-occurrence embedding for visual information exploration [0.0]
  We consider cases where co-occurrence probabilities are measured between pairs of elements from heterogeneous domains.<n>The proposed method maps these heterogeneous elements into corresponding two-dimensional latent spaces, enabling visualization of asymmetric relationships between the domains.
  arXiv  Detail & Related papers  (2025-08-25T04:51:50Z)
• Random Forest-Supervised Manifold Alignment [0.0]
  This paper presents an approach to manifold alignment using random forests as a foundation for semi-supervised alignment algorithms. We focus on enhancing two recently developed alignment graph-based by integrating class labels through geometry-preserving proximities derived from random forests. Our approach addresses a common limitation in manifold alignment, where existing methods often fail to generate embeddings that capture sufficient information for downstream classification.
  arXiv  Detail & Related papers  (2024-11-18T20:14:50Z)
• Learning with Alignments: Tackling the Inter- and Intra-domain Shifts for Cross-multidomain Facial Expression Recognition [16.864390181629044]
  We propose a novel Learning with Alignments CMFER framework, named LA-CMFER, to handle both inter- and intra-domain shifts. Based on this, LA-CMFER presents a dual-level inter-domain alignment method to force the model to prioritize hard-to-align samples in knowledge transfer. To address the intra-domain shifts, LA-CMFER introduces a multi-view intra-domain alignment method with a multi-view consistency constraint.
  arXiv  Detail & Related papers  (2024-07-08T07:43:06Z)
• SRCD: Semantic Reasoning with Compound Domains for Single-Domain Generalized Object Detection [39.14676152740142]
  We introduce Semantic Reasoning with Compound Domains (SRCD) for Single-DGOD. Our SRCD contains two main components, namely, the texture-based self-augmentation (TBSA) module, and the local-global semantic reasoning (LGSR) module. Extensive experiments on multiple benchmarks demonstrate the effectiveness of the proposed SRCD.
  arXiv  Detail & Related papers  (2023-07-04T14:39:59Z)
• Exploiting Graph Structured Cross-Domain Representation for Multi-Domain Recommendation [71.45854187886088]
  Multi-domain recommender systems benefit from cross-domain representation learning and positive knowledge transfer. We use temporal intra- and inter-domain interactions as contextual information for our method called MAGRec. We perform experiments on publicly available datasets in different scenarios where MAGRec consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-02-12T19:51:32Z)
• Manifold Alignment with Label Information [9.742277703732187]
  MALI (Manifold alignment with label information) learns a correspondence between two distinct domains. We show that MALI outperforms the current state-of-the-art manifold alignment methods across multiple datasets.
  arXiv  Detail & Related papers  (2022-10-23T16:32:29Z)
• ML-BPM: Multi-teacher Learning with Bidirectional Photometric Mixing for Open Compound Domain Adaptation in Semantic Segmentation [78.19743899703052]
  Open compound domain adaptation (OCDA) considers the target domain as the compound of multiple unknown homogeneous. We introduce a multi-teacher framework with bidirectional photometric mixing to adapt to every target subdomain. We conduct an adaptive distillation to learn a student model and apply consistency regularization to improve the student generalization.
  arXiv  Detail & Related papers  (2022-07-19T03:30:48Z)
• Diffusion Transport Alignment [10.949343817897455]
  Many existing data integration methods assume a known one-to-one correspondence between domains of the entire dataset. We propose a semi-supervised manifold alignment method that exploits prior correspondence knowledge between only a few points to align the domains. We empirically demonstrate that DTA outperforms other methods in aligning multimodal data in this semisupervised setting.
  arXiv  Detail & Related papers  (2022-06-15T05:25:06Z)
• Inferring Latent Domains for Unsupervised Deep Domain Adaptation [54.963823285456925]
  Unsupervised Domain Adaptation (UDA) refers to the problem of learning a model in a target domain where labeled data are not available. This paper introduces a novel deep architecture which addresses the problem of UDA by automatically discovering latent domains in visual datasets. We evaluate our approach on publicly available benchmarks, showing that it outperforms state-of-the-art domain adaptation methods.
  arXiv  Detail & Related papers  (2021-03-25T14:33:33Z)
• Cluster, Split, Fuse, and Update: Meta-Learning for Open Compound Domain Adaptive Semantic Segmentation [102.42638795864178]
  We propose a principled meta-learning based approach to OCDA for semantic segmentation. We cluster target domain into multiple sub-target domains by image styles, extracted in an unsupervised manner. A meta-learner is thereafter deployed to learn to fuse sub-target domain-specific predictions, conditioned upon the style code. We learn to online update the model by model-agnostic meta-learning (MAML) algorithm, thus to further improve generalization.
  arXiv  Detail & Related papers  (2020-12-15T13:21:54Z)
• Simultaneous Semantic Alignment Network for Heterogeneous Domain Adaptation [67.37606333193357]
  We propose aSimultaneous Semantic Alignment Network (SSAN) to simultaneously exploit correlations among categories and align the centroids for each category across domains. By leveraging target pseudo-labels, a robust triplet-centroid alignment mechanism is explicitly applied to align feature representations for each category. Experiments on various HDA tasks across text-to-image, image-to-image and text-to-text successfully validate the superiority of our SSAN against state-of-the-art HDA methods.
  arXiv  Detail & Related papers  (2020-08-04T16:20:37Z)
• Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation [56.694330303488435]
  We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework. In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-07-17T07:52:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.