Industry papers keep coming in dense — 20+ of this week's 37 carry online results or production deployments. Three technical signals stand out. First, the bottleneck in generative recommendation has moved from "can we generate" to "are we generating the right thing." Second, re-ranking and blending are collapsing the whole pipeline into a single autoregressive decoder. Third, agentic recommendation is moving from tool-calling toward self-reflection and reward modeling. Generative recommendation: quantization error in semantic IDs and decoding drift are now the main battleground. Kuaishou's BRIDGE names the information gap between the RQ-VAE quantization process and the decoder the "semantic quantization gap." It closes three kinds of bias — grounding, neighborhood, and difficulty — with codebook-anchored latent reasoning, privileged EMA self-distillation, and depth-aware compute allocation. On three Amazon benchmarks, Recall@10 improves 10.9% on average; in Kuaishou's online A/B on ads, eCPM rises 0.65%. Meta's CAP-Mix takes the other path — skip hard quantization entirely. Items become a soft mixture of shared prototypes plus an item-specific vector. HR@5 beats a hard SID table with the same tokenizer by 4.45–14.90%, and inference throughput is 1.4–161× the discrete baseline. Both point the same way: SID discretization itself is becoming the SNR ceiling for generative retrieval. Re-ranking and blending: from hand-tuned rules to end-to-end generation. ByteDance's OneTrans-GSR unifies re-ranking and blending in a single decoder-only Transformer. A reward model scores the full exposure list to guide RL. Online: GMV/u +2.63%, advertiser value +2.06%, repurchase rate +2.03% — and end-to-end latency drops 13%. Taobao's ICE attacks the evaluator instead. It argues that conventional "independent behavior modeling" compresses a continuous browsing journey into per-item CTR predictions, which introduces systematic bias. ICE explicitly models the causal chain of impression →
Recommendation systems research this week splits along a clear line: generative recommendation is shifting from "can it generate?" to "is generating worth the cost?", while improvements to conventional ranking architectures converge on granularity alignment for heterogeneous signals. Thread 1: Generative retrieval is starting to dismantle its own cost structure. The standard autoregressive interface pays for SID length twice — history enters the backbone as T×K code tokens, and every beam search step runs through the backbone again. Pinterest's PinGER uses an asymmetric attention mask to compress input to one token per item, delivering +3.60% fresh Pins saves and -0.7% end-to-end latency in serving. On the academic side, Deco delegates the entire beam search to a lightweight KV-cached decoder, achieving 3.2–8.6× throughput gains within a 50 ms p95 budget. Octen-WebGR packs 201 million web pages into 4B model parameters, runs on a single GPU with 10 GB memory, and hits 59.6% top-1 on navigational queries versus 46.5% for dense retrieval. All three point to the same conclusion — the bottleneck in generative retrieval has moved from model capacity to serving cost. Thread 2: Multi-objective and fine-ranking are shifting from "compute more steps" to "compute in the right places." Kuaishou's Refiner introduces latent reasoning into ID-based ranking via cumulative additive correction. Alibaba's KL-MOPD finds that teacher difficulty in multi-objective on-policy distillation varies across tokens, allocates weights by initial KL divergence, and proves strict superiority over vanilla MOPD under an additive joint objective. Both point to the same thing: the extra compute in generative ranking must be precisely targeted where it's needed. Thread 3: Granularity alignment in ranking architectures. Alibaba's HiRank shows that sequential and non-sequential signals have different effective ranks, and that homogeneous self-attention is inefficient on such heterogeneous inputs — online