cd /news/machine-learning/off-policy-evaluation-for-semantic-i… · home topics machine-learning article
[ARTICLE · art-117334] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=· neutral

Off-Policy Evaluation for Semantic ID Recommenders: Does the Model's Own Code Hierarchy Help?

A new arXiv paper (2608.28905v1) finds that off-policy evaluation (OPE) for semantic ID recommenders can be made feasible by using the model's own code hierarchy as an action abstraction, but the benefit comes from coarsening rather than the hierarchy itself. The authors show that per-item OPE is hopeless on production logs due to small effective sample sizes, while marginalizing items to code-prefix clusters restores estimable support and reduces error, with resolution depth as the key control and a conditional bias bound linking coarsening bias to the quantizer's reconstruction residual and target-logging divergence.

read1 min views2 publishedSep 1, 2026

arXiv:2608.28905v1 Announce Type: new Abstract: Generative recommenders increasingly emit semantic IDs (SIDs): each item is a short sequence of hierarchical discrete codes from a residual quantizer, decoded autoregressively. Before spending scarce A/B-test, a team may decide offline which decoder or reranking variants are worth testing - a job for off-policy evaluation (OPE). We ask a simple question: can the model's own SID tree serve as the action abstraction for that OPE? Our answer has three parts. (i) Under the near-argmax logging real recommenders use, per-item OPE is hopeless - as item-level effective sample size is usually small on production logs - but marginalizing items to code-prefix clusters restores estimable support and cuts error. (ii) This gain is thanks to coarsening, not to the hierarchy specifically; but the SID tree is what makes coarsening feasible in a generative system - each cluster's mass is exactly and cheaply returned by the decoder, whereas flat clustering requires enumerating item/leaf masses that a code-only decoder does not directly expose. (iii) Resolution depth is the operative knob - coarser under scarce support - and a conditional bias bound links the coarsening bias to the quantizer's worst-case reconstruction residual and the target-logging divergence.

── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/off-policy-evaluatio…] indexed:0 read:1min 2026-09-01 ·