mlsanityData to 7 Oct 2026

Joint Identifiability of Cross-Domain Recommendation via Hierarchical Subspace Disentanglement

arXiv 2404.04481 ↗First posted 6 Apr 2024cs.IR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Cross-Domain Recommendation (CDR) seeks to enable effective knowledge transfer across domains. Existing works rely on either representation alignment or transformation bridges, but they struggle on identifying domain-shared from domain-specific latent factors. Specifically, while CDR describes user representations as a joint distribution over two domains, these methods fail to account for its joint identifiability as they primarily fixate on the marginal distribution within a particular domain. Such a failure may overlook the conditionality between two domains and how it contributes to latent factor disentanglement, leading to negative transfer when domains are weakly correlated. In this study, we explore what should and should not be transferred in cross-domain user representations from a causality perspective. We propose a Hierarchical subspace disentanglement approach to explore the Joint IDentifiability of cross-domain joint distribution, termed HJID, to preserve domain-specific behaviors from domain-shared factors. HJID organizes user representations into layers: generic shallow subspaces and domain-oriented deep subspaces. We first encode the generic pattern in the shallow subspace by minimizing the Maximum Mean Discrepancy of initial layer activation. Then, to dissect how domain-oriented latent factors are encoded in deeper layers activation, we construct a cross-domain causality-based data generation graph, which identifies cross-domain consistent and domain-specific components, adhering to the Minimal Change principle. This allows HJID to maintain stability whilst discovering unique factors for different domains, all within a generative framework of invertible transformations that guarantee the joint identifiability. With experiments on real-world datasets, we show that HJID outperforms SOTA methods on a range of strongly and weakly correlated CDR tasks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 48 references that are in the map. First posted on arXiv 6 Apr 2024.

Builds on

20 of 48 references.

References · 20

  1. 2017Inductive Representation Learning on Large Graphscited by 6,284
  2. 2018Neural Ordinary Differential Equationscited by 3,733
  3. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  4. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
  5. 2016Deep Variational Information Bottleneckcited by 915
  6. 2017Masked Autoregressive Flow for Density Estimationcited by 680
  7. 2019Neural Graph Collaborative Filteringcited by 660
  8. 2016Deep Transfer Learning with Joint Adaptation Networkscited by 609
  9. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
  10. 2018Neural Autoregressive Flowscited by 207
  11. 2019Causal Discovery from Heterogeneous/Nonstationary Data with Independent Changescited by 166
  12. 2017Mind the Class Weight Bias: Weighted Maximum Mean Discrepancy for Unsupervised Domain Adaptationcited by 151
8 more
  1. 2021Cross-Domain Recommendation: Challenges, Progress, and Prospectscited by 74
  2. 2019DDTCDR: Deep Dual Transfer Cross Domain Recommendationcited by 71
  3. 2020Domain Adaptation as a Problem of Inference on Graphical Modelscited by 36
  4. 2023Contrastive Cross-Domain Sequential Recommendationcited by 31
  5. 2021Transfer-Meta Framework for Cross-domain Recommendation to Cold-Start Userscited by 24
  6. 2022Subsidiary Prototype Alignment for Universal Domain Adaptationcited by 17
  7. 2020A Heterogeneous Information Network based Cross Domain Insurance Recommendation System for Cold Start Userscited by 14
  8. 2021LightMove: A Lightweight Next-POI Recommendation for Taxicab Rooftop Advertisingcited by 9

Built on by

Not cited yet.