type
Post
status
Published
date
Oct 24, 2026 05:31
slug
rec-weekly-en-2026-W43
summary
This week's recommender systems research clusters around three technical threads: semantic IDs for generative recommendation are shifting from "build them well" to "keep them maintainable," long-sequence ranking is rebalancing the trade-off between effectiveness and compute, and agent systems are treating evaluation, monitoring, and cost governance as first-class citizens. Thread 1: Semantic IDs enter the operations phase — the core problem moves from encoding to temporal stability and decoding-time personalization. Kuaishou's OneLatent (online ad revenue +9.6%, inference throughput up over 17×) compresses explicit CoT into latent tokens. Alibaba/Tmall's SID topology preservation quantifies on 67 days of logs that mapping updates drop HitRate by 41.78%–62.05%, ending at online GMV +1.16%. Youku's SPAR uses prefix-balanced RQ-PIB to cut the largest sub-branch's traffic share by 32.84%, with online watch time +3.95%. The common thread: the value of a semantic ID is no longer set by codebook quality alone. It depends on how the codebook handles drift over time and how user evidence is injected at each decoding layer. Thread 2: The compute bill for long-sequence ranking is now on the table. Kuaishou's ECHO cuts online sequence-branch FLOPs by roughly 160× at 100K sequence length, improves offline GAUC by 0.113%–1.520%, and lifts online app usage time by +0.613%. Meta's Predictable Scaling uses scaling-law prediction to cut full training of candidate hypotheses to 79%–88% compute savings while keeping hypothesis rankings correct. Both answer the same question — how much further can you push longer sequences and bigger models by throwing compute at them. Thread 3: Evaluation, attribution, and monitoring for agent recommendation become standalone engineering problems. Alibaba's UserArena builds an interactive benchmark from 64,729 real session trajectories that can be validated against production A/B. Adobe's LARA identifies three attribution gaps in agentic retrieval — wh
tags
Recommendation Systems
Weekly
Papers
category
Rec Tech Report
icon
📚
password
priority
1
Weekly Overview
This week's recommender systems research clusters around three technical threads: semantic IDs for generative recommendation are shifting from "build them well" to "keep them maintainable," long-sequence ranking is rebalancing the trade-off between effectiveness and compute, and agent systems are treating evaluation, monitoring, and cost governance as first-class citizens.
Thread 1: Semantic IDs enter the operations phase — the core problem moves from encoding to temporal stability and decoding-time personalization. Kuaishou's OneLatent (online ad revenue +9.6%, inference throughput up over 17×) compresses explicit CoT into latent tokens. Alibaba/Tmall's SID topology preservation quantifies on 67 days of logs that mapping updates drop HitRate by 41.78%–62.05%, ending at online GMV +1.16%. Youku's SPAR uses prefix-balanced RQ-PIB to cut the largest sub-branch's traffic share by 32.84%, with online watch time +3.95%. The common thread: the value of a semantic ID is no longer set by codebook quality alone. It depends on how the codebook handles drift over time and how user evidence is injected at each decoding layer.
Thread 2: The compute bill for long-sequence ranking is now on the table. Kuaishou's ECHO cuts online sequence-branch FLOPs by roughly 160× at 100K sequence length, improves offline GAUC by 0.113%–1.520%, and lifts online app usage time by +0.613%. Meta's Predictable Scaling uses scaling-law prediction to cut full training of candidate hypotheses to 79%–88% compute savings while keeping hypothesis rankings correct. Both answer the same question — how much further can you push longer sequences and bigger models by throwing compute at them.
Thread 3: Evaluation, attribution, and monitoring for agent recommendation become standalone engineering problems. Alibaba's UserArena builds an interactive benchmark from 64,729 real session trajectories that can be validated against production A/B. Adobe's LARA identifies three attribution gaps in agentic retrieval — who reads the results, when they act, and whether to attribute to retrieval or model knowledge — with chat users rewriting at 44.4% versus 33.1% for gallery users. MOSS at a large US retailer embeds LLM relevance scoring into loop monitoring; six months of deployment surfaced two live defects, one of which saw a 76.4% relative drop in alert rate after the fix. Evaluation is no longer a leaderboard — it's a continuously running production pipeline.
Generative Recommendation and Semantic ID Engineering
The most substantive progress in generative recommendation this week isn't in model architecture — it's in how to maintain semantic IDs over time. Once SIDs go from one-off offline artifacts to in-service assets that need periodic remapping, stability and decoding-time user evidence injection become the two variables that determine online gains.
OneLatent (Kuaishou) — The core idea is to compress explicit CoT reasoning into a handful of learnable latent tokens, letting a foundation recommendation model (FRM) take an "implicit reasoning, then answer" path. The method has three stages: Multi-View Adaptive CoT (MV-ACoT) first generates high-quality teacher supervision from multiple views and adaptively adjusts each sample's reasoning complexity; then three-stage latent-token alignment on a pretrained FRM progressively internalizes the CoT trajectories; finally, curriculum-style post-training activates latent reasoning. The numbers are hard: SID@64 improves 17.44% and 9.33% over the Think and No-Think variants respectively, with online inference throughput up over 17×. This "compress reasoning into latents" approach extends the line of SCoTER, which used structured CoT transfer to improve generative recommendation — but SCoTER structures and integrates reasoning trajectories, while OneLatent compresses them into latent tokens. The former lifts offline scores; the latter directly trades for inference throughput. Online A/B in Kuaishou's local-life ads scenario records a 9.6% revenue lift over strong baselines like OneRec and OneReason, backed by a production-grade real-time FRM inference service. For industrial deployment, "latent reasoning + three-stage alignment" is closer to an operable form than "generate the full CoT every time."
SPAR (Alibaba/Youku) — Pushes generative retrieval granularity from "decode the whole sequence at once" to "look at user evidence at every decoding step." The PATH Decoder retrieves prefix-relevant evidence from compressed long-term user memory, guiding each token decision alongside recent behavior, user profile, and event context. RQ-PIB addresses a specific pathology: uneven historical interaction load across candidate branches biases decoding toward popular paths. It balances sibling branches at the prefix level while preserving semantic structure. Numbers: on large-scale Youku production data, average relative HitRate improves 2.66% over the strongest baseline, target prefix retention rises 5.79 percentage points, and the traffic-weighted largest sub-branch share drops 32.84% across SID levels. A 7-day online A/B serving 10% of Youku traffic yields +3.95% per-user watch time and +3.38% play conversion rate. The method builds on the RQ-VAE and TIGER generative retrieval paradigm, but turns "uneven branch load" — a long-standing problem in generative retrieval — into an explicit quantitative metric. Unlike DualGR, which uses a dual-branch router to separate long- and short-term interest, SPAR's split dimension is "which decoding layer, what prefix" — closer to the structure of hierarchical SIDs.
SID Topology Preservation (Alibaba/Tmall) — This isn't a new model; it's a report that turns "semantic ID updates" into a quantifiable engineering problem. The authors run controlled experiments on 67 days of Tmall e-commerce search logs and reach three conclusions. First, retrieval degradation from SID semantic drift is masked by large beam sizes — at beam size 1, mapping updates drop HitRate by 41.78%–62.05%; at beam size 1000, only 8.33%–10.85%. Redundant candidate generation hides the true severity of drift. Second, the proportion of changed SIDs is strictly monotonic with retrieval quality — going from 0% to 72.75% drops HitRate by up to 42.66%, and full remapping is clearly worse than preservation even with warm-start training. Third, the topology-preservation principle makes even the simplest warm-start strategy effective: freeze old-item SIDs, insert new items, warm-start from the previous model version — old-item HitRate +10%, new-item HitRate +109%. Three weeks of online Tmall A/B yields UCTCVR +0.29% and GMV +1.16%. The conclusion condenses into one deployment principle: insert new items, freeze old items; warm-start if you can, freeze if you can't; never change SIDs the model has already learned. This principle is orthogonal to S²GR's stepwise semantic reasoning in latent space — one handles "how new items enter," the other handles "how decoding thinks."
AGR (Kuaishou) — Puts agentic tool-use into the decoding process of generative retrieval. Traditional static feature injection either encodes all signals or places them by a preset scheme — high serving cost and conflicting evidence. AGR makes three decisions during layer-by-layer SID decoding: whether to call a tool, which feature to call, and which decoding layer the observation affects. Supervision comes from tool-augmented trajectories constructed by feature applicability and information gain, trained in two stages: SID pretraining and tool-augmented fine-tuning. Industrial datasets, three public benchmarks, and online A/B all show consistent gains, though the abstract gives no specific numbers. This line is complementary to Gryphon, which jointly trains item-level scoring components in generative recommendation to resolve the mismatch between SID sequence likelihood and relevance objectives — Gryphon treats "scoring objective misalignment," AGR treats "when features enter."
ReRankID — Asks a question that hadn't been systematically tested: can a reasoning re-ranker still rank well using only SIDs, with no item text? The answer is half yes, half no. The ReRankID testbed renders both history and candidate lists as SIDs only, varying item rendering, history length, and candidate list size. It finds models often copy the input order rather than re-rank, and readable metadata doesn't fix this failure. The authors compare four post-training methods (SFT, rejection-sampling self-training, on-policy distillation, verifier-based RL), all of which "elicit" ranking behavior. The strongest is an 8B model with graded ranking rewards, matching a strong text LLM (whose prompts are ~20× longer) on SID-only ranking, beating random even with no history (a caption-reading reference cannot), and holding gains under long histories where text prompts exceed 50k tokens. But paired rationale audits show it argues trade-offs better than the reference while describing items less accurately. This extends CELA's approach of integrating text features in CTR prediction — but with the opposite conclusion: text isn't irreplaceable. SIDs already carry behavioral signal; what's missing is eliciting the "ranking" capability through post-training.
Long-Sequence and Scaling Optimization for Ranking Models
Long-sequence ranking is going through a cost re-evaluation: at 100K sequence length, end-to-end target attention is no longer affordable, and cascaded retrieval, distilled selection, and scaling-law prediction have emerged as three independently viable cost-reduction paths.
ECHO (Kuaishou) — The core tension in target-aware ranking at 100K sequences: retrieval-based methods have candidate relevance costs that grow with sequence length, while latent compression methods lose item-level addressability. ECHO takes the middle path: keep a portion of raw event records per user, use a Distilled Selector (DS) to do per-target distillation from a candidate-aware full-history teacher, achieving user-level target-aware selection; then use a Target-aware Fine-grained Retriever (TFR) for candidate-level fine-grained retrieval. The key is that TFR and the target-attention scorer share relevance parameters learned from the teacher, ensuring consistent relevance estimation across cascade stages. At L=100K, online sequence-branch FLOPs drop roughly 160× versus representative end-to-end models. Three deployment optimizations (shared user input, compact record encoding, key-side projection absorption) further cut memory, storage, and data movement overhead. On KuaiRand-1K and an industrial short-video platform, multi-task GAUC improves 0.113%–1.520% relative, with online A/B app usage time +0.613%. This cascaded distillation approach follows the decompose-and-distill paradigm of LLM distillation for long-context ranking, but ECHO solves "record-level selection within a sequence," while the latter solves "resume-job dual long-text decomposition."
FineSID (Alibaba/Taobao Search) — A progressive learning framework that chains content tokenization, query-item semantic pretraining, and personalized post-training onto a single fine-grained discrete representation. Stage one uses a pretrained multi-scale visual tokenizer and text tokenizer to convert heterogeneous content into fine-grained semantic IDs, explicitly aligning ID features. Stage two does full-parameter semantic pretraining under query-item relevance supervision to establish a matching prior, jointly optimizing in a shared predictor over multimodal SIDs and traditional fields. Stage three directly fine-tunes this initialized predictor with user click supervision to capture implicit personalized preferences. Offline and online evaluations both show notable CTR and core business metric gains, though the abstract gives no specific numbers; another observation is improved creative discrimination within the same product, indicating semantic generalization beyond traditional ID memorization. This differs from Gryphon's approach to "relevance objective vs. sequence likelihood mismatch" — FineSID writes the relevance objective directly into the pretraining stage, so SIDs carry a matching prior from the moment they're generated.
Instagram Feed Three-Way Debiasing (Meta) — Reparameterizes the debiasing problem. Every value model prediction decomposes into a baseline (what this user/item/request would have produced anyway) and an incremental part (how much the candidate exceeds the baseline). Most of the literature subtracts the baseline and keeps only the increment. The authors argue the reverse: keep the raw prediction and add the increment as a separately weighted term. Three types of debiasing previously shipped independently on Instagram Feed (user habit, item popularity, request context) are unified into one parameterized operator s(c)=Σw_r·p + w_i·Δ, with a single design process selecting points in the operator. Media-type bias goes through the same process to select debiasing labels. In a four-arm ablation (neither term, each term alone, both), under production weights the two-term form wins on point estimates in 11 of 13 (term, metric) pairs; of 26 direct comparisons, 17 are significantly positive and only 1 (impressions) significantly negative. This operator has been in production on Instagram Feed for nearly a year and rolled out across Meta's family of apps and two ranking stages, driving sessions and DAU. This extends the line of Factorized Transport — using lightweight operators to unify multi-view representations — but in the debiasing setting, "keep the baseline and independently weight the increment" is a clear engineering judgment, not a structural innovation.
Predictable Scaling — Full training of candidate hypotheses burns thousands of GPU hours, which caps the hypothesis space you can explore. PS uses scaling-law prediction to forecast full-scale performance from scaled-down proxies: construct scaled variants along different resource axes with composable scaling functions, then fit curves and project calibrated uncertainty to the target scale. Three prediction strategies increase in expressiveness: the simplest raw proxy already pushes prediction error to the noise floor of repeated-run variance, and the strongest Gaussian process gives an indicative 15% relative MAE improvement with calibrated uncertainty. Validated on two ranking models of increasing complexity (a task-specific model and a foundation model), it cuts training compute by 79%–88% while keeping hypothesis rankings correct. This line sits at a different level of cost reduction from Climber's efficient scaling of training on heterogeneous resources and MTGR's large-scale deployment of generative recommendation at Meituan — one saves "unnecessary full training," one saves "how to do necessary training fast," one saves "post-deployment engineering cost."
Evaluation and Production Monitoring for Agent Recommendation
A reality of agent systems: the premises of traditional CTR, MRR, and NDCG — that users see ranked results and act on them — no longer hold in architectures where the generative layer consumes retrieval results first. This week brought several engineering solutions aimed at this gap.
UserArena (Alibaba) — A real e-commerce interactive benchmark with 64,729 session trajectories, 11,010 users, 566,102 items, and 13 action types, paired with an interactive environment and support for offline validation against controlled production A/B results. Evaluation has five levels: output validity, local decisions, sequential behavior, personalization, and final outcomes. Methodologically it proposes On-Policy Trajectory Distillation (OPTD), using trajectory-level intent to provide dense teacher targets for student rollouts, achieving the strongest overall fidelity under the evaluation protocol and coming closest to reproducing production policy effects. This "offline against online" design requires real production A/B to calibrate, and is methodologically akin to Walmart sponsored search's approach of training a dual-tower retriever with unified supervision combining semantic relevance and behavioral engagement — both use online signals to validate the fidelity of offline proxies.
LARA (Adobe) — Breaks the attribution problem in agentic retrieval into three layers: retrieval quality, engagement and outcomes, and product success, connected by a four-field lineage schema with no new modeling required. The motivation comes from an observation at Adobe Express: the same retrieval infrastructure serves both gallery search and the agentic assistant, with the latter at roughly 1/8 the session volume of the former (same user population). Chat users rewrite at 44.4% versus 33.1% for gallery users — chat rewrites refine generated output. The attribution gap shows up three ways: who reads (the agent reads results before the user), when (user actions may occur several turns or sessions after retrieval), and whom to credit (results mix retrieved content with the model's own knowledge). This aligns with ReRec's reinforcement fine-tuning for reasoning-enhanced recommendation in its goal — both try to recover interpretable intermediate signals under generative architectures — except LARA is a pure evaluation framework and ReRec is a training-side modification.
MOSS (large US retailer) — Embeds LLM relevance scoring into loop monitoring: targeted sampling, policy-aware prompting, structured alerting, and diagnostic follow-up prompts that classify failures into actionable root causes. Deployed for over six months at a large retailer across recommendation, search, and offers, it surfaced two confirmed live serving defects. For one backfill-mixing defect, MOSS offline quantified the fix as a 76.4% relative drop in alert rate. On 498 human-labeled recommendation pairs, the frontier LLM judge's F1 and AUC point estimates both exceed non-LLM baselines (internal production embeddings and SBERT), with the largest gains on policy-dependent tasks. The same judge, same score scale, and same threshold transfer to a 466-pair, 21-query search benchmark with only facet-specific prompt adaptation, no retuning. This is structurally similar to QPP query variant selection's handling of "utility gap between retrieval and generation targets" — both ask what signal actually reflects true downstream quality.
Explicit Feedback Contract — The common loop for iterative ML agents: change code, run experiments, check validation score, decide next step. Current harnesses return exact validation scores every time, exposing the validation set to adaptive selection. The authors propose a feedback contract: release the validation score only when a submission crosses a noise threshold computed from paired standard errors, with no margin to tune. Experiments on CTR prediction, LTR, and a no-signal control task. The control task is the sharpest — true gain is zero by construction, yet an agent reading exact scores ends up reporting +0.0157, while under the contract it reports only +0.0033. On both real tasks the contract narrows the validation-test gap, with test performance slightly higher rather than lower. The biggest difference is when to stop: exact feedback exhausts the 30-submission budget on both tasks (including the no-signal one), while the contract stops at 4–12. A run that exhausts its budget is usually read as diligence; the authors suggest reading it as a symptom — when the feedback channel is unbounded, noise keeps supplying "improvements" to chase. This work doesn't map directly onto a prior method, but it shares engineering philosophy with xGR and other serving systems' focus on "early stopping and budget control": when resources are limited, the granularity of control determines how trustworthy the results are.
Agent Tools, Memory, and Reinforcement Learning
Another layer of agent systems that keeps getting refined is "infrastructure": how tools are retrieved, how memory is gated, how RL training allocates credit. This week's papers fill in the parts that model-capability narratives have overshadowed.
Tool Recommendation (Arcade.dev) — Multi-step agent tasks fail if even one tool is missing, but there are too many tools to list: the platform studied has about 8,200 tools, whose combined definitions exceed the context window of any evaluated model. The system exposes all tools to the agent through three fixed tool interfaces — SelectTools/UseTool/ListApps (about 1.76M tokens, hundreds of times more than a typical MCP server) — running as a gateway between agent and tools, executing every call with the end user's own credentials and validating against the user's consent for each service and the tools available to the agent. On ToolRet, the proportion of queries with all required tools in the top ten is 57% higher than BM25, competitive with published systems up to nine times its size. In paired multi-step workflows, first-recommendation coverage of all required tools holds in 93% of Codex sessions; versus a fixed 100-tool list, input tokens drop 17% in Codex and 40% in Claude Code, with total billing down across all 14 runs, by up to 40%, and no change in task completion rate. This is the same class of problem as Adaptive Re-Ranking's utility-function query routing, which achieves 1.15–53× median latency on IR datasets — tool retrieval is fundamentally a "too many candidates, too expensive to call" retrieval-routing problem, except the tool setting has higher requirements for permissions and consent.
MAPS (Kuaishou Ads) — Most existing video ads use a retrieval paradigm where candidate creatives are pre-made, limiting personalization granularity and causing large performance variance across user segments. MAPS switches to script-driven generation: four collaborating agents form a closed-loop pipeline (user profile modeling, script generation, video synthesis, feedback-driven iteration), with the core Scripter Agent trained in an RL framework with multi-dimensional rewards, guiding scripts to align with both user content preferences and target product information. Online A/B versus a generative baseline yields CTR +2.87%, CVR +2.74%, and ARPU +9.85%. This multi-agent + RL reward-shaping approach follows Aligning LLMs for Controllable Recommendations's two-stage SL+RL alignment of LLM instruction following — both use "pretrained model + custom reward" to steer general capabilities toward recommendation objectives. MAPS differs in that the reward must manage both content preference and product information dimensions.
GCA — Outcome-reward RL gives every token in a rollout the same advantage, but a single search rollout actually trains two capabilities: finding evidence and using it well. The authors first present the evidence gap: Search-R1 improves accuracy on all seven QA benchmarks, but on Bamboogle the proportion of correct answers backed by evidence drops from 84.0% to 42.9%. The root cause is GRPO's credit assignment — rollouts that retrieve answer-bearing evidence only get preference according to their relative gain in overall accuracy, and answering from memory or misusing evidence shrinks or even reverses that gap. GCA uses two verifiable sub-outcomes (evidence retrieval, answer correctness) to separately correct credit for searching and answering: wrong answers are penalized more than "searches that found evidence," and correct answers that bypass retrievable evidence are rewarded less. The correction never goes negative for evidence finding and is capped at 10% of each token's advantage, so it doesn't override the outcome signal. With no extra models, rollouts, or training stages, average EM improves 5.7 points (Qwen2.5-3B) and 6.3 points (Qwen3-30B-A3B) over Search-R1, with evidence support rate rising from 76.9% to 93.4%. This is the same class of problem as ITPO's derivation of turn-level process rewards from sparse outcome signals — both treat "outcome reward isn't granular enough" — but ITPO uses implicit process rewards while GCA uses verifiable sub-outcomes with a 10% hard cap guaranteeing it never overrides the main signal.
Memory Gating — Long-term memory lets LLM agents personalize subsequent interactions, but a finite memory store can't keep every extracted fact. Existing memory gating policies are usually shared across users, ignoring user-specific future reuse patterns. The authors gate at the fact level: first use a retrieval-based labeling policy to tag each fact (whether it's later retrieved and incorporated into a reply), then formalize online memory gating as contextual apple tasting with delayed one-sided feedback, proposing Warm-Start UCB that combines offline learning with online adaptation. The theory gives a high-probability regret upper bound of Õ(Tε ∧ d√T) when the delay window is ≤ O(√T). Experiments across memory budgets and history lengths outperform all baselines. This line shares a theoretical toolchain with Design Experiments's Artificial Replay for comparing bandit algorithms and RAW-UCB's near-optimal regret in rested/restless rotting bandits — translating "what should be remembered" into "when to explore," at the cost of delayed feedback.
Multimodal Retrieval and Embedding Deployment
Two works in multimodal retrieval this week both answer "how to build big models within a compute budget": one uses asymmetric deployment to decouple indexing from querying, the other puts preference learning into the retrieval objective.
PAIR (LinkedIn) — Relevance on a professional network is complementary rather than symmetric (a job seeker is more likely to interact with a recruiter than with a peer of similar background), so generic profile-similarity embeddings rank the wrong things here. PAIR instantiates the DPO preference-learning view as an exposure-conditioned multi-negative contrastive objective that scales to large candidate sets without a reference model. It aggregates click history with positional encoding, achieving constant-cost user representation updates — new interactions don't require re-encoding history, and serving-time personalization updates run as lightweight CPU operations without repeated LLM inference. A 0.6B model reaches MAR@100 of 0.45 on LinkedIn Premium retrieval tasks, with online A/B lifting CTR and Premium retention and no latency regression (specific numbers undisclosed). This aligns in motivation with CELA's three-stage paradigm integrating text features and language models while preserving ID-model collaborative filtering capability — both solve "generic embeddings don't understand business semantics," and PAIR's solution is to write preference, not similarity, into the contrastive objective.
pplx-embed-v2-late (Perplexity AI) — Two multilingual multimodal late-interaction models at 0.6B and 9B, with representation-level distillation from an 18B teacher and a shared embedding space supporting asymmetric deployment: 9B for indexing, 0.6B for querying. SOTA within each size class on text, image, and visual document retrieval benchmarks, with 0.6B visual document retrieval on ViDoRe-V3 competitive with models several times larger. This asymmetric late-interaction deployment extends the line of Col-Bandit, which uses zero-shot query-time pruning to cut MaxSim FLOPs by up to 5× while preserving ranking fidelity, and TileMaxSim, which uses IO-aware kernels to hit 80.2% peak bandwidth on H100 — all three treat late-interaction compute overhead, just from different entry points: "query-time pruning," "kernel-level optimization," and "big model for indexing, small model for querying."
Directions to Watch
Semantic ID lifecycle management will become a standalone engineering topic. The three numbers from Tmall's SID topology preservation are a clear signal: mapping updates drop HitRate by 41.78%–62.05% at beam size 1, change proportion is strictly monotonic with retrieval quality, and warm-starting lifts new-item HitRate by 109%. These conclusions currently stop at the deployment-principle level of "insert new items, freeze old items," with no accompanying theoretical characterization — how fast new items can be injected, how long the freeze window should be, and under what conditions warm-starting fails all lack a predictive model. Kuaishou's AGR fetching features on demand during decoding and OneLatent compressing reasoning cost into latents sit in the same problem space. The next contribution with real value may be "a predictable characterization of semantic ID drift" — like Predictable Scaling's scaling laws, but for the codebook's degradation curve over time.
The cost-effectiveness frontier of long-sequence ranking is being compressed simultaneously by cascaded distillation and scaling-law prediction. Kuaishou's ECHO uses DS+TFR to cut sequence-branch FLOPs by 160× at 100K sequences, with online app usage time +0.613%; Meta's Predictable Scaling uses scaling laws to cut full training for hypothesis exploration to 79%–88% compute savings. The two paths converge on the same question — "how big a model / how long a sequence is worth training." If scaling-law prediction can also forecast "the gain of an architecture change at 100K sequences" from proxy scale, the cost of model exploration drops another order of magnitude. The drivers are Kuaishou and Meta.
Evaluation, attribution, and monitoring for agent systems will form a specification akin to traditional recommender offline evaluation within the next year. UserArena provides an interactive benchmark validatable against production A/B, LARA defines a five-layer attribution schema for agentic retrieval, MOSS demonstrates how LLM relevance scoring can run continuously in production for six months and surface real defects, and the explicit feedback contract gives a noise-threshold specification for agent iteration loops. Together these four form infrastructure for "can it go to production, and how do we know when it breaks." What's still missing is cross-vendor alignment of evaluation protocols — LARA's four-field lineage schema, UserArena's five-level evaluation, and MOSS's structured alerting are each independent and not yet connected. Whoever standardizes this protocol first becomes the de facto interface for agentic recommendation evaluation.
Paper Roundup
Generative Recommendation and Semantic ID Engineering
OneLatent — Kuaishou proposes a latent reasoning framework compressing explicit CoT into learnable latent tokens; SID@64 improves 17.44%/9.33% over Think/No-Think variants, inference throughput up over 17×, online local-life ads revenue +9.6%.
SPAR — Youku proposes a prefix-aware personalized adaptive tree decoder and RQ-PIB prefix-balanced SID construction; online watch time +3.95%, play conversion rate +3.38%.
SID Topology Preservation — Alibaba/Tmall systematically quantifies the semantic drift harm of SID mapping updates and proposes the "insert new items, freeze old items, warm-start" principle; online GMV +1.16%, UCTCVR +0.29%.
AGR — Kuaishou introduces agentic tool-use into generative retrieval, fetching features on demand during layer-by-layer SID decoding; consistent gains on industrial datasets, three public benchmarks, and online A/B.
ReRankID — Builds a SID-only reasoning re-ranking testbed, finding models tend to copy input order; four post-training methods elicit ranking behavior; an 8B model with graded ranking rewards matches a strong text LLM (with ~20× longer prompts) on SID-only ranking.
Long-Sequence and Scaling Optimization for Ranking Models
ECHO — Kuaishou proposes a distilled selector + target-aware fine-grained retrieval cascade framework; sequence-branch FLOPs drop ~160× at 100K sequences, online app usage time +0.613%.
FineSID — Alibaba/Taobao proposes a progressive framework of content tokenization → semantic pretraining → personalized post-training; notable CTR and core business metric gains, plus improved creative discrimination within the same product.
Instagram Three-Way Debiasing — Meta unifies user/item/request debiasing into a parameterized operator (keep raw prediction + independently weight the increment); 17 of 26 comparisons in the four-arm ablation significantly positive, in production on Instagram Feed for nearly a year and rolled out across Meta's family of apps.
Predictable Scaling — Uses scaling laws to predict full-scale model performance from scaled-down proxies, cutting training compute by 79%–88% while keeping hypothesis rankings correct.
Evaluation and Production Monitoring for Agent Recommendation
UserArena — Alibaba builds a real e-commerce interactive benchmark (64,729 session trajectories, 11,010 users, 566,102 items, 13 action types) and the OPTD distillation method, supporting offline validation against production A/B.
LARA — Adobe proposes a five-layer attribution framework and four-field lineage schema for agentic retrieval; on Adobe Express, chat users rewrite at 44.4% versus 33.1% for gallery users.
MOSS — A large US retailer embeds LLM relevance scoring into loop monitoring; six months of deployment surfaces two live defects, with the backfill fix yielding a 76.4% relative drop in alert rate.
Explicit Feedback Contract — Proposes a feedback contract based on paired-standard-error noise thresholds; on the control task, reported gain drops from 0.0157 to 0.0033, and stopping rounds drop from 30 to 4–12.
Agent Tools, Memory, and Reinforcement Learning
Tool Recommendation — Arcade.dev deploys a three-tool-interface gateway system exposing 8,200 tools; ToolRet top-10 full coverage 57% higher than BM25, paired-session tokens down 17%/40%, billing down up to 40%.
MAPS — Kuaishou proposes a multi-agent script-driven video ad generation system with an RL-trained Scripter Agent; online CTR +2.87%, CVR +2.74%, ARPU +9.85%.
GCA — Uses two verifiable sub-outcomes (evidence retrieval and answer correctness) to separately correct search and answer credit; average EM improves 5.7/6.3 points over Search-R1 on Qwen2.5-3B/Qwen3-30B-A3B, evidence support rate rising from 76.9% to 93.4%.
Memory Gating — Models personalized memory gating as contextual apple tasting with delayed one-sided feedback, proposes Warm-Start UCB, and gives a regret upper bound of Õ(Tε ∧ d√T).
Multimodal Retrieval and Embedding Deployment
PAIR — LinkedIn instantiates DPO preference learning as an exposure-conditioned multi-negative contrastive objective, with positional-encoding aggregation of click history for constant-cost user updates; 0.6B model MAR@100 of 0.45, online CTR and Premium retention up with no latency regression.
pplx-embed-v2-late — Perplexity AI releases 0.6B/9B multilingual multimodal late-interaction models with 18B teacher representation-level distillation for asymmetric deployment; SOTA within size class on ViDoRe-V3 and other benchmarks, 0.6B visual document retrieval rivaling models several times larger.