Pith. sign in

REVIEW 2 cited by

Multi-domain Recommendation with Embedding Disentangling and Domain Alignment

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.05508 v2 pith:R4SMPVJC submitted 2023-08-10 cs.IR cs.AI

classification cs.IRcs.AI
keywords domainsdisentanglingdomaineddaembeddingknowledgeuseralignment
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-domain recommendation (MDR) aims to provide recommendations for different domains (e.g., types of products) with overlapping users/items and is common for platforms such as Amazon, Facebook, and LinkedIn that host multiple services. Existing MDR models face two challenges: First, it is difficult to disentangle knowledge that generalizes across domains (e.g., a user likes cheap items) and knowledge specific to a single domain (e.g., a user likes blue clothing but not blue cars). Second, they have limited ability to transfer knowledge across domains with small overlaps. We propose a new MDR method named EDDA with two key components, i.e., embedding disentangling recommender and domain alignment, to tackle the two challenges respectively. In particular, the embedding disentangling recommender separates both the model and embedding for the inter-domain part and the intra-domain part, while most existing MDR methods only focus on model-level disentangling. The domain alignment leverages random walks from graph processing to identify similar user/item pairs from different domains and encourages similar user/item pairs to have similar embeddings, enhancing knowledge transfer. We compare EDDA with 12 state-of-the-art baselines on 3 real datasets. The results show that EDDA consistently outperforms the baselines on all datasets and domains. All datasets and codes are available at https://github.com/Stevenn9981/EDDA.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Large Scalable Cross-Domain Graph Neural Networks for Personalized Notification at LinkedIn

    cs.LG 2025-06 conditional novelty 4.0 of 10

    At LinkedIn, a cross-domain GNN trained on a unified 8.6 billion-node graph with temporal modeling and multi-task learning reports a 0.62% CTR lift and a 0.10% WAU lift online.

  2. Pre-train and Fine-tune: Recommenders as Large Models

    cs.IR 2025-01 reject novelty 4.0 of 10

    A plug-in fine-tuning module called IAK, with an information-bottleneck interpretation, improves multi-domain recommender performance in offline and online tests at Alibaba.

Pith tools