- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes IDShare, which learns to assign multiple IDs to shared embeddings to alleviate overfitting in long-tailed recommendation. The assignments and embeddings are jointly optimized using the recommendation objective. Experiments on TAAC and KuaiRand demonstrate improvements over independent embeddings and several regularization baselines.
Critical strengths
-
The paper addresses a practical problem in recommendation systems, as long-tailed IDs often have too few interactions to learn reliable embeddings.
-
The proposed method is simple and intuitive. Sharing embeddings seems like a reasonable way to reduce overfitting without relying on L2 regularization.
-
The experiments cover two large-scale datasets and several recommendation backbones, making the results more convincing.
-
I appreciate the additional analyses on codebook size, model depth, and ID frequency, which help better understand the method's behavior.
Critical weaknesses
-
The novelty is somewhat limited. Similar ideas have been explored in previous work, such as Clustered Embedding Learning, and the differences are not clearly explained.
-
The paper would benefit from comparisons with existing learned embedding-sharing methods, rather than mainly focusing on standard regularization and fixed-sharing baselines.
-
Continuous and IDShare use different OOV representations, which may affect the fairness of the unseen-ID comparison. It is unclear how much of the reported improvement comes from this difference.
-
The improvements over tuned L2 baselines are relatively small. The high variance across runs on TAAC also raises concerns about the consistency of these gains.
-
The paper provides little analysis of computational costs. It would be useful to report training time, memory usage, and inference latency.
Questions for authors
See weaknesses.
3 comments
Brief follow-up on our new experiments
As the discussion period nears its close, we wanted to check whether our new experiments and revised manuscript address Weaknesses 1–5, or if anything remains unclear.
One brief observation from Appendix Table 18 further clarifies W1–W2: on both benchmarks, adapted CCE and CEL-Lite actually finish below even unregularized Continuous(0) in mean AUC (77.035% and 74.676% vs. 77.070% on TAAC; 75.337% and 71.141% vs. 75.370% on KuaiRand), whereas IDShare(0) outperforms L2-tuned Continuous without an L2 sweep, retains +0.352 pp on seen 1–10 lookup IDs under matched 1% OOV masking (Table 17), and cuts inference GPU memory by 61.5%–70.2% (Table 22). Thus, whether embedding sharing helps or hurts generalization depends directly on joint, residual-free single-code training.
Please let us know if any further details would be helpful in the remaining discussion window.
Gentle Reminder on Rebuttal Discussion
Dear Reviewer,
As the discussion deadline is approaching, I would kindly encourage you to review the authors' rebuttal and share your follow-up comments, particularly on whether your concerns have been adequately addressed.
Your feedback would be greatly appreciated and helpful for the final assessment. Thank you for your time and contribution!
Response to Reviewer kYEV
Thank you for your review. Below we address Weaknesses 1–5 with new experiments and measurements (highlighted in blue in the revised manuscript).
W1 & W2. Differences and comparisons with CEL and learned sharing. Unlike CEL's alternating cluster-reassignment and splitting stages or CCE's sketched reclustering, IDShare updates fixed-K single-code routes and shared vectors jointly on every step via hard nearest-code selection and soft straight-through gradients, with no private residual (Table 1 in §2.5). Under matched inputs, RankMixer backbones, d=16, seeds, and λ=0 (§4.6, Table 6; Appendix I.1, Table 18), IDShare outperforms adapted CCE (matched Kd shared floats) and CEL-Lite (pure shared clusters under our Adam setup) on all three seeds on both datasets: +0.492 ± 0.217 pp over CCE and +2.850 ± 0.150 pp over CEL-Lite on TAAC (77.526% vs. 77.035% and 74.676%), and +0.107 ± 0.058 pp over CCE and +4.304 ± 0.498 pp over CEL-Lite on KuaiRand (75.445% vs. 75.337% and 71.141%).
W3. Fairness of OOV representations. We trained Tuned Continuous (λ=3×10−9) and IDShare (λ=0) on TAAC with identical 1% random OOV masks on real target and history lookups, giving Continuous's OOV row and IDShare's b0 matched fallback training exposure (Appendix H, Table 17). Under symmetric OOV exposure, the unseen-target AUC gap closes (-0.0257 ± 0.0738 pp, 1/3 seeds; unseen logloss still favors IDShare on 3/3 seeds), confirming your point on unseen ranking. Meanwhile, IDShare's gain on seen 1–10 lookup IDs increases to +0.3517 ± 0.0863 pp (3/3 seeds) and overall AUC stays higher by +0.0405 ± 0.0130 pp (3/3 seeds) (zeroing only b0 at evaluation in Table 16 also leaves +0.4334 pp overall over Continuous(0)). Thus, our seen long-tail improvements persist under matched fallback exposure rather than relying on OOV asymmetry.
W4. Gain over tuned L2 and cross-seed variance on TAAC. Appendix I.3, Table 21 reports full paired statistics: while the single 3-seed TAAC/RankMixer overall contrast vs. Tuned Continuous (+0.0738 ± 0.1959 pp) has a wide interval, IDShare(0) exceeds grid-tuned Continuous in all four dataset/backbone settings without a 7-point L2 search (including +0.4411 ± 0.0964 pp, p=0.0156 on TAAC/DIN, and +0.1518 pp, p=0.0102 across the four settings under independent-stratum assumptions), and leads on all three paired seeds at every tested K∈[10K,80K] and depth 2,4,8 (Appendix D). Looking within frequency groups, the gain is much clearer on sparse items (with a -0.0118 pp trade-off on 501+ head items): on 1–10 lookup target IDs, IDShare beats Tuned-L2 Continuous on all three seeds by +0.2164 ± 0.1429 pp (Table 19, overall +0.1554 ± 0.0507 pp) and Matched-OOV Tuned-L2 Continuous on all three seeds by +0.3517 ± 0.0863 pp (Table 17).
W5. Training time, memory usage, and inference latency. In isolated single-GPU benchmarks on TAAC (§5; Appendix I.3, Table 22), native training at batch 2,048 takes 66.86 ms per step (30.6K ex/s, 7.65 GiB peak allocated) vs. 28.94 ms (70.4K ex/s, 6.85 GiB) for Tuned Continuous (2.31× per-step cost, while avoiding a 7-run L2 sweep). Exporting shrinks the saved full-model
state_dictby 72.3% (1,476.4 → 409.3 MB; 93.6% on the identity payload) and cuts inference peak allocated GPU memory by 61.5%–70.2% vs. Continuous (1.39 to 0.41 GiB at batch 1; 1.40 to 0.43 GiB at batch 128; 1.59 to 0.61 GiB at batch 2,048), with exported p50 latency within 4.6%–5.4% of Continuous (2.18 / 2.50 / 3.35 ms vs. 2.07 / 2.38 / 3.20 ms).