Pith. sign in

REVIEW 2 cited by

One for Dozens: Adaptive REcommendation for All Domains with Counterfactual Augmentation

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 2412.11905 v2 pith:GI4325QY submitted 2024-12-16 cs.IR

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

Multi-domain recommendation (MDR) aims to enhance recommendation performance across various domains. However, real-world recommender systems in online platforms often need to handle dozens or even hundreds of domains, far exceeding the capabilities of traditional MDR algorithms, which typically focus on fewer than five domains. Key challenges include a substantial increase in parameter count, high maintenance costs, and intricate knowledge transfer patterns across domains. Furthermore, minor domains often suffer from data sparsity, leading to inadequate training in classical methods. To address these issues, we propose Adaptive REcommendation for All Domains with counterfactual augmentation (AREAD). AREAD employs a hierarchical structure with a limited number of expert networks at several layers, to effectively capture domain knowledge at different granularities. To adaptively capture the knowledge transfer pattern across domains, we generate and iteratively prune a hierarchical expert network selection mask for each domain during training. Additionally, counterfactual assumptions are used to augment data in minor domains, supporting their iterative mask pruning. Our experiments on two public datasets, each encompassing over twenty domains, demonstrate AREAD's effectiveness, especially in data-sparse domains. Source code is available at https://github.com/Chrissie-Law/AREAD-Multi-Domain-Recommendation.

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. TextBridgeGNN: Pre-training Graph Neural Network for Cross-Domain Recommendation via Text-Guided Transfer

    cs.IR 2025-11 unverdicted novelty 6.0 of 10

    TextBridgeGNN pre-trains GNNs using text-guided hierarchical propagation to enable effective cross-domain knowledge transfer in recommendations.

  2. Measure Domain's Gap: A Similar Domain Selection Principle for Multi-Domain Recommendation

    cs.IR 2025-05 conditional novelty 5.0 of 10

    A prototype-based distance measure plus an epsilon-greedy bandit selects per-domain subsets of source domains, improving multi-domain recommendation accuracy by reducing negative transfer.

Pith tools