EPIC: Explicit Posterior Item Conditioning for Semantic ID Diffusion Recommendation
Tuan-Binh Tran, Thanh Tam Nguyen, Quoc Viet Hung Nguyen, Dung D. Le, Tung Kieu, Thanh Trung Huynh
cs.IR, cs.LG
2026-09-03
EPIC scores the feasible candidate set at every denoising step of masked semantic ID generation and feeds the item posterior back into token logits. It wins all 16 dataset-metric combinations on four Amazon benchmarks with a 34% latency overhead.
Masked diffusion improved how semantic IDs are generated: bidirectional context, confidence-driven position resolution, parallel decoding. The decision interface is still token-level, though, while the thing being recommended is a complete catalog item. A partial SID already contracts the catalog to a feasible candidate set, and every token commitment doubles as an item-level elimination. A locally plausible code can eject the best item from the feasible set, after which no amount of post-hoc reranking can recover it.
EPIC injects explicit item-level competition into the denoising loop. At each step, the frozen diffusion backbone supplies token evidence, and token likelihood retains at most M feasible candidates. Likelihood builds the support but is deliberately kept out of the ranking energy; folding it in hurt in ablation. A shared encoder maps candidates and recent history items into one SID-tuple space, attention selects which recent interactions matter at the current state, and agreement and difference features against each produce candidate-specific transition evidence. The normalized item posterior is marginalized onto unresolved SID positions and fused with backbone logits as a clipped log-probability residual behind an ambiguity-aware gate. The whole module is zero-initialized, so the initial model is exactly the backbone.
Only a 0.39M-parameter adapter trains; the backbone stays frozen. Direct item supervision is restricted to frontier states where between 2 and M candidates genuinely compete.
EPIC wins all 16 dataset-metric combinations across four Amazon categories, with gains of 1.2-16.8% over the second-best, concentrated in NDCG: +16.8% N@5 on Toys, +14.1% N@10. All survive Holm correction at p<0.05.
The mechanism evidence is stronger than the main table. The same scorer applied inline during denoising versus post-hoc after generation differs by 15.7-26.8% NDCG@5. Following target trajectories, inline recovers 154/231/253 more top-5 hits than it loses across the three datasets, and in 25/48/49 recovered cases the target was absent from the control pool, unreachable by any reranker. Swapping in another user's history costs 12.4-17.9%; merely reversing temporal order costs 1.5-4.1%.
| Item | LLaDA-Rec | EPIC | Change |
| Adapter params | 6.847M | 0.391M | -94.3% |
| Latency (ms/user) | 93.0 | 124.8 | +34.2% |
This is a direct answer to the debate over whether token-level interfaces suffice for generative recommendation. SimGR abandons generation for direct item scoring, Gryphon reranks after generation, ISD fixes a ranking before generation. EPIC shows the profitable intervention point is inside denoising, while candidates still compete and remain reachable. The frozen-backbone-plus-adapter shape means it can wrap any masked-diffusion recommender, and the pattern of comparing complete candidates over a contracting feasible set is not recommendation-specific.
Feasible-set computation is an exact catalog scan at O(|I|·H); the authors flag inverted indexes or approximate candidate construction as future work. When truncation cuts the support below the full feasible set, the posterior covers only the retained items; supervision dodges this by restricting to complete-set states, but the inference-time truncation bias is not fully removed. Items sharing one SID are not disambiguated. Benchmarks are four mid-sized categories (12K-25K items) with a 256-dim, 8K-step research configuration, so industrial behavior is untested. The 34% latency overhead is real money in some online settings.