Generative retrieval and reasoning-based recommendation¶
简体中文 · English
Search, ads, and recommendation / 248 questions · 62 papers
Try answering each question before opening the explanation. The bank grows as papers and questions are added.
Read this topic's comparisons, analysis, and cross-paper Q&A
248 questions · 62 papers
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why treat suggested queries as a set rather than independent strings?
AIGQ: An End-to-End Hybrid Generative Architecture for E-commerce Query Recommendation
Show answer and example
Answer: A group defines exploration coverage. Per-item plausibility can yield repetitive outputs; group rewards evaluate coverage and engagement, subject to reward quality.
Illustrative example: Five paraphrases add less than options covering director, mood, and duration.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why keep Direct and Reasoning query paths?
AIGQ: An End-to-End Hybrid Generative Architecture for E-commerce Query Recommendation
Show answer and example
Answer: Easy intent benefits from low latency and complex intent from deeper inference. IL-GRPO aligns query groups, while hybrid offline/online serving reduces request cost. Local proxies do not reproduce CTR rewards or the live stack.
Illustrative example: Directly complete a brand, but reason about recipient and use for vague gifts.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What update risk does KL control beyond CTR reward?
AIGQ: An End-to-End Hybrid Generative Architecture for E-commerce Query Recommendation
Show answer and example
Answer: Reference KL penalizes drifting into narrow or reward-hacking queries. It balances feedback against prior behavior without guaranteeing unbiased rewards or independent quality.
Illustrative example: Avoid making every suggestion clickbait just because clicks rise temporarily.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does MovieLens validate live IL-GRPO and latency?
AIGQ: An End-to-End Hybrid Generative Architecture for E-commerce Query Recommendation
Show answer and example
Answer: No. Same candidates/seeds and validation-tuned proxy weights test ranking mechanisms only, without real query CTR or hybrid serving. Account separately for ranking, policy training, and measured latency.
Illustrative example: Movie NDCG gains do not establish millisecond query latency or online RL.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why is intent × summary an ad hierarchy rather than an ordinary ID?
Show answer and example
Answer: Intent groups needs and summary refines meaning, so paths share information. Joint objectives learn predictive and discriminative IDs, but codes still need real eligible ad mapping.
Illustrative example: Generate travel preparation then portable storage, not an unrelated flat ID.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why dynamically constrain decoding despite hierarchical ad IDs?
Show answer and example
Answer: Hierarchy organizes ads but not request-specific eligibility. Constrained beams exclude invalid paths during search, while generation/discrimination/ranking learn relevance. Postfiltering can waste beams.
Illustrative example: Block an unavailable ad path before it consumes the candidate budget.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does adding discrimination differ from beam selection by likelihood alone?
Show answer and example
Answer: Likelihood expresses contextual path probability; discrimination measures target specificity and ranking links utility. Tune their trade-off on validation; neither guarantees all metrics improve.
Illustrative example: A popular summary can lose to a more suitable niche path, unless discrimination is overweighted.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Should ANGLE filter illegal beams after generation or at every expansion?
Show answer and example
Answer: Apply request-specific legality at every step. Global vocabulary is not current eligibility. Select fusion coefficients on validation only.
Illustrative example: Mask a region-ineligible prefix immediately rather than generate ten ads and reject nine.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why do multiple SID tokens for one BARGE item require explicit item context?
Bridging the Structural Gap: Adapting Autoregressive Generation for Recommendation
Show answer and example
Answer: They are decompositions of the same item, but ordinary sequence attention may treat them as independent events. ICA aggregates within-item context and gates it back into each token, joining whole-item meaning to local detail. This addresses representation structure, not the separate task of learning preferences across items.
Illustrative example: A book's topic, subcategory, and collision code describe one book, not three successive reads.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does BARGE both restore item boundaries and rerank accumulated semantic paths?
Bridging the Structural Gap: Adapting Autoregressive Generation for Recommendation
Show answer and example
Answer: Ordinary sequence attention can treat the multiple SID codes of one item as separate events; ICA aggregates within-item context and gates it back into each code. HPR evaluates the accumulated generated path to limit propagation of early beam mistakes, while complementary quantization gives alternate decomposition views. These address boundaries, search errors, and diversity respectively.
Illustrative example: Province, city, and street are one address, not three purchases. If the coarse province is wrong, refining the street cannot fix it, so check the path at every level.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do BARGE's two complementary decoding paths differ from widening a single beam?
Bridging the Structural Gap: Adapting Autoregressive Generation for Recommendation
Show answer and example
Answer: A wider beam searches more paths within one encoding structure. Two orthogonal subspaces construct different representations and quantizations, so one early bias need not dominate both. HPR then scores cumulative paths. Extra paths add training and merge costs, and output count alone does not prove complementarity or independence.
Illustrative example: A wider beam may still explore a mistaken coarse code, while a second subspace can recover a missed book if it preserves different semantic cues.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why does BARGE's HPR compare the accumulated path vector instead of only the latest code?
Bridging the Structural Gap: Adapting Autoregressive Generation for Recommendation
Show answer and example
Answer: The cumulative sum includes every choice from coarse to fine and reveals whether the full semantic path fits the user. During inference combine generation log-probability with reranking; during training use contrastive comparisons over cumulative paths. DPD separately constrains projection orthogonality; it is not the same loss or proof of full independence.
Illustrative example: An entry-level code makes sense on its own, but the path has already entered home goods while the user wants a camera. Only the accumulated path exposes the mismatch.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why can Climber-Pilot predict multiple future items in training but serve in one step?
Climber-Pilot: A Non-Myopic Generative Recommendation Model Towards Better Instruction-Following
Show answer and example
Answer: Offset targets inject long-horizon consumption structure into a shared current state, and time weights differentiate offsets. Serving uses that learned model directly without simulating the future or seeing those targets.
Illustrative example: Train the current state to predict the upcoming camera, lens, and bag; score today's candidates without access to those true future events.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
How does Climber-Pilot account for farther-future consumption without serving a full rollout?
Climber-Pilot: A Non-Myopic Generative Recommendation Model Towards Better Instruction-Following
Show answer and example
Answer: Time-aware multi-item prediction trains the current state on several future targets, embedding longer-horizon structure in the parameters. Serving can still generate one result; condition-guided attention adds category and business constraints without extra rollout steps. True future items belong only to training supervision.
Illustrative example: Training can learn that camera interest extends to accessories. Serving cannot read a user's future purchase to recommend now.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
At what stage do constraints act in Climber-Pilot's conditional sparse attention versus post-decoding filtering?
Climber-Pilot: A Non-Myopic Generative Recommendation Model Towards Better Instruction-Following
Show answer and example
Answer: An internal attention mask changes which evidence forms the representation; post-filtering only removes generated results and cannot recover legal options that generation omitted. Internal masks must match business rules and do not eliminate the need for legality checks.
Illustrative example: A category mask can guide candidate formation. Removing all invalid candidates after generation can leave an empty list and cannot recover spent generation budget.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How should TAMIP time weights interact with valid-target masks in the multi-future loss?
Climber-Pilot: A Non-Myopic Generative Recommendation Model Towards Better Instruction-Following
Show answer and example
Answer: Offset k needs a real target and its specified weight `w_k`; padding at the tail of short sequences is not positive supervision. Offsets can share a current state whose inputs stop at the cutoff. Time-weighted losses and conditional attention masks affect different tensors.
Illustrative example: With two future events, compute two loss terms. A third empty slot creates no fake target, and heavier weighting does not let a future event enter history.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why generate COBRA's sparse code and dense vector in separate stages?
Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations
Show answer and example
Answer: A beam selects semantic regions by discrete code, then conditioned nearest-neighbor search preserves fine differences within each region and offsets quantization loss. Dense precision cannot recover items outside every selected region.
Illustrative example: Locate science fiction first, then distinguish hard and action science fiction. Fine ranking within family comedy will not find a science-fiction target.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does COBRA generate a dense vector conditioned on an already generated sparse SID?
Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations
Show answer and example
Answer: Quantization retains coarse structure but loses within-code details. The discrete path narrows search; user context and that path generate a dense query to distinguish items sharing a coarse code. Joint objectives align stages, but reranking cannot guarantee recovery of paths eliminated by the beam.
Illustrative example: After choosing athletic shoes, a dense query can distinguish trail from road shoes. It cannot recover them if the beam picked appliances.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does COBRA borrow from continuous two-tower retrieval and pure SID generation?
Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations
Show answer and example
Answer: Continuous towers suit ANN but often compress a user into few vectors; SID generation nominates hierarchical regions at the cost of quantization errors. COBRA uses codes for multi-region nomination and conditioned vectors for within-region detail, adding modules and calibration. Sparse-only ablation and comparison with DIN answer different questions.
Illustrative example: A beam can nominate photography and baking separately and refine both, instead of averaging interests in one vector, but both score levels need maintenance.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why combine COBRA beam scores and conditioned-vector dot products at inference?
Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations
Show answer and example
Answer: Dot products express item fit conditional on a code; beam scores preserve each path's prior plausibility. Combine on compatible scales and choose coefficients on validation. The dense training loss should actually update conditioned vectors, not be replaced by a fixed score mix.
Illustrative example: A high local dot product under an unlikely code should not automatically beat a slightly lower score under a likely code.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use a category first and within-category residuals afterward in CQ-SID?
Efficient Generative Retrieval for E-commerce Search with Semantic Cluster IDs and Expert-Guided RL
Show answer and example
Answer: Categories give controllable semantic boundaries; later codes distinguish details inside them. This aligns decoding with catalog constraints but may block items under a wrong category or separate cross-category neighbors.
Illustrative example: Choose camera first, then distinguish mirrorless from action cameras. A product misfiled under phone accessories follows the wrong path.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
What does CQ-SID gain and lose by fixing the first code to the item category?
Efficient Generative Retrieval for E-commerce Search with Semantic Cluster IDs and Expert-Guided RL
Show answer and example
Answer: The category organizes coarse search and business constraints; residual codes encode within-category detail. Wrong categories can make candidates unreachable, and cross-category substitutes may be split. Expert-guided reward balances clicks, purchases, and constraints; taxonomy alone does not ensure relevance.
Illustrative example: Generate a shoe code before styles, but a multifunctional product wrongly classified as luggage may never appear in a shoe search.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Where does CQ-SID's category constraint differ from a freely learned RQ first code?
Efficient Generative Retrieval for E-commerce Search with Semantic Cluster IDs and Expert-Guided RL
Show answer and example
Answer: Free quantization groups coarse codes by representation distance. CQ-SID fixes alignment with taxonomy in training and decoding, reducing semantic drift but depending on catalog quality. Expert-Guided RL separately aligns feedback; clear categories do not ensure higher recall.
Illustrative example: A photography book and tutorial video may share a free prefix but split under a fixed catalog taxonomy.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Within what scope should CQ-SID normalize grouped advantages?
Efficient Generative Retrieval for E-commerce Search with Semantic Cluster IDs and Expert-Guided RL
Show answer and example
Answer: Compute reward mean and standard deviation among rollouts for the same context and use the defined epsilon near zero variance. Mixing requests confounds different reward difficulties. Category and residual codes must share the legal vocabulary interface.
Illustrative example: Five high rewards for an easy request must not lower all advantages for a hard request; compare candidates within their own request.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why denoise DiffuReason's continuous Thinking Tokens rather than generating a long language rationale?
DiffuReason: Bridging Latent Reasoning and Generative Refinement for Sequential Recommendation
Show answer and example
Answer: Continuous variables can hold several interest cues and be revised from history without language decoding at each step. Discrete ranking reward aligns the internal process through policy training. Latents are not automatically readable reasons, and iteration does not guarantee conflict resolution.
Illustrative example: A vector may adjust novelty and budget preferences without a textual explanation proving each choice.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does DiffuReason iteratively refine latent intent through diffusion instead of predicting one final recommendation representation?
DiffuReason: Bridging Latent Reasoning and Generative Refinement for Sequential Recommendation
Show answer and example
Answer: One prediction can compress conflicting interests into an unstable direction. Latent Thinking Tokens carry intent and iterative denoising revisits cues; GRPO aligns continuous generation with discrete ranking feedback. Extra steps cost compute and can accumulate bias; a local proxy does not establish full latent reasoning capability.
Illustrative example: Fitness and dessert signals can be reconciled for a request without interpreting intermediate vectors as literal human thoughts.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What benefits and serving costs does DiffuReason's iterative update assume versus a one-shot user vector?
DiffuReason: Bridging Latent Reasoning and Generative Refinement for Sequential Recommendation
Show answer and example
Answer: Denoising can revisit history at intermediate states, adding iteration cost and sampling uncertainty. Repeating the same bias need not help. Keep public proxies separate from actual diffusion policy training; a final score cannot verify the full path.
Illustrative example: Later steps might correct an initial popularity bias if niche evidence is available, but ten steps cannot invent evidence missing from conditioning.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why is a fixed reward added to final scores insufficient to implement DiffuReason denoising and GRPO?
DiffuReason: Bridging Latent Reasoning and Generative Refinement for Sequential Recommendation
Show answer and example
Answer: Denoising needs defined timesteps, state transitions, and noise. Policy updates need same-context rollouts, rewards, and matching probabilities. A score addition does not train the continuous generation distribution or establish gradients. Local proxies do not replace end-to-end evidence.
Illustrative example: Multiplying popularity by 0.1 changes ranking but not latent denoising. Verify trajectories and real parameter updates before claiming policy training.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why does DualGR keep separate short- and long-term generation distributions?
DualGR: Generative Retrieval with Long and Short-Term Interests Modeling
Show answer and example
Answer: A single compressed representation can let more numerous historical events dominate current needs. Separate learned paths are dynamically mixed with valid-prefix and exposure constraints, not simply duplicated vectors or a guarantee of detecting every new interest.
Illustrative example: Keep established photography interest and new baby-product demand distinct enough to adjust their weights.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why route long- and short-term interests separately in DualGR instead of concatenating history?
DualGR: Generative Retrieval with Long and Short-Term Interests Modeling
Show answer and example
Answer: Recent and stable interests matter differently by request. Two paths learn generation distributions, a gate mixes them conditionally, valid prefixes map outputs to items, and exposure terms limit dominance of popular codes. Check distinct learning and gate collapse.
Illustrative example: A long travel history should not drown out today's repeated kitchen-shopping actions.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What freedom does DualGR's two-path routing add over fixed exponential decay?
DualGR: Generative Retrieval with Long and Short-Term Interests Modeling
Show answer and example
Answer: Fixed decay prescribes how age changes influence. Separate learned statistics and request-level gating can adapt nonlinearly, with more parameters and calibration. Recent noise or stale long-term interests can still dominate.
Illustrative example: One accidental click and a burst of consistent demand can receive different gate responses that are hard to express with one decay rate.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why align item columns before mixing the two DualGR distributions?
DualGR: Generative Retrieval with Long and Short-Term Interests Modeling
Show answer and example
Answer: Gate-weighted addition needs probabilities for the same item IDs. Align codebooks and candidates, map legal prefixes to serving items, and derive exposure only from training-available data. Local proxies do not cover production routing.
Illustrative example: If column one means camera on one path and children's clothes on the other, adding the values is semantically invalid despite matching shapes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why jointly optimize item representation learning and next-item prediction in EGR?
EGR: Embedding-Native Generative Retrieval with a Shared LLM
Show answer and example
Answer: Pure content optimization can omit recommendation distinctions. Next-item supervision retains consumption relationships while the item objective anchors semantics. Shared updates reduce separation but can conflict and do not guarantee alignment.
Illustrative example: Similar-genre movies can appeal to different audiences; joint learning can preserve that difference beyond text similarity.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does EGR jointly train two tasks despite sharing the backbone for item indexing and user queries?
EGR: Embedding-Native Generative Retrieval with a Shared LLM
Show answer and example
Answer: Shared parameters alone do not align retrieval geometry. Item representation learning maintains indexable content; next-item prediction directs queries toward consumption relations. Training one side against a changing other can stale the index, and serving and evaluation must use matching versions.
Illustrative example: If new item vectors rotate while queries stay in old coordinates, nearest neighbors can break despite matching dimensions.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What deployment trade-off does EGR joint updating make versus freezing the item encoder?
EGR: Embedding-Native Generative Retrieval with a Shared LLM
Show answer and example
Answer: Freezing stabilizes the index but blocks user supervision from refining item geometry. Joint learning can adapt both sides, requiring item refresh and versioned serving. The local negative result should not be replaced by the design promise.
Illustrative example: A new query direction for science fiction may not match an old index; freezing avoids drift but keeps old limitations.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why verify item-index and query versions after EGR updates its shared backbone?
EGR: Embedding-Native Generative Retrieval with a Shared LLM
Show answer and example
Answer: Updates can change dot-product meaning, so old index vectors may not match new queries. Record rebuild, training, and cutover boundaries and confirm both IRL and NIP run. A shared class name with one loss disabled is not joint training.
Illustrative example: An old item coordinate system and a new user coordinate system can have equal shapes but incompatible scores.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why turn Feedback Policy feedback into relational supervision rather than caching strategy text?
From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation
Show answer and example
Answer: Feedback reveals similarity and substitution structures that a lightweight model can learn from a relation matrix without online LLM explanations. The matrix is a teacher proxy with possible bias and incomplete reasoning. Text storage alone does not update model behavior.
Illustrative example: Learning that two tutorials are substitutes can prevent them dominating a list; a note to diversify does not change embeddings.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does Feedback Policy distill teacher relations instead of only independent item scores?
From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation
Show answer and example
Answer: Knowledge also resides in candidate similarities and preferences. Relation matching transfers feedback-derived structure to a lightweight ranker without serving an LLM. Teacher biases can transfer, and smaller matrix error need not improve user feedback.
Illustrative example: Two similarly scored products can be substitutes for a request. Capturing that relation informs list composition beyond copying static scores.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do relation-matrix and per-item logit distillation emphasize different errors?
From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation
Show answer and example
Answer: Logits match absolute outputs; matrices match relative layouts and can be less sensitive to global scale shifts. Structural matching can miss probability calibration. Compare under a fixed protocol rather than assuming more constraints improve quality.
Illustrative example: Adding a constant to all teacher scores leaves order intact but changes independent errors; relative distillation need not constrain absolute click probability.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why use the same identity order for teacher and student relation matrices?
From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation
Show answer and example
Answer: Every cell denotes a specific pair, so wrong ordering fits wrong relationships despite equal shapes. Match valid entries, normalization, and padding masks and use allowed evidence. The local proxy does not validate the complete real-user feedback loop.
Illustrative example: Camera in teacher row two and novel in student row two is an invalid comparison; align by item ID first.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why do GEAR BasisVQ and BasisRQ represent codes in a shared orthogonal basis?
Generative End-to-end Ad Retrieval at Douyin
Show answer and example
Answer: A common basis coordinates updates; orthogonality constrains rotation so codewords do not drift independently. Hierarchical generation supplies addresses and context reranks collisions. Orthogonality does not guarantee semantic independence or collision-free coding; test quantization and ranking separately.
Illustrative example: Two similar items can still share a bucket despite a stable coordinate system.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does GEAR use a shared orthogonal basis instead of freely updating each code vector?
Generative End-to-end Ad Retrieval at Douyin
Show answer and example
Answer: A shared basis constrains codebook geometry and stabilizes relationships as it changes. Hierarchical generation selects coarse-to-fine codes, then context reranks collision groups. Structure neither eliminates collisions nor replaces ranking supervision. Local checks cover quantization, state, and gradients, not full ad retrieval.
Illustrative example: Update codes within one coordinate system, but still distinguish two ads in the same code with current user context.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does GEAR's collision reranker allocate discrimination differently from indefinitely enlarging the codebook?
Generative End-to-end Ad Retrieval at Douyin
Show answer and example
Answer: Larger vocabularies distinguish more items at discrete addresses. Reranking keeps finite codes and resolves within-bucket candidates using user context, saving code capacity but adding bucket compute and recall limits. Local mechanism checks and orthogonality errors do not measure recommendation quality.
Illustrative example: Rerank two same-code cameras by user needs rather than assigning unique large-vocabulary codes; oversized buckets still cost compute.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why align row-vector conventions and check B's orthogonality for GEAR's zB and inverse mapping?
Generative End-to-end Ad Retrieval at Douyin
Show answer and example
Answer: Projection, nearest-code selection, and reconstruction must use consistent transposes; equal square shapes can hide mistakes. Verify orthogonality, residual quantization, and collision mapping separately. Diagnostics do not cover production generator quality.
Illustrative example: After multiplying a row by B, reconstruct using the corresponding inverse, and test the round trip on a known vector.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why organize consecutive positives as a next-page target in GenRec?
GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation
Show answer and example
Answer: Within-page consumption has order and complementarity that point prediction misses. Generate with prefix dependence and score the entire page with grouped rewards. Pages assembled from consecutive public actions are proxies, not observed impression pages.
Illustrative example: Tent, sleeping bag, and pad can form a useful page; three consecutive movie views do not prove simultaneous display.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does GenRec target a next-page sequence and keep NLL alongside GRPO?
GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation
Show answer and example
Answer: Item targets alone do not teach order and complementarity within pages. Sequence targets model composition, group-relative reward shapes full-page utility, and NLL anchors to logged behavior against reward drift. Rewards that omit relevance or feasibility can still mislead.
Illustrative example: A page objective can replace one of three redundant items; an NLL anchor can restrain a novelty-only reward from recommending irrelevant content.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What drift does GenRec's NLL limit compared with optimizing GRPO-SR reward alone?
GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation
Show answer and example
Answer: Group-relative rewards compare page utility while NLL preserves logged behavior, limiting drift toward sparse or biased rewards. Their balance trades imitation for exploration. Local relative gains depend on proxy labels and baseline and do not establish real satisfaction.
Illustrative example: Diversity reward alone can produce irrelevant novelty; NLL retains basic interests.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why compare GenRec page advantages only within the same context?
GenRec: A Preference-Oriented Generative Framework for Large-Scale Recommendation
Show answer and example
Answer: Same-context pages share history and candidate difficulty, so mean subtraction measures relative quality. Mixing users confounds request difficulty. Update prefix and duplicate masks together, apply NLL to legal targets, and do not use Token Merger to expose future test pages.
Illustrative example: Compare pages within each photography or cold-start user rather than marking every harder request negative.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why separate GLIDE's recent behavior and long-term embeddings into two prompt types?
Deploying Semantic ID-based Generative Retrieval for Large-Scale Podcast Discovery at Spotify
Show answer and example
Answer: The sequence retains immediate details; the embedding summarizes stable preferences. Separate inputs avoid averaging them together. Hierarchical SID paths still depend on prompt and codebook coverage; their combination does not prove reduced filter bubbles.
Illustrative example: Preserve long-term photography and recent camping signals to support outdoor cameras or campsite gear.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does GLIDE use separate prompts for recent behavior and long-term user embeddings?
Deploying Semantic ID-based Generative Retrieval for Large-Scale Podcast Discovery at Spotify
Show answer and example
Answer: Recent behavior captures immediate intent but can repeatedly favor familiar items. The long-term representation adds stable preferences missed by a short window. Both condition SID generation, trading responsiveness and exploration; long-term features can go stale and do not establish exploration by themselves.
Illustrative example: Recent commute podcasts can inform context while stable science interest helps discover a new science show.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does GLIDE's dual-prompt generation change outputs compared with transition or content retrieval?
Deploying Semantic ID-based Generative Retrieval for Large-Scale Podcast Discovery at Spotify
Show answer and example
Answer: Traditional systems directly combine similarity or transition scores. GLIDE predicts conditioned SID-path probabilities and maps them to candidates, sharing semantics through discrete codes while adding quantization and early-path errors. A local code-transition proxy does not train the full language generator.
Illustrative example: Generate a photography coarse code then refine it. Choosing the wrong branch can exclude a target that full-catalog scoring could still rank.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why must GLIDE's long-term embedding exclude the complete post-test user history?
Deploying Semantic ID-based Generative Retrieval for Large-Scale Podcast Discovery at Spotify
Show answer and example
Answer: Both long-term summaries and recent sequences must stop at available behavior. A test target inside the long-term vector leaks even if absent from recent inputs. Document codebook fitting and the local three-level public proxy.
Illustrative example: A movie's vector cannot contribute to the history used to predict that same held-out movie.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why does GR4AD address commercial SIDs, generation dependencies, and beam budgets under load?
Generative Recommendation for Large-Scale Advertising
Show answer and example
Answer: Ads need relevance, business attributes, fast updates, and bounded latency. UA-SID provides multi-granularity codes, LazyAR relaxes sequential dependencies, value/list training aligns utility, and dynamic beams manage serving cost. Next-code accuracy cannot measure all four.
Illustrative example: An excellent ad is unusable if decoding is too slow, while overly narrow beams can miss it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does GR4AD combine business-value weighting and list optimization rather than only predicting the next ad code?
Generative Recommendation for Large-Scale Advertising
Show answer and example
Answer: Next-token imitation can favor frequent low-value ads. Value weighting changes sample contribution; list objectives model relative business utility. Multi-granularity SIDs and relaxed dependencies address separate representation and compute issues. Check relevance and head concentration rather than reporting only revenue proxies.
Illustrative example: A rare high-value ad may matter more than a frequently shown low-conversion one; frequency imitation alone misses that.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why are GR4AD VSL and RSPO respectively weighted supervision and list alignment?
Generative Recommendation for Large-Scale Advertising
Show answer and example
Answer: VSL emphasizes high-value examples in code-prediction loss; RSPO reshapes within-list preferences using a reward distribution. They act at different granularities but may jointly concentrate exposure. Report concentration alongside NDCG, particularly when local value is proxied by popularity.
Illustrative example: Upweighting costly items and redistributing list probabilities by reward can both increase head exposure.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why align GR4AD RSPO's `q_j∝exp(r_j/τ)` with the candidate probability space?
Generative Recommendation for Large-Scale Advertising
Show answer and example
Answer: Normalize within one context's legal candidates and compute cross-entropy against identical student candidate identities. Temperature controls sharpness; ordering, invalid items, and cross-request groups change the target. Public value proxies are not eCPM, and these losses do not verify full LazyAR or dynamic serving.
Illustrative example: If q column two is a camera and student column two is children's clothes, gradients are wrong even if q sums to one.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why structure GRC trajectories as draft, reflection, and corrected SID?
Show answer and example
Answer: Early hierarchical mistakes restrict later choices. Explicit steps teach locating and repairing deviations instead of only imitating correct codes. At inference the model must identify errors itself, and valid formatting does not guarantee effective correction.
Illustrative example: Switch a home-goods draft to cameras by recognizing the request evidence, not by seeing a gold first-error index.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why can't a GRC corrector read the first wrong SID position during evaluation?
Show answer and example
Answer: Gold codes only build training draft–reflection–correction supervision. Deployment must infer likely errors from candidates, attribute consistency, and uncertainty without answer leakage. Entropy allocates correction budget, but hard high-entropy cases need not improve.
Illustrative example: A training example can identify a wrong city code; live recommendation cannot know the user's eventual target code.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does GRC trade by allocating correction to uncertainty rather than fixing every beam equally?
Show answer and example
Answer: Reflection-token entropy prioritizes likely repair candidates under a fixed budget, reducing duplicate work. High entropy can be noise and low entropy can be confidently wrong. The reported reward rose but test ranking fell; retain both.
Illustrative example: Correct two uncertain beams out of ten first, while recognizing that a confident wrong path might be missed.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How should GRC separate training first-error labels from test reflection inputs?
Show answer and example
Answer: Compare drafts with gold during training and use `L+1` if all levels match. At test, use only model drafts, attributes, and uncertainty. Bind reflection, correction, and reward to one trajectory without gold-based repairs.
Illustrative example: Giving the second-level gold mismatch to the test corrector makes it an answer-aware diagnostic, not autonomous repair.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use ItemLTV instead of immediate new-item purchases in GrowthGR?
Towards Sustainable Growth: A Multi-Value-Aware Retrieval Framework for E-Commerce Search
Show answer and example
Answer: Low initial exposure leads to few immediate purchases and can hide effects of first clicks on later orders. ItemLTV separates baseline and increment; MoPO aligns generation with multiple behavioral goals. Predicted incremental value is not inherently causal without credible assumptions and feedback.
Illustrative example: A click today might lead to a later series purchase despite no same-day conversion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does GrowthGR use ItemLTV incremental value and multi-objective post-training instead of only increasing new-item exposure?
Towards Sustainable Growth: A Multi-Value-Aware Retrieval Framework for E-Commerce Search
Show answer and example
Answer: Exposure is a means, not an outcome. ItemLTV estimates changes in future orders or value relative to what would happen anyway; multi-objective training balances click, purchase, and coverage. Clip rare high-value weights to limit instability. Counterfactual assumptions and rewards need validation; more new items do not prove growth.
Illustrative example: A first exposure can open a sustained use case or cause one accidental click; equal traffic treats these differently valuable opportunities alike.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do GrowthGR rare high-value weights differ from a uniform novelty reward?
Towards Sustainable Growth: A Multi-Value-Aware Retrieval Framework for E-Commerce Search
Show answer and example
Answer: A novelty reward uses newness alone. Rarity weights use previous-policy probability and multi-objective value to emphasize potentially useful low-opportunity items. Low probability is not quality; clipping limits amplified noise. Neither alone proves growth.
Illustrative example: Two new items with little exposure should not get identical boosts if estimated long-term relevance differs, though a bad estimate can be amplified.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why clip GrowthGR rarity weights based on `−log πold` and fix the reference policy?
Towards Sustainable Growth: A Multi-Value-Aware Retrieval Framework for E-Commerce Search
Show answer and example
Answer: Tiny old probabilities create extreme weights, high variance, and single-sample dominance. πold must match the sample's generating policy and context, not current probabilities. Policy ratios and reward weights have different roles; separate ItemLTV proxies from real orders.
Illustrative example: Clipping can stop one noisy low-probability example from dominating a batch without making its value estimate reliable.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why migrate GRP's recommendation funnel gradually instead of replacing all stages at once?
Show answer and example
Answer: Established systems serve several goals and risks. Introduce an additional retrieval source, replace weak sources, increase quota, and then bypass ranking progressively. Keep original recall protections and separate evidence and permissions per stage; a unified design is not a finished rollout.
Illustrative example: Start with a small candidate share and expand only after validation rather than removing retrieval and fine ranking on one offline win.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why activate GRP's one-sided logged-target margin only when original-target retrieval suffers?
Show answer and example
Answer: Reward optimization can move mass to a few high-reward outputs and lower logged-target probability. Penalize decreases past tolerance while permitting other improvements. Freeze and stop gradients through the ranking reward head to prevent co-adaptation. Local objectives and gradients do not verify production funnel replacement.
Illustrative example: Improve new candidates without a penalty if the original target remains competitive; penalize shifting all mass to one high-reward category.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What freedom does GRP's one-sided margin retain compared with symmetric probability constraints?
Show answer and example
Answer: Only a logged-target drop beyond reference tolerance incurs penalty, leaving other preference improvements free. Symmetric constraints may suppress beneficial changes too. Target preservation does not validate the new reward, and local checks only cover surrogate objectives and gradients.
Illustrative example: Raise better candidates while preserving the logged target without penalty; a large abandonment of that target activates the guard.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why does GRP's MHP ranking head read detached generator representations?
Show answer and example
Answer: Ranking gradients through shared encoding and SID paths can damage existing retrieval. Stop-gradient trains the ranker without changing the generator from this loss. Version it when frozen as RL reward and verify actual gradient separation rather than only registration.
Illustrative example: Updating ranking BCE should change the head but not send gradients into the SID-generation backbone.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why do Gryphon-v2's generation and ranking heads share a history encoder?
Show answer and example
Answer: Re-encoding the same history wastes computation and can produce inconsistent user states. A shared encoder supports SID nomination and ranking, but the ranker still depends on the generated candidate set and cannot recover omissions.
Illustrative example: Both heads see a user's recent switch to jazz, but missing jazz items cannot be reranked.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why distill both current rollouts and actual exposure candidates in Gryphon-v2?
Show answer and example
Answer: A changing generator proposes items rare in old logs; exposure-only training may not score its outputs well. Rollout-only training discards established coverage. One teacher calibrates both distributions, and a shared encoder links generation and ranking. Teacher bias can still transfer.
Illustrative example: Rollout supervision covers niche movies proposed by the new generator, while real exposures preserve knowledge of existing popular ones.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why does dual-source distillation better reflect generator serving candidates than logged impressions alone?
Show answer and example
Answer: Old impressions are policy-selected and can miss the current rollout distribution. Combined training sees actual exposure evidence plus the generator's outputs. The teacher may be unreliable in new regions; the local comparison was negative despite broader coverage.
Illustrative example: Niche instrumental candidates missing from old logs get rollout supervision, but can inherit teacher bias.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why keep Gryphon-v2 rollout and impression distillation provenance separate?
Show answer and example
Answer: Counts, weights, and candidate identities from different distributions affect the loss. Compare teacher and student on matching items and cutoffs and track which source dominates. Both objectives updated locally, but quality regressed; updates are not gains.
Illustrative example: Sixty thousand distilled rollout items are not 60,000 real impressions and must not be labeled user clicks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why does next-POI generation rely on spatiotemporal context more than content recommendation?
Guess Where You Go: Generative Next Point-of-Interest Recommendation in Amap
Show answer and example
Answer: Current area, time, accessibility, opening hours, and trip stage affect destinations. SIDs represent places; context selects meaningful paths. Pure co-occurrence can recommend semantically related but unreachable places.
Illustrative example: A lunchtime request in Shanghai should favor nearby food, not a favorite Beijing café.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does next-POI generation need spatiotemporal context rather than ordinary place IDs?
Guess Where You Go: Generative Next Point-of-Interest Recommendation in Amap
Show answer and example
Answer: Distance, time, and travel state constrain feasibility. Hierarchical semantic IDs organize places, contextual features constrain present needs, and curriculum training adds more complex feedback gradually. Long-horizon rewards need actual observations; co-occurrence or one hit does not establish route-planning value.
Illustrative example: A coffee lover can reach different shops on a morning commute and a weekend trip.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What stages do curriculum pretraining/SFT and long-term POI policy updates address?
Guess Where You Go: Generative Next Point-of-Interest Recommendation in Amap
Show answer and example
Answer: Curriculum and supervision establish place semantics, timing, spatial relationships, and generation; later feedback adjusts long-term preference without exploring a huge space from sparse reward alone. Public movie proxies do not verify mobility or POI capability.
Illustrative example: Learn legal regions and visit sequences first, then refine routes based on satisfaction rather than expecting one reward to teach city geography.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Which POI SID training targets must not become request features?
Guess Where You Go: Generative Next Point-of-Interest Recommendation in Amap
Show answer and example
Answer: Target locations and future stay feedback can enter loss only. Inputs use prior trajectories and contemporaneous context, not next-stop coordinates for filtering. Codes map to the matching directory version, and proxy score fusion is not full policy training.
Illustrative example: Filtering by the true destination's shopping district leaks the answer; use the user's current area and legal constraints.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why does HRPO decompose prefix utility into residual credits?
Hierarchical Residual Policy Optimization for Generative Recommendations
Show answer and example
Answer: Final item rewards are sparse, and giving all SID tokens the same score obscures which steps contribute. Differences in prefix utility supply the marginal credit of a newly added code, and credit-to-go accumulates later effects for earlier decisions. Smoothing depends on user clusters and estimation quality; a difference is not a directly observed causal contribution.
Illustrative example: Illustration: The first token correctly chooses outdoor goods, but the next goes to irrelevant decoration. The two can receive different feedback despite the same failed final outcome.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does HRPO split the final reward into prefix residual credit and credit-to-go?
Hierarchical Residual Policy Optimization for Generative Recommendations
Show answer and example
Answer: Broadcasting a whole-item reward to each SID token assigns identical responsibility to distinct decisions and can raise variance. HRPO smooths prefix utilities within user clusters, takes differences between neighboring prefixes as local credit, and accumulates subsequent credit so earlier decisions can learn their longer-term effects. Prefix utility is estimated: the decomposition does not automatically remove bias, and inference cannot read the true target path.
Illustrative example: Illustration: The first code can choose the wrong category and doom the entire path, while the last only refines a choice within the category. Prefix credit tries to distinguish those roles rather than treating all codes alike.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does credit-to-go differ from using only each token's own delta in HRPO?
Hierarchical Residual Policy Optimization for Generative Recommendations
Show answer and example
Answer: A single-step delta ignores how early choices constrain later ones. Credit-to-go sums residuals from the current step through the end, preserving long-term consequences. It can also accumulate estimation noise, and RRPO uses conservative updates to limit drift. The mechanism alone guarantees neither variance reduction nor an unbiased gradient of the original objective; those need a derivation for the specific case.
Illustrative example: Illustration: Choosing cameras early makes a good lens reachable later. Summing later credits lets the first token see that benefit, but an erroneous later utility can also propagate backward.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How can a telescoping check verify HRPO's prefix differences?
Hierarchical Residual Policy Optimization for Generative Recommendations
Show answer and example
Answer: Adjacent deltas should use the same version of utility. Their sum should equal final-prefix utility minus empty-prefix utility, and credit-to-go sums from the current position, not the start. User-cluster smoothing must not include future test feedback. The local binary SID verifies this bounded mechanism, not large-scale generative post-training performance.
Illustrative example: Illustration: If the empty-prefix utility is zero and the next three utilities are 1, 3, and 2, the deltas are 1, 2, and −1, which sum to 2. A different total from mixed smoothing tables exposes an inconsistency.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why combine explicit queries and implicit session intent in the same item space in IntSR?
IntSR: An Integrated Generative Framework for Search and Recommendation
Show answer and example
Answer: Search terms can omit background, while session activity offers context without directly stating the current request. Joint intent inference uses both, and a shared vocabulary avoids fragmented item identities across the two entry points. Time represents drift. An absent query should follow a defined missing-input path, not be replaced with something the user supposedly said.
Illustrative example: Illustration: A query of 'nearby' combined with a recent vegetarian search can suggest dining. A recommendation-only visit should use its session without inventing a user query.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
How does IntSR handle both explicit search terms and recommendation intent without a query?
IntSR: An Integrated Generative Framework for Search and Recommendation
Show answer and example
Answer: An explicit query expresses the current request; implicit session history supplies unspoken needs. Both inform latent intent, and results are generated in a unified item or POI vocabulary. Time context helps determine whether needs still apply and bridges search and recommendation. Sharing a vocabulary does not excuse ignoring query constraints or treating old interests as explicit current requests.
Illustrative example: Illustration: When a user searches for nearby coffee, a history of quiet venues can supplement the query. With no search, the session can suggest a need, but yesterday's location should not be assumed to apply today.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does IntSR's latent-intent mixture make explicit compared with concatenating q and h for scoring?
IntSR: An Integrated Generative Framework for Search and Recommendation
Show answer and example
Answer: It first estimates an intent distribution and then generates items conditioned on intent and time, keeping multiple plausible needs explicit. Direct concatenation may express this implicitly without learning the same structure. A latent variable need not have a stable human meaning, and a more decomposable output does not prove recovery of true intent.
Illustrative example: Illustration: 'Weekend activities' could mean hiking or an exhibition. Keeping probabilities for both before choosing a venue is natural, but those probabilities remain model estimates.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How should IntSR distinguish an absent query from a real empty-string search?
IntSR: An Integrated Generative Framework for Search and Recommendation
Show answer and example
Answer: Use the missingness marker or branch specified by the model contract. Time conditioning may only use the request timestamp, and the target POI must not enter latent-intent estimation. Both entry points share item identity, not necessarily every label. The source's movie proxy cannot test real locations or opening hours.
Illustrative example: Illustration: Never starting a search and deliberately submitting a blank query can have different log meanings. Do not collapse them to one unexplained string and leave the model to guess.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why combine cross-domain, long-term, and real-time behavior in LEADRE's intent-aware prompt?
LEADRE: Multi-Faceted Knowledge Enhanced LLM Empowered Display Advertisement Recommender System
Show answer and example
Answer: Cross-domain activity supplies clues unavailable in ads, long-term summaries retain stable interests, and real-time behavior reflects change. Together they help S-ID generation do more than memorize IDs. Summaries and caches can be stale and sources may conflict; a longer prompt is not full user understanding.
Illustrative example: Illustration: A stable photography preference, recent travel search, and current camera browsing suggest portable gear even if the new ad has no in-domain click history.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why train LEADRE ad SID generation with an intent prompt, semantic auxiliary tasks, and DPO?
LEADRE: Multi-Faceted Knowledge Enhanced LLM Empowered Display Advertisement Recommender System
Show answer and example
Answer: Predicting only discrete codes can memorize exposed IDs instead of using ad content and cross-domain needs. The intent prompt organizes long-term and real-time signals; semantic and commercial value objectives make codes more useful; DPO adjusts preference trade-offs. Report SFT-to-DPO changes separately because preference tuning need not improve every retrieval metric.
Illustrative example: Illustration: Two appliance ads may differ in relevance to current renovation, even if one appears much more often. Semantic and value supervision can separate them, but too much DPO weight on commercial feedback may hurt new relevant candidates.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How can LEADRE's full system improve while its DPO ablation worsens?
LEADRE: Multi-Faceted Knowledge Enhanced LLM Empowered Display Advertisement Recommender System
Show answer and example
Answer: The full system changes SID and semantic/value auxiliary tasks, whereas the ablation adds preference updates to the same SFT. Beating DIN does not validate each change. The local DPO result regressed relative to SFT, so do not attribute the full gain to alignment.
Illustrative example: Illustration: Pretraining may deliver a large gain, DPO may give some back, and the final system still beats a weaker baseline.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why must LEADRE keep the reference and context aligned when constructing winning and losing ad SID paths?
LEADRE: Multi-Faceted Knowledge Enhanced LLM Empowered Display Advertisement Recommender System
Show answer and example
Answer: The objective compares winner and loser probability changes relative to a reference under the same user intent. Switching requests or references changes the target. Construct legal SID mappings and auxiliary labels at the cutoff, do not use test answers in prompts, and version long-term caches with real-time inputs.
Illustrative example: Illustration: Two legal SID paths preferred by user A must not be scored against a reference conditioned on user B's history.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why look up the nearest future interaction separately for each business in MBGR?
MBGR: Multi-Business Generative Recommendation
Show answer and example
Answer: A global next-item label covers only one business. LDR looks ahead per business so a shared state learns multiple directions and masks missing labels. Multi-task supervision does not let future events enter history.
Illustrative example: Illustration: A current state can learn about both the next short video and later shopping instead of letting abundant video labels drown out shopping.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does MBGR find the nearest future event for each business rather than just supervising the next log event?
MBGR: Multi-Business Generative Recommendation
Show answer and example
Answer: Interleaved streams let frequent businesses dominate adjacent labels. LDR finds each business's nearest future target from a shared current state and conditions on business identity, exposing multiple prediction paths. Mask missing futures. This is training supervision only; future events are not current inputs.
Illustrative example: Illustration: A video may always be next, while a product search comes later. Per-business targets preserve shopping supervision without feeding future purchase IDs into the current recommender.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does business-conditioned MoE share compared with training a separate generator for each business?
MBGR: Multi-Business Generative Recommendation
Show answer and example
Answer: A shared expert pool learns common patterns, while business-conditioned gates produce specific representations and a conditioned autoencoder preserves SID semantics. Separate models duplicate learning but reduce conflict; shared models risk negative transfer. Genres proxy for businesses, not real cross-product labels. The local lack of gain should be retained.
Illustrative example: Illustration: Shopping and content may reuse one semantic expert at different weights. Separate models cannot exchange knowledge, but too much sharing can let high-traffic content suppress shopping.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why not fill a missing future business event with padding or the last item in MBGR?
MBGR: Multi-Business Generative Recommendation
Show answer and example
Answer: There is no observed target for that business in the window. Filling it creates a false transition, so mask its loss. t′ must be the earliest position strictly after the current time with the right business identity, not merely a similar category. Training label availability differs from inference input visibility.
Illustrative example: Illustration: If no purchase follows, the last movie is not a shopping positive. Masking preserves 'unobserved' rather than inventing an answer.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why supervise OneLatent with exploration, evaluation, and attribution instead of one fixed long chain of thought?
OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models
Show answer and example
Answer: The views cover discovery, comparison, and explanation; available perspectives per sample train a latent interface without a rigid template. It reduces explicit serving output, not proof of faithful reasoning recovery. Full-parameter training also contributes.
Illustrative example: Illustration: One example may have only a reliable evaluation, another all three views. They need not be forced into the same reasoning length.
Sections in the Chinese source: 背景与主要改动, 成本判断与本地边界. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why can OneLatent's latent tokens save online decoding without constituting a strict reasoning bottleneck?
OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models
Show answer and example
Answer: Training reconstructs exploration, evaluation, and attribution through latent tokens, then outputs semantic IDs instead of long reasons. Ordinary causal masks still expose original profile/history and all student weights update. Gains cannot be attributed to tokens alone storing every step. Local work reviewed evidence and cost without running a reproduction.
Illustrative example: Illustration: A few internal markers can support a recommendation during training and only an ID appears online; faster output does not prove all reasoning is stored in markers.
Sections in the Chinese source: 背景与主要改动, 成本判断与本地边界. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why is OneLatent's interface not latent MSE distillation with an extra encoder/projector?
OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models
Show answer and example
Answer: OneLatent trains all parameters of a causal student to reconstruct single- or multi-view reasons and predict SIDs, with no extra projector or strict bottleneck. MSE aligns feature coordinates, not generation. A fixture replacing the objective would be a new diagnostic; no such substitute was run locally.
Illustrative example: Illustration: Reconstructing reasons from markers supervises generatable content; shrinking Euclidean distance between vectors does not demonstrate that ability.
Sections in the Chinese source: 背景与主要改动, 成本判断与本地边界. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why average OneLatent reconstruction over each rationale's tokens, then over available perspectives?
OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models
Show answer and example
Answer: Summation overweights long reasons and examples with more perspectives. Two-level averaging controls length and missingness. Teachers can read positives to create reasons, but the student prefix must exclude the target SID and positive description. Async serving caches and training costs are separate; local work is review-only.
Illustrative example: Illustration: A 200-word rationale should not dominate a 20-word one by length alone, and a missing attribution view is not a real empty-text target.
Sections in the Chinese source: 背景与主要改动, 成本判断与本地边界. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why are shared item codes useful across OneMall cards, short videos, and livestreams?
Show answer and example
Answer: Shared identity avoids fragmented mappings and separate modeling. Scene conditions and multi-behavior evidence distinguish consumption contexts. The code does not equalize exposure goals, video completion, commerce, or watch time, and transfer can conflict.
Illustrative example: Illustration: Jacket videos and cards share a code, but video completion and orders should not become equally strong positives.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does OneMall need scenario conditioning and multi-behavior cross-attention after unifying Semantic IDs?
Show answer and example
Answer: One output vocabulary gives each item one identity across scenes, not one behavior meaning. Scenario conditions specify the task and cross-attention selects pertinent history. Query-Former compression and sparse experts manage context and capacity. A unified model family still needs scene-specific behavior.
Illustrative example: Illustration: The same jacket can be clicked in a card or ordered after a livestream. Its ID is shared, but live recommendation needs different behavior evidence.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does OneMall's sparse MoE change capacity and specialization relative to a dense generator?
Show answer and example
Answer: Experts add conditional capacity while sparse activation limits per-request compute. Dense sharing is simpler but can favor frequent scenes. Experts can starve or duplicate, so total parameters are not effective capacity. Local SID and scene fusion do not reproduce full MoE/RL.
Illustrative example: Illustration: Live shopping and video can use different expert mixtures. If the gate always uses one expert, unused experts add no specialization.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why don't local three-level SIDs and a scene prompt prove OneMall Query-Former, MoE, and RL were reproduced?
Show answer and example
Answer: The local path adds scene conditions, residual codes, and cross-behavior fusion. Query compression, actual routing, and policy updates need separate evidence. Report the small NDCG increase and Hit decrease within that scope rather than invoking the full paper family.
Illustrative example: Illustration: Three emitted item codes do not imply experts. Naming a loss 'reward' does not establish RL without rollout and updates.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
What prediction interfaces does OneRanker's fake item token unify?
OneRanker: Unified Generation and Ranking with One Model in Industrial Advertising Recommendation
Show answer and example
Answer: A shared representation conditions generation likelihood and value ranking, reducing objective separation. The token is an architectural placeholder, not a real item. Map outputs to a legal catalog and preserve each head's objective.
Illustrative example: Illustration: One candidate state answers likelihood and expected value, but the placeholder itself cannot be served as an ad.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why align OneRanker's generation distribution and value head preferences?
OneRanker: Unified Generation and Ranking with One Model in Industrial Advertising Recommendation
Show answer and example
Answer: Generation controls candidate availability and value controls ranking afterward. Reranking cannot recover valuable items the generator never produces. A shared fake-item token aligns interfaces and a consistency loss aligns distributions. Balance generation fit, value accuracy, and consistency to avoid suppressing useful differences.
Illustrative example: Illustration: If generation favors cheap accessories while value prefers durable tools, reranking accessories cannot show tools. Consistency aims to give tools a generation chance.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does generation consistency KL enforce beyond a shared backbone?
OneRanker: Unified Generation and Ranking with One Model in Industrial Advertising Recommendation
Show answer and example
Answer: Different heads can learn opposing preferences despite shared parameters. KL aligns distributions over identical candidates. This may reduce conflict or constrain useful specialization, so calibrate it. Agreement alone does not improve recommendation; both may prefer the wrong popular items.
Illustrative example: Illustration: A backbone does not stop accessory generation and tool value rankings from disagreeing. KL penalizes that disagreement, with direction still mattering.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why not subtract raw pgen and prank logits for OneRanker's KL?
OneRanker: Unified Generation and Ranking with One Model in Industrial Advertising Recommendation
Show answer and example
Answer: KL compares normalized probabilities over aligned candidates and consistent temperatures. Mask padding and illegal candidates identically; do not expose value labels to generation. Fixed score mixing does not demonstrate learned distribution alignment.
Illustrative example: Illustration: A constant logit shift leaves probabilities unchanged but changes squared differences. Full-catalog and ten-item normalizations cannot be treated as the same KL.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why concatenate multiple item SIDs into one autoregressive OneRec session target?
OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment
Show answer and example
Answer: Later items can condition on earlier selections, unlike independent item generation. Hierarchical SIDs give composable addresses and reward evaluates the session. Order still matters, and diversity is not guaranteed.
Illustrative example: Illustration: Follow a beginner photography tutorial with advanced practice instead of generating three independently relevant beginner videos.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why train OneRec preference pairs from full current-policy sessions rather than individual items?
OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment
Show answer and example
Answer: Session-level generation and reward can model coherence and diversity. Self-hard winner/loser pairs focus DPO on complete outputs the model confuses, comparing probability changes against a reference. Reward errors can steer updates incorrectly, and local results do not validate online gains.
Illustrative example: Illustration: Two five-video slates can be individually relevant but differ in repetition and flow. Session preferences teach which items work together.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Does OneRec self-hard DPO change the model or the search compared with widening the beam?
OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment
Show answer and example
Answer: A wider beam explores the existing distribution; DPO updates policy probabilities using current-policy session pairs. Weak reward judging can hurt: local DPO loss fell quickly while NDCG went to zero. Preference fit does not establish ranking quality.
Illustrative example: Illustration: Search may find a good list, but training on the judge's wrong winners can worsen future distributions despite a lower loss.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why don't legal SID prefix constraints solve semantic-collision identity problems in OneRec?
OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment
Show answer and example
Answer: A legal prefix proves catalog existence, not a unique item. Collisions require defined expansion or disambiguation, and uniqueness affects evaluation. Generate winners and losers from the current policy without gold injection. Legality, rewards, and ranking are separate checks; retain negative results.
Illustrative example: Illustration: Two films can share one legal code. Expanding to the correct film by reading the test label leaks the answer.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use real playback and negative feedback instead of an extra reward model in OneRec-V2?
Show answer and example
Answer: Direct behavior avoids reward-model training and error propagation. DARS adjusts duration opportunity and GBPO controls signed updates. Real behavior is still a biased satisfaction proxy. Removing a reward model does not remove calibration or constraints.
Illustrative example: Illustration: Long videos offer more watch seconds. Compare in user and duration buckets instead of treating all long watches as high satisfaction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why supervise only the latest impression and share context K/V across OneRec-V2 decoder layers?
Show answer and example
Answer: Latest-impression supervision avoids full decoding for every history position. Context Processor produces one reusable K/V state and Lazy blocks read it to generate short SIDs. This reduces repeated history encoding and per-layer cache costs. Real-feedback alignment is separate and its effects cannot all be assigned to shared K/V.
Illustrative example: Illustration: For three SID levels after a long history, each layer reads one shared memory rather than building its own full cache.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why isn't GBPO's dynamic denominator equivalent to PPO clipping?
Show answer and example
Answer: PPO clips the probability ratio; GBPO uses different stopped-gradient denominators by advantage sign. These limit updates differently. Replacing them with clipping loses defining behavior. Local feedback-weighted probability is not NDCG or online lift, and not all three seeds improved.
Illustrative example: Illustration: Positive and negative advantages respond differently as current probability changes; a symmetric clip does not establish equivalence.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why compute DARS quantiles within a user and duration bucket and detach GBPO denominators?
Show answer and example
Answer: Buckets compare similar viewing opportunities instead of mixing user habits and lengths. Stop-gradient prevents the denominator from adding unintended derivatives. Separate explicit dislike negatives from other zero advantages. Labels stay in post-training, not request inputs.
Illustrative example: Illustration: Thirty seconds on a ten-second and ten-minute video are not directly comparable; differentiating through a numerically identical denominator changes the update.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why put click, cart, and order into OxygenREC-v2 decoder instructions?
OxygenREC-v2: Internalizing Discrimination into Generative Recommendation
Show answer and example
Answer: Goals change which candidates should be generated. Conditioning from the first SID can improve coverage before ranking, while weighted pretraining and post-training connect feedback. Use a legitimate task input, not one inferred from the test target. Local popularity is not real multibehavior supervision.
Illustrative example: Illustration: Cart and casual click can need different first branches; reranking click-heavy candidates may miss order items.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why condition OxygenREC-v2 from the first SID and select post-training constraints by uncertainty?
OxygenREC-v2: Internalizing Discrimination into Generative Recommendation
Show answer and example
Answer: Late reranking cannot recover omitted items. A click/cart/order instruction shapes the whole decoding path. Training-only future behavior gives low-entropy positions confident teacher targets and high-entropy positions forward KL to preserve alternatives. Future events must not enter serving inputs.
Illustrative example: Illustration: An order instruction favors buyable branches from the start; uncertain branches retain several plausible products instead of one hard answer.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why is training with privileged future supervision different from serving with future features?
OxygenREC-v2: Internalizing Discrimination into Generative Recommendation
Show answer and example
Answer: The training teacher can use later behavior to construct richer targets for a student that reads current inputs only. Future events are not yet available online. High-entropy forward KL constrains the distribution; it does not make future inputs legal.
Illustrative example: Illustration: A later lantern purchase can supervise a training example, but feeding it into the test prefix bypasses prediction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why marginalize the three proxy behaviors in local OxygenREC-v2 instead of selecting the held-out target's class?
OxygenREC-v2: Internalizing Discrimination into Generative Recommendation
Show answer and example
Answer: MovieLens has no click/cart/order. Choosing a condition by the target's popularity leaks identity clues. Marginalizing avoids that hint but changes the original task, so conclusions remain proxy-only. Verify privileged views, entropy routing, and losses separately.
Illustrative example: Illustration: Telling the model in advance the target is low-popularity narrows search; combine the unknown conditions without using the target.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why is PinRec desired outcome different from the next observed feedback label?
Show answer and example
Answer: Desired outcome is a valid request condition. Future observed action is training supervision only; selecting conditions from test outcomes leaks information. Multi-vector windows represent several possible interests, not a guaranteed behavioral sequence.
Illustrative example: Illustration: Request save-worthy candidates, but do not first check that the held-out item was saved and choose the condition accordingly.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why condition PinRec on desired outcomes and predict multiple item vectors for a future window?
Show answer and example
Answer: One next-item target overrepresents common behavior and imposes a unique order. Desired outcomes guide heads, and multiple ANN-compatible vectors cover coexisting interests. Align predictions with window positives; do not treat duplicate popular vectors as distinct interests.
Illustrative example: Illustration: Set a save goal rather than casual browsing, and cover both gardening and baking from an unordered window.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why are PinRec unordered-window retrieval and strict next-token hits different?
Show answer and example
Answer: Multiple window positives allow alternative orders and coexisting interests. Strict next-item metrics accept only the immediately adjacent target. Align labels and pools for comparison; both local measures were negative and a looser metric should not hide that.
Illustrative example: Illustration: Retrieving a camera and tent fits the day window, but a tent does not count as the next item if the camera came first.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why normalize PinRec ANN outputs per head and deduplicate items?
Show answer and example
Answer: Each vector must share index geometry and scale. Per-head normalization controls norms, and duplicate retrieved items need defined merging or deduplication. Match window target identities; repeating the same vector does not establish multi-interest learning.
Illustrative example: Illustration: Three heads returning one popular camera cover one item; count unique hits and inspect whether heads differ.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why mix behavior and SID–metadata examples during PLUM CPT instead of only tuning next-item codes?
PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations
Show answer and example
Answer: Behavior teaches consumption transitions; text and ASR connect addresses to language semantics. CPT adapts pretrained knowledge to recommendation, then SFT focuses on retrieval. Mixture ratio matters, and lower loss need not improve search.
Illustrative example: Illustration: Learn both that a code means a camping tutorial and what users consume afterward.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why use hierarchical video SIDs and continue language pretraining in PLUM instead of enlarging an ID table?
PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations
Show answer and example
Answer: Huge ID tables memorize items and share little with new ones. Composable SIDs and CPT connect behavior, text, ASR, and metadata to LM capacity before next-SID training. Beam search generates candidates online, but code quality still determines retrieval usefulness.
Illustrative example: Illustration: A new baking video can borrow a coarse baking code and distinguish itself at a fine level instead of learning an isolated ID from scarce clicks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why cross random versus LM initialization with CPT on versus off in PLUM?
PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations
Show answer and example
Answer: Four cells separate initialization, extra continued training, and their interaction. Locally CPT lowered loss without improving Recall and LM-initialized arms had zero hits. Convergence is not successful retrieval or general scaling evidence.
Illustrative example: Illustration: Run random/no CPT, random/CPT, LM/no CPT, and LM/CPT to distinguish pretrained knowledge from extra training.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why reconstruct the first r codeword layers in PLUM progressive masking instead of shuffling levels?
PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations
Show answer and example
Answer: Residual levels accumulate coarse-to-fine meaning. Random prefix depths require each prefix to work; shuffling destroys that order. Mask SFT prompt loss, supervise only target SIDs, and use catalog trie legality. Training on prompt text changes the objective.
Illustrative example: Illustration: Sometimes reconstruct with coarse codes and sometimes add detail; using level three as the first code is not progressive reconstruction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
What does a SID prefix represent in PROMISE, and why does pruning remove many items?
PROMISE: Process Reward Models Unlock Test-Time Scaling Laws in Generative Recommendations
Show answer and example
Answer: It is a hierarchical address prefix shared by a reachable subset of items. Descendants only refine that branch. Pruning can remove many unexplored items at once, so a bad process score can cause broad misses.
Illustrative example: Illustration: Pruning photography excludes all cameras, lenses, and accessories below it, including a perfectly relevant lens.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why reward intermediate SID paths in PROMISE rather than score only complete items?
PROMISE: Process Reward Models Unlock Test-Time Scaling Laws in Generative Recommendations
Show answer and example
Answer: Early wrong semantic branches waste later computation. A lightweight process reward supplies dense training feedback and prunes drifting beams at inference. Wider beams can explore better paths but depend on reward quality and cost, not automatic improvement.
Illustrative example: Illustration: Reject a home-decoration prefix early for a hiking request instead of waiting to generate a cushion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What extra judgment does PRM-guided beam widening add beyond likelihood?
PROMISE: Process Reward Models Unlock Test-Time Scaling Laws in Generative Recommendations
Show answer and example
Answer: Likelihood prioritizes current model probability; PRM adds process value, allowing lower-likelihood but task-relevant paths. Scoring costs compute and can be biased. Test-time scaling is a budget–quality curve, not a guarantee.
Illustrative example: Illustration: PRM can keep a less popular but correct branch; a popularity-biased PRM may still explore the wrong region.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why define comparable scales across prefix lengths in PROMISE reward accumulation?
PROMISE: Process Reward Models Unlock Test-Time Scaling Laws in Generative Recommendations
Show answer and example
Answer: Long paths naturally sum more terms, potentially creating length bias. Compare beam candidates at consistent depths or with defined length handling, calibrate log-probability and λR, and retain legality, deduplication, and termination separately.
Illustrative example: Illustration: Three positive rewards are not inherently better than one if the paths have different depths. High PRM cannot legitimize an illegal item.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Does a valid PushDualGen SID guarantee correct copy?
Show answer and example
Answer: No. Catalog legality identifies a servable item. Copy also needs factual consistency, user evidence, and no exaggeration. Check identity and explanation quality independently.
Illustrative example: Illustration: Ordinary running shoes are a valid item, but claiming they are fireproof fails factual verification.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why generate a servable SID before optionally generating explanation copy in PushDualGen?
Show answer and example
Answer: SID identifies the recommendation and lets it enter serving immediately. A gate adds text only when needed, conditioned on that SID and history, saving decoding elsewhere. Fusion and consistency keep copy about the selected item; the recommendation remains usable without text.
Illustrative example: Illustration: A feed can return the item code alone, while a notification generates a reason about those running shoes, not an unrelated novel.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What budget and coverage trade-offs come from on-demand copy versus always generating explanations?
Show answer and example
Answer: Gating saves average decoding cost by reserving copy for useful scenarios, but some users may miss helpful explanations. Validate gating, caching, and scores for both modes. Do not present latency from one and effectiveness from the other as one path.
Illustrative example: Illustration: Report item-only feed speed separately from notification engagement with a generated sentence.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why define copy tensors and losses explicitly when PushDualGen has g=0?
Show answer and example
Answer: The skipped branch cannot require missing text; define masks and fallback states. At g=1, generate from the same SID and history. Placeholders are not explanations, and the local core scorer does not prove complete online copy generation.
Illustrative example: Illustration: A zero vector can mark missing text, not justify decoding generic praise and claiming personalized consistency.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why does QGS conditional probability describe a complete path rather than justify greedy per-step choices?
From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
Show answer and example
Answer: p(y|q,h) multiplies probabilities conditioned on prior generated tokens. Locally best choices need not maximize joint probability. Accumulate log probabilities under legal catalog paths. This identity alone does not establish the full search path in a local proxy.
Illustrative example: Illustration: A slightly stronger first token may have weak legal continuations; another branch can win overall.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why serialize query and item together in QGS and still add feature interactions?
From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
Show answer and example
Answer: Joint serialization conditions generation on search query and history from the first item path, not just a general user vector. History encoding controls context cost and HFG-Attention adds sparse heterogeneous crosses. Its efficiency is architecture-specific, not proof every HSTU is linear.
Illustrative example: Illustration: 'Travel camera' and 'indoor lighting' steer different paths; device and region interactions can further influence candidates.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why don't Linear HSTU and ordinary HSTU have the same complexity just because they share a name?
From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
Show answer and example
Answer: Linear forms need a specific kernel approximation or reordering. Standard SiLU(QKᵀ)V still has pairwise interactions, and HFG fusion adds separate costs. Do not invent kernel details absent from the source or omit dimensions and fields.
Illustrative example: Illustration: Removing softmax does not eliminate the N×N matrix; the actual rewrite or sparse execution matters.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why doesn't local QGS +0.73% NDCG validate full generation and a linear kernel?
From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
Show answer and example
Answer: A shared scorer proxy changes rank scores without production queries or full kernel throughput measurements. Verify joint input, legal generation, field interaction, and attention separately. Hit declined and should also be reported.
Illustrative example: Illustration: A cross term on movie-transition scores can change NDCG without producing SID decoding traces.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Can RaG retrieval hits alone measure new video quality?
Show answer and example
Answer: No. Retrieval evaluates existing candidates, while generated video requires visual, factual, and interest consistency. D-SID bridges interfaces, not success criteria. Local ranking cannot substitute for an unimplemented generator.
Illustrative example: Illustration: Correctly choosing camping can still yield physically impossible footage; pretty footage can also be irrelevant.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why use disentangled SIDs to connect recommendation and generation in RaG?
Show answer and example
Answer: Recommendation picks suitable content and generation controls creative attributes; entangling both can interfere. D-SIDs separate interfaces and cross-domain rewards coordinate what to recommend with how to produce it. The local discrete interface does not demonstrate video quality or full business lift.
Illustrative example: Illustration: A camping theme code supports selection while creative codes control shots or presentation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does RaG cross-domain reward evaluate beyond visual generation quality?
Show answer and example
Answer: It checks recommendation fit as well as visual quality and coordinates selection with creation. Rewards may conflict or lack verification. One proxy score cannot show both personalized relevance and actual visual gains. Locally only the D-SID interface ran.
Illustrative example: Illustration: Beautiful climbing footage can be irrelevant to easy camping, while matching a keyword does not prove watchable realistic video.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
What evidence would demonstrate full RaG video generation beyond the local D-SID interface?
Show answer and example
Answer: Provide the real model and revision, conditions, generated videos, runnable training or inference commands, and quality evaluation. Discrete vectors and ranking metrics demonstrate transfer of code components, not execution. Paper online gains do not fill the local gap.
Illustrative example: Illustration: Returning two content/creative integers is a callable interface, not a video; a placeholder filename is not a visual artifact.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why assess catalog groundedness separately from contextual groundedness in RAG-QAC?
Show answer and example
Answer: Catalog checks whether a suggestion maps to real searchable content; context checks fit with prefix and known needs. Each can pass alone and neither guarantees safety or engagement.
Illustrative example: Illustration: Real adult hiking boots fail context for children's rain boots, while an invented perfect child model fails the catalog.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why retrieve a searchable catalog before multi-objective preference alignment in RAG-QAC?
Show answer and example
Answer: Free generation can create plausible suggestions with no results. Catalog retrieval grounds suggestions in traceable candidates, then SFT/DPO balance relevance, safety, engagement, context, and diversity. Alignment cannot create missing inventory, and engagement should not trump factuality.
Illustrative example: Illustration: Retrieve real tents and cookware for 'light camping' before suggesting a nonexistent model.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What do SFT and DPO add beyond a retrieval-template system for RAG-QAC?
Show answer and example
Answer: Templates ground some terms but fix expression and priorities. SFT learns contextual completions and DPO compares relevance, safety, engagement, and diversity. Goals can conflict; avoid losing truth for clicks. A fixed local scorer does not prove language post-training.
Illustrative example: Illustration: Learn a trade-off between two searchable suggestions, one closer to the user and one covering a new direction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why keep RAG-QAC retrieval evidence separate from gold completion labels?
Show answer and example
Answer: Evidence comes from the prefix and catalog, while gold is training supervision. Retrieving from the correct held-out completion leaks it. Verify catalog and context independently rather than treating membership as all quality checks.
Illustrative example: Illustration: Inserting the held-out tent model before generating lets the model repeat the answer rather than retrieve from the prefix.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Does zero RCLRec curriculum quality stop the main objective from learning?
RCLRec: Reverse Curriculum Learning for Modeling Sparse Conversions in Generative Recommendation
Show answer and example
Answer: No. Main loss plus λq(C) times the curriculum loss retains the main term at q(C)=0. Do not mask the whole sample. For gradient claims, distinguish whether the weight is trainable.
Illustrative example: Illustration: A poor curriculum can be ignored while the true purchase label still trains the primary objective.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why put reversed conversion-related history into RCLRec's decoder prefix and weight curriculum quality?
RCLRec: Reverse Curriculum Learning for Modeling Sparse Conversions in Generative Recommendation
Show answer and example
Answer: Sparse conversion labels weakly supervise long histories. Selecting a related short subsequence and reversing it foregrounds events closer to conversion and creates intermediate supervision. Quality weighting limits weak curricula, but mistaken relevance can reinforce bias.
Illustrative example: Illustration: Start from cart addition and work back through comparison and search, while downweighting accidental browsing.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does quality weighting reduce uninformative curriculum supervision compared with equal weights?
RCLRec: Reverse Curriculum Learning for Modeling Sparse Conversions in Generative Recommendation
Show answer and example
Answer: q(C) limits irrelevant segments' influence on the main objective. It can be mistaken or overly concentrated and reduce coverage. Preserve the negative public proxy rather than assuming effectiveness.
Illustrative example: Illustration: Ten unrelated clicks do not deserve more auxiliary weight than one clear compare-to-cart chain.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why preserve event timing and visibility when implementing reverse sequences in RCLRec?
RCLRec: Reverse Curriculum Learning for Modeling Sparse Conversions in Generative Recommendation
Show answer and example
Answer: Reversal changes prefix order, not what was observed before the target. Define selection, order, quality masks, and causal decoding for the transformed layout. Reversing a tensor with mismatched positions is not the specified curriculum.
Illustrative example: Illustration: Pre-purchase comparisons can be reversed, but a return after purchase cannot join the prefix.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why store original behavior references and timestamps in a RecGPT-V3 memory unit?
Show answer and example
Answer: Provenance enables evidence tracing and incremental updates instead of letting summaries drift. Only relevant units change, but traceability is not lossless or causal correctness. Refresh and expiry still matter.
Illustrative example: Illustration: Link 'planning to camp' to dated browsing records so the right unit can be updated when needs change.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why change memory, item interface, and reasoning representation together in RecGPT-V3?
Show answer and example
Answer: CoT compression alone leaves repeated history reads and losses mapping natural language to items. Memory Hub updates traceable units incrementally, SID connects to products, and latent tokens cut reasoning output. They address different costs, while production ranking feedback also contributes.
Illustrative example: Illustration: Update only the photography memory after a camera view, emit an item code, and use shorter latent reasoning. Text length alone misses the other savings.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What training protection does latent internalization add beyond deleting explicit CoT?
Show answer and example
Answer: Segment, cross-segment, and full-chain reconstruction transfer teacher information into latent slots. Removing output alone only saves text. Reconstruction does not prove faithful reasoning, and teacher quality and freezing matter. Local synchronous drift failed before teacher warm-up and freezing improved results.
Illustrative example: Illustration: Teaching four slots to support prior explanations differs from not printing an explanation; moving teacher and student together can destabilize targets.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why report RecGPT-V3 selection history and head share with final local metrics?
Show answer and example
Answer: Teacher warm-up and freezing were selected through iterations; the final single seed is not preregistered stability evidence. Rising head share can signal a popularity shortcut. Counts of memory and latent tokens are structural, not latency or 14B measurements.
Illustrative example: Illustration: Reducing 40 events to 14 inputs changes budget but does not promise a 65% speedup.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Can reward-guided decoding give positive mass to a sequence with P0=0?
Reward Guided Decoding for Generative Recommendation
Show answer and example
Answer: Not under the closed form. Multiplying strict zero by an exponential stays zero, and normalization does not create support. Smoothing, candidate expansion, or generator changes are separate steps.
Illustrative example: Illustration: A movie absent from all legal candidates cannot be recovered by assigning a high novelty reward.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does exponential reward-guided decoding preserve a prior while depending on KL temperature?
Reward Guided Decoding for Generative Recommendation
Show answer and example
Answer: The tilted distribution multiplies prior probability by exponentiated reward. Smaller temperature follows reward more aggressively; larger approaches the prior. Search and normalization affect approximation, and reward errors can hurt even without training.
Illustrative example: Illustration: Moderate novelty can elevate relevant niche movies; too low a temperature can select irrelevant novelties.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
When does exponential tilting correspond to adding logits, and when does it not?
Reward Guided Decoding for Generative Recommendation
Show answer and example
Answer: On identical support, log Q equals log P0+R/β up to a shared normalizer. Adding reward to raw P0 instead changes the distribution. Candidate truncation also changes support and normalization and is not the exact closed form.
Illustrative example: Illustration: Adding one to probabilities 0.9 and 0.1 has a different effect from adding it in log space.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why implement reward tilting with logsumexp and test temperature limits?
Reward Guided Decoding for Generative Recommendation
Show answer and example
Answer: Raw exponentials overflow. Normalize in log space; large β should approach the prior, small β emphasize reward, and illegal entries stay masked. Separate truncated approximation from exact normalization. Local novelty reward reduced NDCG, so higher reward did not establish better ranking.
Illustrative example: Illustration: exp(1000) can overflow; stable normalization fixes numerics, not irrelevant novelty at low temperature.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Is an RGAlign-Rec latent query an actual search term typed by the user?
RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems
Show answer and example
Answer: No. It is verbalized intent generated from user context to connect item retrieval with ranking needs. Fluent text does not establish that the user said it. Distinguish observed behavior from inferred intent to understand the supervision.
Illustrative example: After a user views camping content, the model may infer “lightweight tent” even if no such search appears in the log.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does RGAlign use the ranker's item preferences to choose query winners and losers?
RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems
Show answer and example
Answer: A fluent latent query can miss items the ranker values. Generate alternatives, rank the items they retrieve, and derive demonstrations and preference pairs to align query generation with top-ranked retrieval. RG-SFT learns the mapping and DPO strengthens relative preferences. Supervision still inherits the ranker's judgment, not independent satisfaction.
Illustrative example: History may suggest beginner photography or professional lenses. If ranking favors a lightweight beginner camera, prefer the first query rather than the one phrased most naturally.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does ranking-guided query alignment differ from ordinary language SFT?
RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems
Show answer and example
Answer: SFT maximizes demonstration text likelihood. Ranking guidance constructs preferred and rejected queries from downstream item preferences, tying verbalized intent to ranking. Ranker preferences can be biased and are not causal user ground truth.
Illustrative example: A fancier query may retrieve worse candidates; downstream feedback can distinguish the two.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How should we distinguish local RGAlign queries from the production LLM pipeline?
RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems
Show answer and example
Answer: A fixed public MovieLens candidate protocol checks the ranking-guided core, not private features, the production base, or traffic. Compare positive and negative queries under the same context and candidates. Do not choose winners with test labels.
Illustrative example: Better offline candidate scores do not establish higher live conversion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Does “role” in RoleGen mean a user identity or an item's function along a conversion path?
Awakening Dormant Users: Generative Recommendation with Counterfactual Functional Role Reasoning
Show answer and example
Answer: It means an item's function in the conversion path, not a user occupation or demographic. An LLM Reasoner infers item roles and passes candidates to the SID generator and feedback loop. The roles are model interpretations, not observed causal identities.
Illustrative example: An item can help comparison in one trajectory and be the purchase in another, regardless of whether the user is a student.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does RoleGen infer conversion-path functions rather than rely on similarity to reactivate dormant users?
Awakening Dormant Users: Generative Recommendation with Counterfactual Functional Role Reasoning
Show answer and example
Answer: For inactive users, repeatedly serving similar old items can narrow interests. Functional roles model exploration, comparison, and conversion. Counterfactual paths estimate an item's instrumental contribution, which feeds the SID generator and iterative reflection. These estimates rely on model and data assumptions, not causality identified by observed trajectories alone.
Illustrative example: A camera buyer may have watched reviews and photography tutorials. A tutorial is not similar to a camera listing but may reactivate interest.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does counterfactual instrumental contribution differ from co-occurrence similarity?
Awakening Dormant Users: Generative Recommendation with Counterfactual Functional Role Reasoning
Show answer and example
Answer: Co-occurrence describes what appears together. Instrumentality asks how an outcome might change if the item were removed. A local proxy and do notation do not identify real causal effects.
Illustrative example: Phones and chargers may be bought together without charger recommendations causing phone purchases.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Can RoleGen's local public data establish production conversion among dormant users?
Awakening Dormant Users: Generative Recommendation with Counterfactual Functional Role Reasoning
Show answer and example
Answer: No. A MovieLens subset and proxy objective check the core path, without private dormant-user logs or actual traffic buckets. Log score provenance, candidates, and feedback. Do not present proxy deltas as live intervention effects.
Illustrative example: A movie preference ranking change is not causal lift in e-commerce conversion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why keep the large judge off S-GRec's online generation path?
S-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Show answer and example
Answer: Offline judging supplies per-aspect preferences; a lightweight generator emits SIDs without online LLM latency. Judge quality still depends on training data and is not cost-free.
Illustrative example: An expensive teacher trains semantic preference while a small model serves.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why add bounded semantic advantage only when it agrees with business advantage?
S-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Show answer and example
Answer: The rewards have different scales. A2PO standardizes each within rollout groups, anchors to business advantage, and adds semantic signal only with matching sign and bounded magnitude. This does not remove reward bias.
Illustrative example: A pleasing rationale cannot turn negative business feedback positive.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do user-conditioned aspect weights differ from one fixed vector?
S-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Show answer and example
Answer: The judge supplies aspect scores and an aggregator gives normalized nonnegative per-user weights. Fixed weights express one trade-off; conditional weights personalize the same content but do not prove satisfaction.
Illustrative example: One user prioritizes history fit while another prioritizes novelty.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Is local S-GRec business reward real eCPM?
S-GRec: Personalized Semantic-Aware Generative Recommendation with Asymmetric Advantage
Show answer and example
Answer: No. Public data lacks money signals; it uses next-item ranking. Judge, generation, and policy run at reduced scale with different labels.
Illustrative example: A correct next movie is behavioral evidence, not ad revenue.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Is S2GR's thinking token a long free-form natural-language chain?
S2GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation
Show answer and example
Answer: It is an intermediate state before each SID level, aligned to that level's codebook. SIDs remain a discrete hierarchical path; the name does not prove natural-language reasoning.
Illustrative example: Insert a state, choose a level code, and move on without emitting a prose essay.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why insert a thinking token before each SID stage and align it to codebooks?
S2GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation
Show answer and example
Answer: Early coarse codes constrain later paths. Intermediate states receive contrastive codebook supervision; collaborative graphs and balancing add behavior and usage signals. This need not be faithful natural-language reasoning.
Illustrative example: Align the intermediate outdoor-category state before selecting finer camping gear codes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What do thinking alignment and codebook load balancing constrain?
S2GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation
Show answer and example
Answer: Alignment links intermediate states to code semantics. Load balancing prevents concentrated code use. Uniform use does not establish semantics, and semantic alignment does not ensure balance.
Illustrative example: Randomly spreading examples can fix utilization while losing meaning.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Are the local S2GR codebook and thinking states the production model?
S2GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation
Show answer and example
Answer: No. Fixed MovieLens data tests core mechanisms. Align current code, earlier codes, and thinking position; never tune balance using test catalog labels. Production gains are author-reported.
Illustrative example: Uniform use in a small catalog does not validate a production hierarchy.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Is SessionRec's session token one item or a visit representation?
SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendation
Show answer and example
Answer: ISE aggregates multiple items into one visit representation; SSE models transitions across visits. The next visit can include several positives.
Illustrative example: Group A/B/C into one visit and target D/E together.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why aggregate sessions before predicting multiple next-session positives?
SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendation
Show answer and example
Answer: Items within a visit often share intent rather than a unique order. ISE aggregates; SSE learns cross-visit transitions. Supervise all next-session positives and use actual skipped impressions. Bad session boundaries can mix intents.
Illustrative example: Group tent, bag, and mat as one shopping visit before predicting the next hiking visit.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Which ordering do ISE and SSE handle?
SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendation
Show answer and example
Answer: ISE aggregates items within a visit, and SSE models chronological visit transitions. Mean ISE downplays within-visit order, not all order. SSE can use Transformer or HSTU.
Illustrative example: Noon versus evening visits matter even if within-visit browse ordering is weak.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Can random catalog negatives be labeled skipped exposures?
SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendation
Show answer and example
Answer: No. Hard negatives are actual exposed but unclicked items in that visit. Training samples a positive per round for CE, while evaluation keeps the full positive set.
Illustrative example: An unseen movie is not a rejected impression.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why combine a short SID prefix with unique item identity?
SIGMA: A Semantic-Grounded Instruction-Driven Generative Multi-Task Recommender at AliExpress
Show answer and example
Answer: The prefix narrows search; unique item representations retain exact identity inside its subcatalog. It is a middle ground between long SID generation and full-catalog ANN.
Illustrative example: Choose a sneaker subcatalog, then distinguish exact models.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why use short SID prefixes and unique IDs instead of all-SID generation or global ANN?
SIGMA: A Semantic-Grounded Instruction-Driven Generative Multi-Task Recommender at AliExpress
Show answer and example
Answer: Prefix generation locates a semantic catalog; unique IDs disambiguate items and local ANN limits cost. Multiview alignment connects semantics and behavior; APF trades precision and diversity with confidence. Missed prefixes constrain recall.
Illustrative example: Search within outdoor equipment; if only home goods was generated, local ANN cannot find tents.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do multitask instructions differ from next-item-only training?
SIGMA: A Semantic-Grounded Instruction-Driven Generative Multi-Task Recommender at AliExpress
Show answer and example
Answer: Instructions specify query, long-tail, discovery, and other goals. Evidence of following them requires task data and evaluation; prompting alone does not teach seasonality.
Illustrative example: The same history can request novelty or a familiar category.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does exact local cosine top-k establish production ANN latency?
SIGMA: A Semantic-Grounded Instruction-Driven Generative Multi-Task Recommender at AliExpress
Show answer and example
Answer: No. It verifies retrieval logic on a small catalog with proxy tasks. It does not measure large-scale index speed or establish APF/online uplift.
Illustrative example: Scanning thousands of items differs from billion-item service.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why build a co-engagement graph before SnapLGR SIDs?
LLM-Based Generative Retrieval for Snapchat Content Recommendation
Show answer and example
Answer: Propagation adds collaborative relationships, residual quantization turns them into hierarchical paths, and generation predicts codes from history. Behavior complements content.
Illustrative example: Visually different items consumed by one audience can become connected.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why propagate co-engagement, quantize, then ground generated tokens?
LLM-Based Generative Retrieval for Snapchat Content Recommendation
Show answer and example
Answer: Graphs add collaborative signals, quantization encodes them in discrete paths, grounding ties codes back to content, and next-SID prediction learns transitions. Popularity bias can propagate too.
Illustrative example: Visually different co-consumed items can become neighbors, but codes still must resolve reliably to relevant content.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What does grounding SID tokens add beyond discrete-code likelihood?
LLM-Based Generative Retrieval for Snapchat Content Recommendation
Show answer and example
Answer: Alignment preserves content meaning instead of learning only code transitions. Its benefit depends on embedding and graph quality, not any arbitrary semantic code.
Illustrative example: Related videos' code representations should reflect their content relationship.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
What behavior can graph propagation and quantization use?
LLM-Based Generative Retrieval for Snapchat Content Recommendation
Show answer and example
Answer: Only allowed training co-engagement, without future test edges. Pin codebook and mapping versions. Public features do not reproduce Snap logs, scale, or traffic.
Illustrative example: Test clicks in the graph leak retrieval relationships.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use both SID generation and ranking in Sona?
Show answer and example
Answer: Share user state across candidate generation and fine ranking instead of duplicating representations. A large teacher guides training only; one model serves.
Illustrative example: Generate songs and score specific songs from the same user state.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why share user state between Sona generation and ranking, with teacher only in training?
Show answer and example
Answer: Separate models repeat history encoding and can learn inconsistent representations. One chronological compressed state supports joint generation and ranking, with training-only teacher supervision. It does not eliminate missed retrieval or compression loss; retain local negative results.
Illustrative example: Both paths respond to a shift from rock to classical without calling a large teacher online.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does a unified model differ from deleting an intermediate ranker?
Show answer and example
Answer: Joint generation, ranking, and distillation must replace functionality and handle long history. Compare coverage and robustness; fewer models alone do not prove improvement.
Illustrative example: Dropping pre-ranking without joint training can just remove functionality.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does Sona call its teacher at serving?
Show answer and example
Answer: No. Teacher is training-only. Local work omits the full teacher, music tokenizer, and 15-plus-source production stack. Generation/ranking losses share state with distinct masks.
Illustrative example: Calling the large teacher online changes the cost contract.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why repair SPAR load within each parent SID prefix?
SPAR: Stepwise Personalized Autoregressive Recommendation with Prefix-Balanced Semantic IDs
Show answer and example
Answer: Compare sibling load by interaction weight, not item count, while freezing centers and preserving hierarchical semantics through low-distortion moves.
Illustrative example: Two branches with ten items each may have very different traffic.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why freeze centers and use a load bound accounting for the heaviest item?
SPAR: Stepwise Personalized Autoregressive Recommendation with Prefix-Balanced Semantic IDs
Show answer and example
Answer: Fixing centers and parents limits semantic drift. Indivisible weights can make exact averages infeasible; move at most once per item and choose low-cost feasible destinations. Local scope excludes retrieval and preference alignment.
Illustrative example: Total load 12 across three branches cannot be exactly four each if one item weighs six.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How do feasible RQ-PIB moves differ from global equal buckets?
SPAR: Stepwise Personalized Autoregressive Recommendation with Prefix-Balanced Semantic IDs
Show answer and example
Answer: Choose a currently feasible low-distortion move under load limits and indivisible-item weights. It guarantees neither exact equality nor global optimum.
Illustrative example: A very popular item cannot be split across branches merely to equalize loads.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does local SPAR implement PATH retrieval and full SFT+DPO?
SPAR: Stepwise Personalized Autoregressive Recommendation with Prefix-Balanced Semantic IDs
Show answer and example
Answer: No. It implements post-freeze RQ-PIB only. Skip zero-load groups, move items at most once, and keep parents and centers fixed.
Illustrative example: Local branch balancing does not train prefix personalization.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why compile legal item tries into device-side transitions?
Show answer and example
Answer: Inventory/geography constraints need legal decoding, but CPU pointer traversals cause round trips. CSR and shallow dense lookup provide contiguous token and destination indices on accelerators.
Illustrative example: Gather legal successors from one row rather than walking a CPU trie.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why use full-vocabulary log-softmax before masking?
Show answer and example
Answer: Constraints remove invalid paths, not alter original conditional probabilities. Legal-set renormalization favors some small sets in cross-beam comparison. CSR accelerates lookup; synchronize prefixes and states.
Illustrative example: A lone legal child should not become probability one and unfairly beat a better-supported path.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does legal-only softmax differ from full log-softmax then masking?
Show answer and example
Answer: Legal renormalization changes prefix score scales according to set size. Full log-softmax preserves model probabilities while excluding invalid tokens.
Illustrative example: A parent with one legal successor gets an artificial boost if renormalized alone.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why reorder prefix and trie node together after beam selection?
Show answer and example
Answer: Prefix and legal state are paired. Children can come from different parents; mismatching states applies the wrong mask. Pin trie versions.
Illustrative example: A clothing prefix cannot keep a food node for next-step legality.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why combine LSID, IAG, and IOPO adaptation?
TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising
Show answer and example
Answer: Dynamic codes address live content, multiscale history captures intent, and intermittent online optimization addresses reward-policy drift. One component cannot cover all three.
Illustrative example: Product changes, immediate user intent, and bidding value affect different paths.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why separate live adaptation into code allocation, interest timescales, and intermittent policy updates?
TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising
Show answer and example
Answer: Item content, users, and policies drift differently. LSID refreshes assignments behind a stable vocabulary, IAG fuses temporal interests, and IOPO runs NTP between on-policy bursts. Bounded local gates are not an online GRPO loop.
Illustrative example: A changed product, shifted intent, and stale policy need separate fixes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Is stable LSID vocabulary the same as freezing item-to-code assignments?
TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising
Show answer and example
Answer: No. Token symbols can stay stable while assignments refresh. Freezing mappings also preserves path identities. Compatibility depends on which changes.
Illustrative example: The same digits can encode a stream on a new path.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does local TAGR run real GRPO bursts and intermittent NTP?
TAGR: Temporally Adaptive Generative Recommendation for Industrial Live-Streaming Advertising
Show answer and example
Answer: No live bursts or production value labels; only bounded adaptation and failure cases on static public data. Real scheduling records sampling policy, both rewards, and maintenance versions.
Illustrative example: Adding static losses does not execute a timed online GRPO update.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why combine ranking, generation, and offline reason in TGR?
Show answer and example
Answer: Industry needs scalable scoring and item/list generation at controlled latency. Offline reasoning supplies inputs without costly online rollouts; distinct modules are not one attention equation.
Illustrative example: Prepare reasoning offline, then generate and rank live candidates.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why put scalable ranking, hierarchical SID generation, and offline reason tokens in one framework?
Show answer and example
Answer: Ranking discriminates finely, SID generation spans items and pages, and offline tokens carry prepared reasoning online. Inspect generation paths, list objectives, and reasoning interfaces separately.
Illustrative example: Precompute interest explanations, generate a page from them, and rank without live long reasoning.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
What is the trade-off between offline reason tokens and live inference?
Show answer and example
Answer: Offline reduces critical-path latency but can age and miss abrupt context changes. Live reasoning is flexible but expensive. Compare inputs and update cadence.
Illustrative example: Yesterday's reasoning can miss today's trending topic.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does local path confidence reproduce production CCFormer?
Show answer and example
Answer: No. The public core omits private SID catalog, checkpoints, and live generation. Align level probabilities and list scores explicitly; proxy fusion is not deployment evidence.
Illustrative example: A working multi-level code score is not a complete page generator or ranker.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why quantize content into multilevel Semantic IDs?
Recommender Systems with Generative Retrieval
Show answer and example
Answer: Short discrete codes share meaning and support autoregressive generation. Content and quantization quality limit generalization, and codes must map to valid items.
Illustrative example: Similar items share early codes and differ at fine levels.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why share semantics via residual SID instead of random hierarchy, and still use a collision token?
Recommender Systems with Generative Retrieval
Show answer and example
Answer: Coarse centers and residual refinement can group related items, while finite codebooks still collide. A unique suffix resolves identity. Matched random IDs isolate hierarchy from semantic hierarchy; semantic IDs need not win.
Illustrative example: Gardening books can share a prefix and split by subject or final collision suffix.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does a collision token differ from the semantic prefix?
Recommender Systems with Generative Retrieval
Show answer and example
Answer: It disambiguates item identity when several items share a semantic code. An arbitrary unique suffix is not a new semantic level.
Illustrative example: Two similar videos can share three levels but require distinct final tokens.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does local TIGER rank with a score proxy or complete code probability?
Recommender Systems with Generative Retrieval
Show answer and example
Answer: Sum token log probabilities over valid item codes, without score fusion. Match codebooks/collisions in training and decoding; exclude invalid paths.
Illustrative example: Omitting a level changes the complete item's generation probability.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why encode business value in TSGR generation?
TSGR: Taobao Search Generative Retrieval
Show answer and example
Answer: Semantic-only retrieval followed by isolated pre-ranking separates retrieval from value. Global and query-conditioned codes plus joint VRM connect generation states with fine business ranking.
Illustrative example: Among semantically similar items, include transaction fit for the current query.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why assign global and query-conditioned value codes under one semantic prefix?
TSGR: Taobao Search Generative Retrieval
Show answer and example
Answer: Semantics groups relevance, while value differs overall and by query. Parallel codes and joint VRM combine generator state with item details without a disconnected pre-ranker. Public rating proxies are not transaction value.
Illustrative example: A middling camera accessory may be especially valuable for macro photography.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why retain global and query-conditioned value codes?
TSGR: Taobao Search Generative Retrieval
Show answer and example
Answer: Global summarizes broad value; conditional code expresses value for specific demand. Global can favor head items and conditional needs reliable query statistics.
Illustrative example: A bestseller may be worse for a specialist query than a niche product.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
What leakage must local TSGR IDs and VRM avoid?
TSGR: Taobao Search Generative Retrieval
Show answer and example
Answer: Use training-period value estimates and code assignments, align query conditions with item identity, and update VRM jointly under protocol. Never encode test conversion.
Illustrative example: Putting a future order amount into an item code leaks the prediction target.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use a flat UNIQUE code instead of residual levels?
UNIQUE: A Unified Retrieval and Ranking System for Large-Scale Feed Recommendation
Show answer and example
Answer: It avoids stagewise quantization error, using feedback towers, frequency correction, and EMA for one level alongside retrieval and ranking losses. Flat codes need not uniquely identify items.
Illustrative example: Retrieve one semantic bucket, then rank its items.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why use flat codes and forbid candidates from reading each other?
UNIQUE: A Unified Retrieval and Ranking System for Large-Scale Feed Recommendation
Show answer and example
Answer: Flat allocation avoids error accumulation and uses feedback, frequency correction, and EMA. Shared prefixes save user encoding; item/code isolation keeps scoring independent. Joint objectives connect retrieval and ranking; monitor use and collisions.
Illustrative example: Retrieve one-level code buckets and score each candidate against the same history, not its neighbors.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does shared-prefix-only candidate attention differ from setwise attention?
UNIQUE: A Unified Retrieval and Ranking System for Large-Scale Feed Recommendation
Show answer and example
Answer: Candidate isolation reuses user encoding and avoids peers changing scores. Setwise attention depends on the candidate set. Unified retrieval and ranking do not require item-to-item reads.
Illustrative example: Adding a candidate should not alter an existing candidate through peer attention.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Do straight-through quantization and balanced code usage establish retrieval quality?
UNIQUE: A Unified Retrieval and Ranking System for Large-Scale Feed Recommendation
Show answer and example
Answer: No. Straight-through preserves gradients and correction helps usage, not relevance. Three small seeds do not rebuild industrial indexes, P99, or online gains.
Illustrative example: Equally sized buckets can contain uniformly irrelevant mixtures.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why use generated SID traces as a ranking bridge?
Unifying Generative Recall and Multi-Objective Ranking in a Single Decoder-Only Sequence
Show answer and example
Answer: The generated path contains intermediate retrieval choices, beyond a shared encoder or final ID. A heterogeneous decoder reads the trace with item features.
Illustrative example: Rank with the semantic prefixes that led to the item.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why let ranking read SID traces but detach shared outputs and train LoRA?
Unifying Generative Recall and Multi-Objective Ranking in a Single Decoder-Only Sequence
Show answer and example
Answer: Paths supply retrieval evidence. Role-specific masks share forward information, while detached shared outputs and low-rank updates reduce backward interference.
Illustrative example: Rank using outdoor→camping→tent while adjusting only ranking LoRA for new scoring preferences.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Why do generation and ranking queries need different masks?
Unifying Generative Recall and Multi-Objective Ranking in a Single Decoder-Only Sequence
Show answer and example
Answer: Generation reads only earlier SIDs; ranking can read the full path and synchronized item tokens. Future code access would leak generation targets, while restricting ranking can hide useful evidence.
Illustrative example: Level-two generation cannot read level three, but ranking can.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How does ranking LoRA protect the shared generation trunk?
Unifying Generative Recall and Multi-Objective Ranking in a Single Decoder-Only Sequence
Show answer and example
Answer: Stop gradients through shared Q/K/V outputs in the ranking branch and train ranking-specific LoRA. This is not freezing everything or fully sharing gradients. Local scope excludes production beams and parallelism.
Illustrative example: Ranking loss changes LoRA without updating shared generation projections through that route.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why generate an attribute chain before SIDs?
Show answer and example
Answer: Explicit category, seller, and brand context can bridge generative and discriminative representations. The chain guides content and does not establish independent language reasoning.
Illustrative example: Generate category and brand before the detailed semantic path.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why generate attributes before SID and constrain quantization capacity?
Show answer and example
Answer: Category, seller, and brand condition generation explicitly. Capacity prevents popular codes monopolizing the space; task context handles differing needs. Early attribute errors propagate, so interpretable steps do not guarantee correct items.
Illustrative example: Choosing dress shoes instead of sneakers early can derail the path despite precise later decoding.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does capacity-limited quantization differ from maximizing popular-code likelihood?
Show answer and example
Answer: Capacity limits reduce hotspots and disperse usage, while likelihood alone follows frequency. Evaluate relevance and balance together.
Illustrative example: Avoid crowding a bucket without randomly distributing items just to equalize counts.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Can future target behavior reveal attributes used as inputs?
Show answer and example
Answer: No. Attributes come from allowed item metadata. Target attributes can supervise generation, not be given as known answers. Public MovieLens lacks private multi-scenario serving.
Illustrative example: Supplying the true next item's brand leaks a clue.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why predict side features for an item not generated yet?
UniSGR-V2: Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation
Show answer and example
Answer: Item identity is unknown mid-decode. Predict continuous features by level and cross them with generation/ranking; auxiliary tasks prevent target collapse.
Illustrative example: Estimate likely attributes before emitting a brand-related code.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why predict target side information but mask semantic-to-prediction reads?
UniSGR-V2: Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation
Show answer and example
Answer: Target features are unavailable before decoding and estimates help each level. Prevent noisy estimates from propagating into earlier semantic states, but retain output conditioning. Ranking supervision anchors targets. Full training is not reproduced locally.
Illustrative example: Price/style estimates can guide output while staying out of prior semantic attention.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does a one-way mask differ from disabling predicted features?
UniSGR-V2: Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation
Show answer and example
Answer: Semantic tokens cannot attend to predicted tokens; prediction can read prior semantics, and output conditioning still uses predicted features. Disabling removes the mechanism.
Illustrative example: Prevent hidden noise feedback without withholding estimated features from generation heads.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why not replace the real auxiliary attribute tower with self-predictions?
UniSGR-V2: Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation
Show answer and example
Answer: A learnable target needs business labels; mutual prediction can collapse. Isolate future labels and use type-specific masks so semantic states cannot read true future attributes.
Illustrative example: Two networks can agree on a constant without learning attributes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Does the final commercial SID level just refine item semantics?
Unified Value Alignment for Generative Recommendation in Industrial Advertising
Show answer and example
Answer: No. It keeps two semantic levels and adds commercial attributes plus within-class bid bins. Interpret the commercial mapping rather than ordinary content clusters; proxy bids are not revenue.
Illustrative example: Similar ads can differ at the final level because of bid tier.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why combine commercial SID, value logits, and request-specific tries?
Unified Value Alignment for Generative Recommendation in Industrial Advertising
Show answer and example
Answer: Commercial IDs carry value features; fused logits and eCPM reward shape policy. The trie separately enforces current eligibility. High value does not mean legal or relevant; local value is a proxy.
Illustrative example: Block a high-bid but unavailable ad and score legal alternatives by both relevance and value.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does Generation-as-Ranking differ from independent post-generation ranking?
Unified Value Alignment for Generative Recommendation in Industrial Advertising
Show answer and example
Answer: Generation and value logits sum before normalization, so value changes every path probability. Post-ranking only reorders retrieved candidates.
Illustrative example: A high-value path can enter the beam earlier rather than be considered after recall.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
How distinguish local UniVA from real eCPM and personalized serving tries?
Unified Value Alignment for Generative Recommendation in Industrial Advertising
Show answer and example
Answer: Local network/RL/trie paths use deterministic bid/business proxies. Limit requests to currently eligible inventory and accumulate fused log probability; a globally valid ad may be illegal here.
Illustrative example: Mask an ad not eligible in the current region.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why grow WeGR preference optimization from short SID prefixes?
WeGR: Unified Generative Retrieval for Industrial Search Systems in WeChat
Show answer and example
Answer: Full paths yield sparse reward; coarse prefixes provide early signal. Align rewarded horizon with optimized tokens to avoid updating unevaluated suffixes.
Illustrative example: Learn broad category before requiring an exact item code.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why expand both DHPO reward matching and policy gradients gradually?
WeGR: Unified Generative Retrieval for Industrial Search Systems in WeChat
Show answer and example
Answer: Short matches densify initially sparse rewards and restrict updates to evaluated tokens. Expand to full codes over time. Multi-positive SFT and CoCo-VAE serve separate roles; local evidence is bounded.
Illustrative example: Reward outdoor first, then camping, then the full tent path without reinforcing wrong unevaluated suffixes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does CoCo-VAE collision loss differ from entropy?
WeGR: Unified Generative Retrieval for Industrial Search Systems in WeChat
Show answer and example
Answer: Collision measures overlap across examples; entropy measures one distribution's spread. Uniform distributions can have high entropy and completely overlap.
Illustrative example: Assigning every item uniformly across all codes is not discriminative.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does WeGR refresh low-utilization codes at every layer?
WeGR: Unified Generative Retrieval for Industrial Search Systems in WeChat
Show answer and example
Answer: Refresh from first-layer hit EMA only. Keep deeper layers fixed for refresh, align DHPO prefix length to schedule, and add multisession-positive NLL per session. Full-sequence loss is not progressive horizon.
Illustrative example: At h=1, later codes must not receive full gradients from the prefix reward.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why generate X-Rec triggers on the item embedding sphere?
Show answer and example
Answer: Normalized continuous vectors query multiple regions directly without SID quantization or token-by-token decoding. Anchors condition flow toward valid item neighborhoods.
Illustrative example: Generate different interest directions and retrieve nearby catalog items.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why condition flow on normalized item space instead of generating SID tokens?
Show answer and example
Answer: Continuous triggers avoid code quantization and use ANN directly. Coarse anchors condition geodesic noise-to-item flow; tangent projection preserves geometry. Cache earlier history layers and denoise final-layer tokens. Multistep cost remains and local low-budget outcomes are negative.
Illustrative example: Generate camera/lens directions around a photography anchor rather than decoding integer IDs.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
How does spherical flow differ from Euclidean interpolation?
Show answer and example
Answer: Geodesic paths and tangent projection preserve normalization. Straight lines can leave the sphere. Reusing earlier history layers is a separate efficiency design.
Illustrative example: The midpoint of two unit vectors is generally not unit length.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Does local X-Rec have a GPU throughput receipt, and what runs?
Show answer and example
Answer: No. CPU runs scaled anchors, geodesic RFM, final-layer KV reuse, and spherical Euler. No industrial ANN, streaming, or online A/B; CPU timings are not production throughput.
Illustrative example: Caching history verifies skipped computation without proving A100 gains.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Does PailitaoMMSearch2.0 rewrite queries or directly generate items?
Show answer and example
Answer: It consumes the original image and free text and generates three-level SIDs that map to products. Decoding produces candidates. Some deployments still mix them with incumbent retrieval results; end-to-end generation does not remove every production module.
Illustrative example: Example: Upload a shirt and request matching pants; outputs are product IDs, not just a rewritten query for another engine.
Sections in the Chinese source: 背景与主要改动, 核心公式, 论文离线与线上效果. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why does Sample–Beam separate sampled reasoning from item beam generation?
Show answer and example
Answer: Serving returns an item set; sampling one response does not match that structure. Sample reasoning, then beam-expand the SID to train RL on a serving-like candidate set. Intent rewards and trajectories are still needed; beam search alone is not the full method.
Illustrative example: Example: Expand ten product codes under one rationale instead of sampling ten unrelated rationale–ID pairs.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Does more reasoning always improve PailitaoMMSearch2.0 retrieval?
Show answer and example
Answer: No. The 0.8B No-think variant has highest macro ER; 2B Low-think better balances overall quality and latency, and 4B varies by intent. Consider scale, intent and serving cost rather than generalizing a single optimum.
Illustrative example: Example: A clearly visible exact-match attribute may need no rationale, while a match with several constraints can benefit.
Sections in the Chinese source: 论文离线与线上效果. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Can a 0.58 percentage-point CTR gain be reported as 0.58% relative?
Show answer and example
Answer: No. Percentage points are absolute; relative change depends on baseline CTR. The paper's result is from full deployment. This repository records the work only, without model, private-data training or A/B; don't attribute production lift to a local stub.
Illustrative example: Example: 10%→10.58% is +0.58 points but +5.8% relative. This illustrates units, not the paper baseline.
Sections in the Chinese source: 论文离线与线上效果, 本地复现与边界. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Basics
Why keep SIDs during PinGER training but remove historical SIDs at serving?
PinGER: Token-Efficient Generative Retrieval with Semantic IDs
Show answer and example
Answer: Asymmetric masking sends historical item information forward only through dense tokens. Historical SID positions are not read by other items or dense states, so removing those positions does not alter retained dense states. Dense input can still incorporate SID features.
Illustrative example: Example: A historical item occupies three SID positions and one dense position during training. Keeping only the dense position can preserve its attention output if inputs match.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Core mechanism
Why isn't prefix diversity just subtracting a constant for duplicate next tokens?
PinGER: Token-Efficient Generative Retrieval with Semantic IDs
Show answer and example
Answer: Penalty depends on longest common prefix depth between parent beams and accumulated chosen slots, including the same parent. Deeper shared prefixes penalize repeated subtrees more. The next token alone drops hierarchy.
Illustrative example: Example: Parents (1,2) and (1,3) share depth one; (1,2) with itself shares depth two. After picking its child, penalties differ.
Sections in the Chinese source: 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Method comparison
Does improved online interest coverage guarantee higher offline recall?
PinGER: Token-Efficient Generative Retrieval with Semantic IDs
Show answer and example
Answer: No. Increasing lambda from 0 to 3 increases distinct@1 but lowers R@100 in the paper. A stronger online penalty can still suit its objectives/settings. Do not conflate offline tables with production A/B under a different beam width.
Illustrative example: Example: 100 items from one category may hit an established preference but miss other interests. Diversity trades metrics off.
Sections in the Chinese source: 论文离线与线上效果. The example illustrates the mechanism.
Search, ads, and recommendation / Generative retrieval and reasoning-based recommendation
Implementation details
Why does PinGER DPO accumulate every prefix and retain an NTP anchor?
PinGER: Token-Efficient Generative Retrieval with Semantic IDs
Show answer and example
Answer: Per-level loss gives earlier SID decisions preference signal; using only full IDs changes the objective. NTP limits drift. Reference margin offsets the logistic input, not a hard stop-gradient for correct ranking. Local checks are formula-only.
Illustrative example: Example: For three levels sum losses for prefixes 1, 1–2 and 1–3, then add NTP. Tripling only the final loss differs.
Sections in the Chinese source: 核心公式, 本地复现与边界. The example illustrates the mechanism.
Topic guide and reading order
Start with this question¶
What changes when items are represented as tokens?
Takeaway¶
Generative retrieval predicts item codes conditioned on the user. Create catalog-recoverable identifiers, learn the code sequence distribution, and constrain decoding to eligible items. TIGER connects quantization to autoregressive retrieval, COBRA cascades sparse codes and dense representations, and PLUM continues pretraining an existing LM on recommendation data. Preference optimization and reasoning tokens change training or search. PinGER retains SID labels at every level during training but masks later history to read only dense tokens, so prior SIDs can be removed at serving. Input cost, prefix coverage, and catalog validity are different contracts.
Example¶
Suppose the catalog contains codes (3,7) and (3,9), but the model gives (3,5) high probability. A plausible-looking code is not an eligible item. Constrain decoding to the catalog and handle collisions or retain a later disambiguation path.
Common pitfall¶
Lower token loss need not raise Recall. Wider beams cannot recover items excluded by a bad codebook or prefix constraint. Some papers generate whole lists; classify by the main generation mechanism and see reranking for slate value. Scaled local training is not production-scale reproduction.
Reading order¶
Read TIGER for discrete ID generation, COBRA for sparse–dense cascades, and PLUM for continued pretraining of an existing LM. All have local core pipelines, but TIGER and PLUM did not verify final local retrieval gains.
- Recommender Systems with Generative Retrieval · Original paper
- Sparse Meets Dense: Unified Generative Recommendations with Cascaded Sparse-Dense Representations · Original paper
- PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations · Original paper
Check your understanding¶
Why can a correctly formatted three-level SID still fail retrieval?
Show suggested answer
Format guarantees length and vocabulary membership only. The combination can be absent, ambiguous, or irrelevant. Check catalog reachability, collision handling, coverage, and ranking on an isolated test set.