- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
DiffROS generates ordered slates of semantic IDs by resolving identifier levels sequentially and slate positions in parallel, with optional duplicate repair. It compares this factorization with item-level beam retrieval and autoregressive slate generation, and studies duplicate accounting and conditional ordering metrics. The reported gains concern decoding depth and ordering diagnostics; item-level beam retrieval remains stronger on the internal-corpus retrieval metrics.
Critical strengths
-
Reduced sequential decoding depth. Parallelizing slate positions makes the decoding depth independent of slate size at a fixed denoising and repair budget. This is a useful computational property, distinct from constant total computation.
-
An informative duplicate-accounting check. Table 4 rescores the same outputs under two conventions, illustrating how repeatedly crediting a correct item can distort the comparison between repetitive and diverse predictions.
Critical weaknesses
-
The central ordering advantage is not established by the proposed diagnostic. Sections 4.1 and 4.4 compare gaps between two halves of each decoder's own recovered items under a deliberately bimodal target. This mixes ordering with the composition of the recovered set: even two perfectly ordered sets can have different half-split gaps if their relevance ranges differ. A decoder retrieving consistently relevant items can have a smaller gap than one retrieving a mixture of high- and low-relevance items. The shuffle control demonstrates an ordering signal within DiffROS's recovered set, but does not establish superior ordering across different recovered sets.
-
The practical comparison relies on a severely repetitive AR baseline. In Table 3, the autoregressive decoder returns only a few distinct identifiers even for long slates. The matched-capacity and unrepaired-versus-unrepaired comparisons are useful, but do not establish that this behavior is inherent to autoregression. An AR baseline with duplicate prevention or repair, including its actual computational cost, would make the practical comparison more convincing. The public-benchmark results are mixed, so they do not independently establish a consistent advantage. Missing internal-corpus split details and decoder training specifications also make the severe repetition difficult to assess independently.
-
The claimed exactness of the reverse process is not established. Section 2 calls the level-wise sampler an “exact reverse transition,” while Appendix C states that the reverse process factorizes. Equation (5) gives coordinate marginals, but independent forward masking does not imply conditional independence of dependent slots revealed together. For example, a distribution supported equally on (0,1) and (1,0) has uniform marginals whose independent product also generates (0,0) and (1,1).
I recommend rejection. The computational property and duplicate-accounting analysis have value, but the comparative evidence does not establish the proposed joint decoder's main benefit, and the reverse-process justification needs correction.
Minor Issues
-
I recommend a dedicated related-work section to organize and substantively discuss these important connections, rather than relying on the current introduction alone. In particular, distinguish DiffROS from DDBC [1] for masked discrete diffusion over RVQ codes in multi-item construction; HiGR [2] for efficient semantic-ID slate generation through hierarchical planning; GFN4Rec [3] for autoregressive list generation with reward-aligned diversity; and List-CVAE [4] for direct joint slate generation.
[1] Tu, T., Li, A., Ma, Y., Xu, S., Liu, X., Ma, H., Pang, L., & Chua, T.-S. (2026). Discrete diffusion for bundle construction. The Fourteenth International Conference on Learning Representations.
[2] Pang, Y., Liu, Z., Li, Y., Zhu, S., Luo, Z., Yu, C., Wu, S., Shen, S., Xu, C., Wang, B., Jiang, K., Yu, H., Zhuo, C., & Li, Z. (2026). HiGR: Efficient generative slate recommendation via hierarchical planning and multi-objective preference alignment (arXiv:2512.24787v2). arXiv.
[3] Liu, S., Cai, Q., He, Z., Sun, B., McAuley, J., Zheng, D., Jiang, P., & Gai, K. (2023). Generative flow network for listwise recommendation. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 1524–1534). Association for Computing Machinery.
[4] Jiang, R., Gowal, S., Qian, Y., Mann, T. A., & Rezende, D. J. (2019). Beyond greedy ranking: Slate optimization via List-CVAE. International Conference on Learning Representations.
-
Section 4.3's “cannot reveal an arrangement” is too broad: nDCG responds to order, though it does not measure inter-item utility.
-
important Section 4.2 and the conclusion claim beam's advantage on both corpora, but Table 2 has no Amazon beam row. =
-
Figure 3's timing panels need hardware, batch size, precision, and caching details
Questions for authors
-
Separating ordering from item selection (W1). How does the half-split gap distinguish better ordering from a wider relevance range or a different recovered item population? Could you evaluate ordering on a matched item set and include a pointwise scoring-and-ordering control? Please also explain why the within-decoder subtraction in Appendix E is claimed to cancel the selection issue when those differences are subsequently compared across decoders.
-
A practical AR comparison and the value of joint decoding (W2). Could you compare against an AR slate decoder with duplicate prevention or repair, reporting both retrieval/ordering quality and the full added decoding cost under comparable conditions? Beyond the existing factorization comparisons, what evidence shows when bidirectional joint conditioning improves the ordered-slate objective, rather than benefiting mainly from the severe repetition of the tested AR baseline?
-
Conditions for an exact reverse transition (W3). Under what assumptions do the coordinate-wise reverse probabilities in Equation (5) yield an exact joint transition for slots revealed together? Could you distinguish exact sampling from the factorized model defined by Equation (4) from recovery of the data distribution's true reverse process? Please also clarify how Appendix D's uniform reopening is consistent with a transition that otherwise leaves unmasked positions fixed, or identify it separately as a repair operation.
5 comments
You are right that independent forward masking does not make the joint reverse transition exact, and the revision says so. Eq. 4 is now a stated modeling assumption: at one step per level and without repair, the sampler draws exactly from that factorized model, which equals the data's reverse conditional only when the slots revealed together are conditionally independent, exactly what your (0,1)/(1,0) example breaks (Sec. 2, p. 4, ll. 205-209 and ll. 214-215; App. C, p. 15, ll. 795-797). Reopening resolved positions is not a transition of Eq. 5, so Appendix D treats every reopening rule, uniform reopening included, as a decode-time repair operator (App. D, p. 17, ll. 897-900). No measured result depends on exactness.
The Introduction now distinguishes DiffROS from each work you named, within the page limit. DDBC completes partially observed, unordered bundles by masked diffusion over residual codes; HiGR plans a slate autoregressively and then beam-decodes each item, so its depth grows with slate size; GFN4Rec selects items one at a time from a candidate set; List-CVAE decodes a short slate in one pass and resolves each slot to a catalog item. DiffROS combines a request-conditioned canvas of positioned slots, residual identifiers decoded without a candidate pool, and depth that does not grow with slate size (Introduction, p. 2, ll. 65-74). We placed this discussion in the Introduction's literature review rather than a separate section to stay within ten pages.
We addressed the minor issues you raised. Section 4.3 now says that nDCG reflects arrangement through its rank weights (p. 8, l. 431); the beam comparison now refers to the internal corpus; Section 4.2 now gives the decode benchmark's batch size, precision and caching, and states that it times an untrained model on a synthetic catalogue, so it measures computational structure rather than deployment latency (p. 8, ll. 404-407); Figure 2's caption lists its configuration differences (p. 7, ll. 344-348); and, as Section 4.2 already states, the public benchmark is mixed at three items and a single-item soundness check at one (Table 2).
Please Note: page and line pointers in our first-round replies refer to the previous revision, available under Revisions; the latest revision adds one paragraph to Section 2, which moves later content down by about one page.
Thank you for the thorough review and for crediting the computational property and the duplicate-accounting check.
Separating ordering from selection (W1, Q1). Evaluated on units both decoders emit, the control you requested, DiffROS orders the two halves of the target better than beam on shared first-level codes. Both decoders are scored on the same pairs of shared units (target identifiers or first-level codes that both emit); on first-level codes, cross-half pair accuracy is about 0.10 higher with and without repair, with 95% intervals excluding zero, and at exact identifiers the comparison is inconclusive (Sec. 4.4, p. 9; App. G, Table G2, p. 20). Beam over one item serves as the pointwise scoring-and-ordering baseline, since it receives no slot input; the first-level advantage is consistent with slot-position conditioning, and we did not run a control that isolates cross-slot conditioning or evaluate duplicate-aware autoregressive ordering at thirty slots. Table 1's gaps are now described as within-decoder, and Appendix E no longer compares their magnitudes across decoders (Table 1 caption, p. 6; App. E, p. 18).
Practical comparison and full cost (W2, Q2). Against an autoregressive decoder with duplicate prevention, the baseline you asked for, DiffROS with repair keeps the lead across the full slate, and we report its added computation. It reaches 1.28× [1.26, 1.31] the recall@100 and 1.23× [1.22, 1.25] the hit@100 of masked autoregressive decoding with 12 instead of 300 sequential passes; the price is about 12× the position evaluations, since each pass processes the whole canvas, and the masked decoder leads at the top ten (Sec. 4.2, p. 7, ll. 370-377; p. 8, l. 397). Because the repaired margin persists against an autoregressive decoder that cannot repeat an identifier, the remaining lead does not rest on the original baseline's repetition. Decode time for the new configurations was not measured (App. G, p. 19, ll. 1010-1012). Section 4.1 now gives the split and training protocol, identical across decoders: one pass over the same training window, the final checkpoint, a held-out evaluation day, and no valid-ID constraint (Sec. 4.1, p. 6, ll. 290-294).