GREW uses a secret-key-driven green-red item partition and three ranking-integrated modules to embed verifiable watermarks in recommender systems that resist extraction attacks without data injection.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
cs.IR 4years
2026 4verdicts
UNVERDICTED 4roles
background 3representative citing papers
AdaSID adaptively regulates semantic ID overlaps in multimodal recommendations to improve retrieval performance, codebook utilization, and downstream metrics like GMV.
Behavior-guided calibration converts co-user overlap into signed evidence applied only to multimodal recommender shortlists and yields consistent gains on Amazon Baby, Sports, and Electronics datasets.
A model-agnostic SID alignment update mitigates staleness from temporal drift in user-item interactions for generative retrievers, improving Recall@K and nDCG@K while reducing compute by 8-9x versus full retraining.
citing papers explorer
-
Green-Red Watermarking for Recommender Systems
GREW uses a secret-key-driven green-red item partition and three ranking-integrated modules to embed verifiable watermarks in recommender systems that resist extraction attacks without data injection.
-
Beyond Static Collision Handling: Adaptive Semantic ID Learning for Multimodal Recommendation at Industrial Scale
AdaSID adaptively regulates semantic ID overlaps in multimodal recommendations to improve retrieval performance, codebook utilization, and downstream metrics like GMV.
-
Behavior-Guided Candidate Calibration for Multimodal Recommendation
Behavior-guided calibration converts co-user overlap into signed evidence applied only to multimodal recommender shortlists and yields consistent gains on Amazon Baby, Sports, and Electronics datasets.
-
Mitigating Collaborative Semantic ID Staleness in Generative Retrieval
A model-agnostic SID alignment update mitigates staleness from temporal drift in user-item interactions for generative retrievers, improving Recall@K and nDCG@K while reducing compute by 8-9x versus full retraining.