Pith. sign in

REVIEW 2 cited by

MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation

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 2410.05877 v1 pith:OD5FZQTN submitted 2024-10-08 cs.IR cs.LG

classification cs.IRcs.LG
keywords userframeworkadaptivemdapcross-domaindifferentdisentangledlearning
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Cross-domain Recommendation systems leverage multi-domain user interactions to improve performance, especially in sparse data or new user scenarios. However, CDR faces challenges such as effectively capturing user preferences and avoiding negative transfer. To address these issues, we propose the Multi-view Disentangled and Adaptive Preference Learning (MDAP) framework. Our MDAP framework uses a multiview encoder to capture diverse user preferences. The framework includes a gated decoder that adaptively combines embeddings from different views to generate a comprehensive user representation. By disentangling representations and allowing adaptive feature selection, our model enhances adaptability and effectiveness. Extensive experiments on benchmark datasets demonstrate that our method significantly outperforms state-of-the-art CDR and single-domain models, providing more accurate recommendations and deeper insights into user behavior across different domains.

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. Scaling New Frontiers: Insights into Large Recommendation Models

    cs.IR 2024-12 conditional novelty 4.0 of 10

    Deep HSTU models tend to improve recall, ranking, multi-behavior, and multi-domain performance on public data, while GPT and SASRec fail to scale, though the evidence lacks error bars.

  2. Optimizing Sequential Recommendation Models with Scaling Laws and Approximate Entropy

    cs.AI 2024-11 reject novelty 4.0 of 10

    The authors propose a 'Performance Law' for sequential recommendation models that predicts HR and NDCG from model layers, embedding dimension, and number of tokens divided by Approximate Entropy, then uses the fitted ...

Pith tools