arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.04481cs.IRcs.AIcs.LG

通过层次子空间解耦实现跨域推荐的联合可识别性

Joint Identifiability of Cross-Domain Recommendation via Hierarchical Subspace Disentanglement

Macquarie University(麦考瑞大学);The University of New South Wales(新南威尔士大学);Northwestern Polytechnical University(西北工业大学);CSIRO’s Data 61(联邦科学与工业研究组织数据61部门)

Jing Du, Zesheng Ye, Bin Guo, Zhiwen Yu, Lina Yao

AI总结:

本文从因果视角提出层次子空间解耦方法HJID,通过分离域共享与域特定潜在因子并保证跨域联合分布的可识别性,在强弱相关CDR任务上均优于现有方法。

摘要:

跨域推荐(CDR)旨在实现跨领域的有效知识迁移。现有工作要么依赖表示对齐,要么依赖转换桥接,但它们在区分域共享潜在因子与域特定潜在因子方面存在困难。具体而言,虽然CDR将用户表示描述为两个域上的联合分布,但这些方法未能考虑其联合可识别性,因为它们主要关注特定域内的边际分布。这种不足可能会忽视两个域之间的条件关系及其对潜在因子解耦的贡献,从而在域间相关性较弱时导致负迁移。在本研究中,我们从因果关系的角度探讨跨域用户表示中应该迁移什么、不应该迁移什么。我们提出了一种层次子空间解耦方法,用于探索跨域联合分布的联合可识别性(Joint IDentifiability),称为HJID,以将域特定行为与域共享因子分离开来。HJID将用户表示组织为多个层次:通用浅层子空间和面向域的深层子空间。我们首先通过最小化初始层激活的最大均值差异(Maximum Mean Discrepancy)来编码浅层子空间中的通用模式。然后,为了剖析面向域的潜在因子如何在更深层激活中被编码,我们构建了一个基于跨域因果关系的数据生成图,该图识别跨域一致成分和域特定成分,并遵循最小变化原则(Minimal Change principle)。这使得HJID能够在保持稳定性的同时发现不同域的独特因子,所有这些都在一个可逆变换的生成框架内进行,从而保证联合可识别性。通过在真实世界数据集上的实验,我们表明HJID在一系列强相关和弱相关的CDR任务上优于SOTA方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑