Automated research and efficient serving¶
简体中文 · English
Search, ads, and recommendation / 76 questions · 19 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
76 questions · 19 papers
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why search cross-stage recipes instead of one learning rate?
AgenticRecTune: Multi-Agent with Self-Evolving Skillhub for Recommendation System Optimization
Show answer and example
Answer: Retrieval, fusion, and reranking shape each other's distributions. Agents propose and review quality/diversity/risk across the recipe, with evidence for each stage and end-to-end effects.
Illustrative example: Diversifying ranker scores cannot help if retrieval never provides varied categories.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why require Critic, SkillHub, and real feedback after an Actor proposes a winner?
AgenticRecTune: Multi-Agent with Self-Evolving Skillhub for Recommendation System Optimization
Show answer and example
Answer: Proposals are hypotheses. Critic checks feasibility, runs supply evidence, and Insight/Skill record conditions and failures. Self-ratings are not results. Local search is bounded and selection must isolate test.
Illustrative example: Record a diverse but over-budget configuration so future rounds avoid repeating it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does SkillHub differ from restarting each round with the same prompt?
AgenticRecTune: Multi-Agent with Self-Evolving Skillhub for Recommendation System Optimization
Show answer and example
Answer: It retains auditable feedback-backed constraints and strategies, reducing repeated failures. One high score is not automatically reliable and transfer depends on context.
Illustrative example: Carry forward the finding that one diversity setting hurts new users.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
How prevent test tuning across three local rounds?
AgenticRecTune: Multi-Agent with Self-Evolving Skillhub for Recommendation System Optimization
Show answer and example
Answer: Actor proposes bounded genomes and Critic selects only on validation, then saves evidence. Run test once after final selection. No real online authority is involved.
Illustrative example: Do not switch winners after seeing a disappointing final test score.
Sections in the Chinese source: 背景与主要改动, 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why does AutoLR's long-term state machine distinguish offline evaluation, real A/B testing, and Launch Review?
AutoLR: Automating the Path from Research to Launch Review in Industrial Recommender Systems
Show answer and example
Answer: Offline results apply only under their data protocol; real user effects and deployment resource constraints need separate verification. The state machine separates proposals, experiments, reviews, and promotion, records failures and budgets, and increases the evidence at each stage. LLM reasoning or code generation cannot grant approval.
Illustrative example: An optimizer with better validation but excess memory stops offline. A candidate with real experiment evidence can enter launch review, not automatically become the live champion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does AutoLR not let the LLM directly save its preferred idea as the long-term champion?
AutoLR: Automating the Path from Research to Launch Review in Industrial Recommender Systems
Show answer and example
Answer: Noisy proposals and deliberations can compound when language judgments alone make KEEP decisions. The LLM does semantic reasoning; a deterministic controller handles budgets, metric extraction, guardrails, and state transitions. Only evidence passing the relevant experimental gates can update the champion, and a proxy win does not bypass later A/B testing or Launch Review.
Illustrative example: If an LLM suggests an optimizer whose offline benefit is unstable, log the proposal and failure and retain the old champion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
What trade-off does AutoLR's disagreement penalty make compared with choosing only for exploration value?
AutoLR: Automating the Path from Research to Launch Review in Industrial Recommender Systems
Show answer and example
Answer: Pure exploration favors unknown, risky ideas. Scoring existing evidence, exploration uncertainty, and expert disagreement gives conflict an explicit cost. Disagreement does not establish error; it calls for more evidence or lower budget priority. The local run did not beat the baseline in three rounds and could retain the champion.
Illustrative example: Of two equally novel ideas, test the broadly accepted one first under a tight budget and gather evidence about the contested one.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
How does local AutoLR resume a disk ledger without using historical test scores for promotion?
AutoLR: Automating the Path from Research to Launch Review in Industrial Recommender Systems
Show answer and example
Answer: Proposals can see research evidence and the completed validation ledger. Run one real backward-pass check, train under a fixed budget, and evaluate test only once after selection. Restore candidate, review, and validation state, keep `online_authorized` false, and do not feed test results back as selection rewards.
Illustrative example: After an interruption, resume round three from prior validation records. If the final test regresses, report it instead of feeding the score into the proposal prompt and selecting again.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why does CORAL require structured objectives and budgets rather than free-form LLM optimization advice?
CORAL: An LLM-Native Harness for Production Recommender Systems
Show answer and example
Answer: A system must verify, execute, and compare configurations. Budgets define legal allocations and objectives translate observations into feedback. A successful loop is not by itself production causal evidence.
Illustrative example: Asking for more retrieval compute is not executable until channels and amounts are specified and checked against the cap.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does CORAL project configurations onto a budget-feasible set and retain only recent experiment memory?
CORAL: An LLM-Native Harness for Production Recommender Systems
Show answer and example
Answer: LLM proposals can contain negative allocations or exceed quotas. Projection creates executable candidates before real feedback informs the next round. Short memory helps adapt to change and limits stale guidance but does not justify deleting audit records. Feasible proposals still need quality validation.
Illustrative example: If three retrieval allocations exceed a request cap, adjust them before testing. After traffic shifts, an old optimum should not automatically dominate.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
When is CORAL's short memory preferable to retaining the all-time best configuration?
CORAL: An LLM-Native Harness for Production Recommender Systems
Show answer and example
Answer: Recent feedback is more useful when the environment shifts; all-time maxima assume greater stability. CORAL updates from recent observations under projected constraints, potentially forgetting valuable long-run experience. A small proxy score cannot resolve the trade-off universally.
Illustrative example: A holiday ad mix can be poor afterward. Recent evidence should matter, while durable safety constraints should not be forgotten.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why not clip each CORAL allocation separately when projecting onto nonnegative values under a total budget?
CORAL: An LLM-Native Harness for Production Recommender Systems
Show answer and example
Answer: Per-coordinate clipping fixes negative values but not the coupled sum bound B. Joint projection enforces both. Store the executed configuration with its observations, not the infeasible proposal. The five-round local run verifies constraints and loop executability only.
Illustrative example: Three individually legal allocations of 6 total 18, exceeding a cap of 10. Adjust together and record what actually ran.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why can effective training time be low despite saturated GPUs?
Optimizing Effective Training Time for Large-Scale Recommendation Systems
Show answer and example
Answer: ETT counts wall-clock time actually training on new data. Init, compilation, save, publishing, and recovery extend the denominator. Kernel improvements do not fix all pauses. Local lifecycle checks do not estimate production gains.
Illustrative example: Twenty new-data minutes in an hour is about one-third even if GPUs saturate during those minutes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
How does stage accounting choose between optimizing compilation, recovery, and kernels?
Optimizing Effective Training Time for Large-Scale Recommendation Systems
Show answer and example
Answer: Separate new-data training from lifecycle losses, then identify avoidable time and owners. If training occupies little of the run, reducing interruptions can matter more than faster operators.
Illustrative example: Cutting one recovery in a run with ten training minutes and 30 recovery minutes can beat a 10% kernel speedup.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Why can ETT, stable samples/s, and MFU suggest different priorities?
Optimizing Effective Training Time for Large-Scale Recommendation Systems
Show answer and example
Answer: Throughput measures training speed; MFU measures compute utilization; ETT measures new-data share over the full lifecycle. More failures or compilation can erase faster kernels.
Illustrative example: Steps can be 20% faster while frequent restarts reduce daily progress.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why define overlap and recovery replay in ETT?
Optimizing Effective Training Time for Large-Scale Recommendation Systems
Show answer and example
Answer: Use actual wall time and count only training on new data. Do not double-count asynchronous save overlap or count replayed old batches as progress. Attribution can overlap without changing ratio accounting.
Illustrative example: Five overlapping minutes do not make an hour 65 minutes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why can a negative result pass EvoPilot Verify?
Verify, Don't Trust: Agentic Model Development for Video Discovery Retrieval at Scale
Show answer and example
Answer: Verify checks artifact integrity and comparison protocol, not performance direction. A matched, complete regression is valid evidence, and human Review checks interpretation and acceptance. Do not call verification a gain or discard a real negative result.
Illustrative example: An isolated interaction head that lowers hit rate is negative evidence; a gain after also changing data is not attributable.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does EvoPilot treat a matched two-arm comparison, not a successful training job, as evidence?
Verify, Don't Trust: Agentic Model Development for Video Discovery Retrieval at Scale
Show answer and example
Answer: One artifact cannot attribute improvement. EvoPilot matches base, data, evaluator, and output depth, allowing only the approved treatment and checking actual artifact state and provenance. Extra changes invalidate comparison; verification can pass for a negative result and is not release approval.
Illustrative example: A new interaction layer trained twice as long cannot claim sole credit until budgets are matched.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Why is reusing a high-quality historical baseline not necessarily a matched treatment comparison?
Verify, Don't Trust: Agentic Model Development for Video Discovery Retrieval at Scale
Show answer and example
Answer: Its base, data, evaluator, or output depth may differ. Match both arms so the approved treatment is the only actual change. More seeds estimate variance but cannot fix a mismatched comparison.
Illustrative example: A model with ten output layers versus a five-layer historical baseline did not only change its interaction head.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why read EvoPilot final state and provenance from actual artifacts rather than scheduler success?
Verify, Don't Trust: Agentic Model Development for Video Discovery Retrieval at Scale
Show answer and example
Answer: A job can partially fail, use the wrong config, or leave stale files. Missing final state, version, or actual differences must fail closed. The local check rejects output-depth mismatch, demonstrating validation of execution rather than declarations.
Illustrative example: A completed job with missing metrics cannot reuse last round's JSON as current evidence.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why does EvoRec distill optimization skills as well as evolving models?
EvoRec: Self-Evolving Agentic Recommender Systems
Show answer and example
Answer: Code alone loses what was attempted and where it worked, leading to repeated failures. Skill Evolver summarizes durable experiments to inform future Research and Code Agent proposals. A skill is bounded evidence, not a rule exempt from verification.
Illustrative example: Record that strengthening content helps under a validated short-history condition, not just the final two-tower model.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
What does EvoRec's Skill Evolver evolve beyond preserving final model code?
EvoRec: Self-Evolving Agentic Recommender Systems
Show answer and example
Answer: Code and weights do not record how a useful change was found or under which conditions. Skill Evolver distills reusable optimization skills from durable experiment memory for future Research and Code Agents. Skills still require actual execution and validation before generalization claims.
Illustrative example: A sampler helps only the long tail; remember both effective and failed slices, and test on the next dataset rather than copying the champion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does EvoRec skill memory change exploration compared with fixed grid search?
EvoRec: Self-Evolving Agentic Recommender Systems
Show answer and example
Answer: A fixed grid repeats predefined configurations; remembered skills can reprioritize or combine methods from prior feedback. Competition among a few preset skills validates only bounded control flow, not open-ended invention. Select on validation; test must not guide iteration.
Illustrative example: A skill library can prioritize a useful representation transform instead of running ten fixed trials; three skills do not prove arbitrary architecture discovery.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why retain data protocols and failure conditions in EvoRec memory?
EvoRec: Self-Evolving Agentic Recommender Systems
Show answer and example
Answer: A winning name cannot establish applicability. Bind the candidate to validation, observations, and constraints, including failures, and execute real operators when reusing skills. A registry label is not integration, and three local generations establish only the tested space.
Illustrative example: Record better matched-budget results on sparse histories and that long histories remain unverified, rather than declaring content towers always better.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why require executable skill I/O contracts in EvoSkillRec?
EvoSkillRec: Skill-Genome Evolution for Recommender Architecture Discovery
Show answer and example
Answer: Natural-language names do not ensure composability. Types make genomes executable and uniformly evaluable but are only the first check; semantics and recommendation quality need validation and promotion separately.
Illustrative example: A sequence encoder can feed a vector head, but a candidate-set consumer needs an explicit conversion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why type-check adjacent skills in a genome instead of chaining high-scoring modules arbitrarily?
EvoSkillRec: Skill-Genome Evolution for Recommender Architecture Discovery
Show answer and example
Answer: Individually good modules may have incompatible shapes and semantics. Check input/output contracts, construct executable candidates, evaluate validation, and store only promoted combinations. Names and types alone do not integrate a skill; three local seeds check composition and state transitions, not capability rankings.
Illustrative example: An item-vector producer cannot feed a full-history consumer without a suitable adapter and semantic validation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does validation promotion protect EvoSkillRec's reuse library versus keeping every skill?
EvoSkillRec: Skill-Genome Evolution for Recommender Architecture Discovery
Show answer and example
Answer: Only innovations exceeding a baseline threshold become reusable, reducing propagation of untested or harmful modules. The threshold is still bounded by budget and data, and neither type checks nor repeated test selection establish quality. Keep failures as failures.
Illustrative example: Record a shape-correct module that lowered validation, but do not promote it as a default skill.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why is matching final tensor width insufficient for skill type checks?
EvoSkillRec: Skill-Genome Evolution for Recommender Architecture Discovery
Show answer and example
Answer: B×d user vectors, B×C×d candidate tensors, and B×T×d sequence states have distinct roles. Check batch, candidate, and time semantics, then execute and evaluate. Local state-transition diagnostics do not rank capability.
Illustrative example: Broadcasting one user vector over all candidates can run but loses candidate differences.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why is feature retirement a lifecycle task rather than an importance ranking?
Show answer and example
Answer: Features may feed multiple heads and systems, and training can restore reliance. Audit time stability, joint deletion, retraining, online evidence, and lineage before retiring all consumers.
Illustrative example: The main click head may not use a field that fraud models still require.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why require joint perturbation, retraining, and consumer review when each feature seems unnecessary alone?
Show answer and example
Answer: Redundant features compensate during one-at-a-time tests. Check weak dependence over time and across heads, then joint removal and retraining, followed by every downstream consumer. One neutral run is not deletion authority.
Illustrative example: Age and age buckets can substitute for each other, yet deleting both can hurt new-user tasks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
What do frozen perturbation and retraining answer separately?
Show answer and example
Answer: Perturbation measures current reliance; retraining tests adaptation to absence. Neither covers all online effects. Redundancy can hide reliance, and retraining does not erase a failed time gate. Local three-seed baseline retention is a valid negative.
Illustrative example: Age removal can hurt a frozen model but recover after retraining; joint removal can hurt despite harmless single deletion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why can signed_change be negative, and how does VirtualBatch isolate frozen dependence?
Show answer and example
Answer: Higher-is-better perturbation minus baseline is negative for damage. Reuse dense/sparse/ragged inputs and perturbation maps while switching references; parameter digests rule out updates. Joint effects cannot be summed from individual effects.
Illustrative example: AUC 0.80→0.79 shows harm, not benefit; training during the probe would change its meaning.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why read the same representation in training, evaluation, and serving for Memory Layer?
Memory Layer: Train the In-Model Cache for Recommendation Models
Show answer and example
Answer: Using fresh tower outputs only in training and old external cache online creates mismatch, with misses another distribution. Training writes the internal table; scoring reads it consistently and retains always-on features on misses. Record missingness and age because consistency does not ensure freshness.
Illustrative example: Illustration: Reading one shared table avoids training on the latest movie vector while serving a different version, but entries can still be stale.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why embed the item cache as a sparse model parameter table in Memory Layer instead of publishing it externally?
Memory Layer: Train the In-Model Cache for Recommendation Models
Show answer and example
Answer: Fresh tower outputs in training and old cache values at serving differ, and a miss bypass creates a third distribution. Model writeback and reads let training adapt to cache semantics; always-on features score misses. This changes dependencies and train–serve consistency, not guaranteed freshness or zero read cost.
Illustrative example: Illustration: Training on today's item vector but serving yesterday's can drift. An internal cache aligns the read path, while creator or topic features still score misses.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does internal writeback change consistency and maintenance versus periodic full external cache publication?
Memory Layer: Train the In-Model Cache for Recommendation Models
Show answer and example
Answer: Coupling writes to training events avoids mismatch from a separate publisher. External rollout gives central control but can lag and miss items. Internal tables still have capacity, concurrency, and versioning concerns; always-on is a miss fallback. The local structure check does not establish Meta throughput.
Illustrative example: Illustration: Training updates item A immediately while unseen items stay old; periodic publishing changes the whole table at once. Hit rate alone cannot rank these schedules.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why is Memory Layer's η=1 writeback not ordinary small-step SGD on M[i]?
Memory Layer: Train the In-Model Cache for Recommendation Models
Show answer and example
Answer: It overwrites the entry with the tower output rather than moving an old value gradually along a gradient. Read from the table, zero the missing component, and retain general attributes. Check write error, coverage, and staleness; calling the table trainable does not override assignment semantics.
Illustrative example: Illustration: If the new output is [1, 2, 3], the entry should equal it after writeback, not move one tenth of the way from the old value.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why isn't NOVA's architecture gradient an ordinary backpropagation gradient?
Show answer and example
Answer: It summarizes architecture changes, diagnostics, and metrics as an agent control signal. Directional feedback is not a derivative of a differentiable parameter objective; it cannot differentiate code end to end or guarantee improvement.
Illustrative example: Illustration: 'Widening exceeded budget; changing the gate hurt validation' guides a proposal without defining derivatives for Python characters.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does NOVA separate structural semantics, execution, offline effectiveness, and online impact?
Show answer and example
Answer: Runnable code can still violate intended architecture or harm quality. NOVA uses change history and diagnosis to propose updates, then increasingly expensive checks to reject obvious failures early. Offline success still requires independent online evidence; local execution is diagnostic only.
Illustrative example: Illustration: An incorrectly wired task head can pass tensor checks but fail semantics. A structurally correct change can still regress on validation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Why can't NOVA's semantic architecture checks replace ordinary runtime tests or vice versa?
Show answer and example
Answer: Shape-compatible code can violate task wiring or defining information flow. Semantic checks test intent, execution checks runnable behavior, and offline/online stages test value. Lower training loss does not justify skipping semantics. The local candidate workflow has no production A/B.
Illustrative example: Illustration: A purchase head wired to click labels can train and lower loss; semantic checks should catch it before deployment.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
What outputs should distinguish actual validation from simulated online impact after NOVA selection?
Show answer and example
Answer: Candidates, shape failures, validation scores, and promotion logs can be measured. Without traffic, online stages are simulations or diagnostics, not deployments. Use test only to evaluate the final selection, and record successful skills and prohibited directions in an auditable form.
Illustrative example: Illustration: Rejecting an intentionally bad shape demonstrates an execution gate. Passing simulated impact is not a user experiment.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why separate feature type from processing components in Prompt Generation?
Prompt Generation Technical Report
Show answer and example
Answer: Text, embedding, combo, and sequence say what the input is; preprocessing, projection, and merger say how to transform it. Orthogonal configuration composes without changing model code, but bad configuration can lose data or introduce skew.
Illustrative example: Illustration: A title and a behavior sequence can reuse component families with different settings; text does not imply one fixed pipeline.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why configure Prompt Generation's preprocessor, projector, and merger with templates?
Prompt Generation Technical Report
Show answer and example
Answer: Separate training and serving implementations drift. One protocol composes cleaning, projection, and fusion/compression with common interpretation. Merger changes token cost and information loss, not merely text assembly. Mean compression does not justify discarding all order.
Illustrative example: Illustration: Configure cleaning, projection, and pooling for one title token in both paths; truncating to ten words only on one side creates skew.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
What are the defaults and costs of parameterless mean merger versus learned compression?
Prompt Generation Technical Report
Show answer and example
Answer: Mean pooling is simple, cheap, and consistent without new weights. It loses order and details. Learned compression is flexible but adds cost and overfitting. Compression ratio is not relevance evidence, and mean need not fit every feature.
Illustrative example: Illustration: Pool redundant item attributes, but averaging a history with negation and ordering can lose critical meaning.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why check PG_train(x,c)=PG_serve(x,c) by replaying raw serving features?
Prompt Generation Technical Report
Show answer and example
Answer: Matching JSON does not ensure tokenizer, dependencies, truncation, or missingness match. Replay inputs and compare final tensors with versioned interpreters/configurations. Validation selected Title but test regressed; shorter compression does not establish effectiveness.
Illustrative example: Illustration: If serving strips model numbers but training retains them, replay reveals skew despite the same configuration name.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why is RADAR's cached top-k a nomination rather than guaranteed exposure?
RADAR: Recall Augmentation through Deferred Asynchronous Retrieval
Show answer and example
Answer: It was selected under previous history and still competes with live candidates under current needs and eligibility. A cached score is neither exposure nor a click. Distinguish nominations to assess freshness and downstream value.
Illustrative example: Illustration: A cached movie can be filtered because the user watched it or now wants children's content.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why use asynchronous post-request ranking to supplement retrieval for the next RADAR request?
RADAR: Recall Augmentation through Deferred Asynchronous Retrieval
Show answer and example
Answer: A strong ranker cannot usually scan the entire catalog within request latency. RADAR does the expensive scan afterward, caches good candidates, and merges them with live retrieval next time. Old history makes caches stale, so live retrieval still captures new intent.
Illustrative example: Illustration: Precompute likely movies after one visit and add them on the next, while live retrieval uses newly observed clicks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does RADAR's prior-request cache differ from a predicted future pair-latent cache?
RADAR: Recall Augmentation through Deferred Asynchronous Retrieval
Show answer and example
Answer: RADAR caches selected item IDs under previous history. Pair-latent caching stores intermediate interactions for specific user–item pairs. Reuse, misses, and invalidation differ, so one hit rate cannot represent both costs or establish a quality ordering.
Illustrative example: Illustration: Reusing a movie list saves nomination; intermediate vectors are different artifacts and may still need current scoring.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why deduplicate and recheck eligibility when merging RADAR live and cached top-k?
RADAR: Recall Augmentation through Deferred Asynchronous Retrieval
Show answer and example
Answer: Old items may be unavailable, consumed, or ineligible. Merge by item ID and preserve provenance for incremental evaluation. Record cache generation time and history cutoff; the next target cannot enter the async job ahead of time.
Illustrative example: Illustration: Drop a listing that filled since yesterday and count a movie retrieved by both channels only once.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why asynchronously share black-box teacher logits across Rec-Distill students?
Rec-Distill: An Industrial Distillation Pipeline for Large-Scale Recommendation Models
Show answer and example
Answer: Running a large teacher for every student call is expensive. Reuse outputs generated during training and let students consume them on separate schedules. Sampling and freshness still need calibration and versioning. Black-box exchange reduces coupling but hides intermediate teacher states.
Illustrative example: Illustration: Two small models can consume one batch of teacher scores without running the teacher themselves, provided sample and version provenance are known.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why correct Rec-Distill teacher sampling probabilities and distill into an auxiliary tower rather than the serving main tower?
Rec-Distill: An Industrial Distillation Pipeline for Large-Scale Recommendation Models
Show answer and example
Answer: Different sampling makes logits represent different probabilities. Correct to the student convention, then train aux on labels and distillation while transferring through shared layers. Main only uses true labels and serves, reducing direct calibration distortion. Teacher quality and freshness still matter.
Illustrative example: Illustration: A teacher downsampling negatives more aggressively cannot supply raw click probabilities unchanged. Correct it and give soft supervision to aux.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
What does main/aux distillation protect versus directly fitting serving main to the teacher?
Rec-Distill: An Industrial Distillation Pipeline for Large-Scale Recommendation Models
Show answer and example
Answer: Main keeps the real-label objective, while aux learns both real and teacher labels and transfers indirectly through the shared backbone. This reduces direct calibration bias but is not full isolation. The strong local teacher still transferred negatively.
Illustrative example: Illustration: Aux can learn relative knowledge while main fits clicks; fitting uncorrected probabilities directly can copy the wrong baseline.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why report raw student and teacher metrics when the Rec-Distill transferability denominator is small?
Rec-Distill: An Industrial Distillation Pipeline for Large-Scale Recommendation Models
Show answer and example
Answer: η is student distillation gain divided by available teacher gain. Near zero, it is unstable. Teacher is not a serving baseline and arms need matching schedules and candidates. Report negative transfer instead of reframing lower head share as success.
Illustrative example: Illustration: Tiny student changes can yield large ratios when the teacher barely exceeds the student. Show all three raw metrics.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why aren't RecEvolve's knowledge base and runnable model artifacts interchangeable?
RecEvolve: A Knowledge-Driven Autonomous Agent System for Recommender Systems
Show answer and example
Answer: The knowledge base stores proposals, protocols, findings, and failures for later choices. Artifacts store parameters and configuration for execution. Promotion evidence must link to the specific runnable version.
Illustrative example: Illustration: 'The content branch won' cannot be rerun without config, and bare weights do not show how they beat the champion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why put gates, independent validation, and rollback outside the RecEvolve research agent?
RecEvolve: A Knowledge-Driven Autonomous Agent System for Recommender Systems
Show answer and example
Answer: Agents can propose useful mutations or exploit a metric. External gates reject invalid candidates, then independent validation compares against the champion. Atomically promote only evidence-backed gains; otherwise retain the incumbent and record failure. Keep test out of the search loop.
Illustrative example: Illustration: Reject an illegally sharp low-temperature candidate; keep the champion if another candidate runs but scores worse on validation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Why can an external critic gate reduce metric gaming compared with agent self-evaluation?
RecEvolve: A Knowledge-Driven Autonomous Agent System for Recommender Systems
Show answer and example
Answer: Self-review can favor proposals or shortcuts. An executable external gate fixes allowable changes and independent validation decides promotion. It governs evidence, not innovation, and test cannot feed routine search.
Illustrative example: Illustration: Reject an extreme temperature by a fixed constraint rather than accept the agent's assurance it did not cheat.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Why finish validation artifacts before atomically updating the RecEvolve champion pointer?
RecEvolve: A Knowledge-Driven Autonomous Agent System for Recommender Systems
Show answer and example
Answer: Incomplete training, missing metrics, and interrupted writes must not overwrite a working incumbent. Verify terminal state and J before switching the pointer. No promotion is a valid outcome, and small local effects do not establish online gains.
Illustrative example: Illustration: A half-written checkpoint should leave the champion pointing to the old complete model.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why discretize RecHarness architecture changes into finite arms?
RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
Show answer and example
Answer: Explicit actions support gain and uncertainty estimates for budget allocation, with feedback guiding future trials. The bandit manages experiments, not direct recommendation. Predefined actions limit the search space.
Illustrative example: Illustration: Widening, gate replacement, and adding content are separate arms, not arbitrary novel code generated from scratch.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does RecHarness allocate experiments by gain and uncertainty rather than always choose the best observed architecture?
RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
Show answer and example
Answer: Greedy mean selection can abandon underexplored directions too early. Confidence bonuses let uncertain arms receive experiments and winners inform later candidates. It allocates finite research budget, not globally optimal architectures, and gains require one validation protocol.
Illustrative example: Illustration: An arm tried once may merit exploration against a slightly stronger arm tried ten times; final choice still needs independent test.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
When is UCB preferable to equal round-robin experiments?
RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
Show answer and example
Answer: It spends more on high or uncertain gains rather than repeatedly testing poor arms. Nonstationarity and unequal evaluation noise can distort estimates. Exploration does not correct unfair baselines or leakage.
Illustrative example: Illustration: An arm with five regressions can receive less budget than a promising arm, provided exploration avoids premature rejection.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
How handle RecHarness na=0 and multi-round records without fabricated trials?
RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
Show answer and example
Answer: Prioritize untested arms or define infinite exploration explicitly. Increment counts only for real completed trials with fixed validation outcomes. Persist actual state on interruption; submission is not feedback. Small proxies do not establish production research throughput.
Illustrative example: Illustration: Record training failure as a failure, not a zero validation reward or successful completed trial.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
What are the units of computation in ROCS: one request and its candidates?
ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation
Show answer and example
Answer: A request contains user-side context. Candidates are separate items scored within it. They share user input but have separate features and outputs. More candidates do not mean more independent requests. Distinguish these axes to identify reusable versus per-candidate work.
Illustrative example: One user opening a page that scores one hundred items is one request with one hundred candidates, not one hundred user requests.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why does ROCS need candidate isolation to avoid redoing user computation for every candidate?
ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation
Show answer and example
Answer: A state that has read one candidate is not a common cache. Generalized Layer Masking preserves isolation and Deep Cross Attention delays candidate interaction, so a request representation is computed once. Kernel broadcasting further reduces copies. The local in-process microbenchmark compares repeated and shared encoding, not full production throughput.
Illustrative example: One request scores a hundred items. Encode the user independently, then broadcast to each item branch. If item A contaminates user state first, reusing it for item B leaks information.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Are request-representation sharing and IKBO's reduced on-device copying the same optimization?
ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation
Show answer and example
Answer: No. Model information flow makes representations shareable; device broadcasting moves a valid shared representation into candidate computation efficiently. Caching a user vector can verify the division of work, not a production broadcast kernel or throughput. Each layer needs its own implementation and measurements.
Illustrative example: First ensure candidate inputs cannot contaminate the user state. In-process cache timings do not replace GPU broadcast kernel measurements.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
Does local ROCS implement production GLM masks and IKBO CUDA broadcasting?
ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation
Show answer and example
Answer: No. It covers the division between shared representation and scoring, not a specialized kernel or Meta cluster. Architectural reuse and on-device broadcasting need distinct evidence, and throughput claims require measurement.
Illustrative example: A Python loop reusing one vector does not show that a GPU kernel shares loads.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Does Self-Evolving Rec's journal store model parameters or experimental knowledge?
Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents
Show answer and example
Answer: It records proposals, execution, and protocol-bound outcomes. This is distinct from checkpoint storage. A prose plan without runnable candidates and evaluation is not an experiment.
Illustrative example: Record a failed optimizer comparison so the next iteration avoids repeating it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why should the outer state machine control real A/B promotion?
Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents
Show answer and example
Answer: Offline agents cheaply screen ideas but cannot capture all user and serving constraints. The outer loop controls safety, resources, promotion, and journal feedback. Local loops do not replace live production A/B.
Illustrative example: Reject an offline winner with excess latency; record a later approved experiment so future rounds learn.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does bilevel optimization differ from a hyperparameter sweep?
Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents
Show answer and example
Answer: Inner training explores architecture, optimizer, or reward; outer governance manages online goals, resources, safety, and accumulated knowledge. Tuning can support the inner layer but does not replace the outer loop.
Illustrative example: A learning-rate sweep does not decide whether to spend live traffic or archive failures.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
When does a local evolve operator count as integrated?
Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents
Show answer and example
Answer: The controller must execute changes, train and evaluate on isolated validation, and leave traceable state/journal entries. Registration or simulated plans are not execution or real A/B.
Illustrative example: An optimizer suggestion that cannot run remains a proposal.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Why predict future user–item pairs before computing SOLARIS latents?
SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling
Show answer and example
Answer: Computing all pairs online is expensive. Predict likely pairs and asynchronously precompute them for lightweight consumption. Misses need fallback and wrong guesses waste budget.
Illustrative example: Prepare representations for a shortlist instead of an entire catalog.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why cache predicted pair latents instead of one user vector?
SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling
Show answer and example
Answer: Deep interactions depend on a particular item. Predict likely pairs, compute asynchronously, use hits and fallback on misses. Coverage, freshness, and budget matter. Future outcomes can supervise training, not online selection.
Illustrative example: Precompute ten likely products, but serve an unexpected one through fallback.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
How does a latent cache differ from a final list cache?
SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling
Show answer and example
Answer: A latent is a middle feature the lightweight ranker can combine with current inputs. A cached list fixes ordering. Latents still age and need version consistency.
Illustrative example: Reusing a latent with today's price can change yesterday's order.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
What should a SOLARIS cache key capture?
SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling
Show answer and example
Answer: User/item identity, model and feature versions, and validity; define hit and fallback paths. An abstract implementation or hit rate does not prove service latency.
Illustrative example: Do not silently reuse a latent from a previous model version.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Basics
Do UG-Sep user and candidate tokens describe two users?
Compute Only Once: UG-Separation for Efficient Large Recommendation Models
Show answer and example
Answer: No. One request has a shared user block and an item-specific candidate block. Isolation controls information flow, not user groups.
Illustrative example: Several candidate blocks can reuse the same user's history.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Core mechanism
Why block candidate-to-user flow and then compensate?
Compute Only Once: UG-Separation for Efficient Large Recommendation Models
Show answer and example
Answer: Isolation makes user encoding reusable; it may weaken bidirectional expressiveness, so compensation restores interactions in the item scoring path only. Do not cache compensated state as public.
Illustrative example: Compute one item-free user state for 100 candidates, then apply separate per-item compensation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Method comparison
Can Information Compensation turn candidate-conditioned state into reusable cache?
Compute Only Once: UG-Separation for Efficient Large Recommendation Models
Show answer and example
Answer: No. It restores candidate-specific scoring interactions. Shared state must remain candidate-independent, so caching compensation for another item reintroduces contamination.
Illustrative example: Item A's compensated state is not general user state for B.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Automated research and efficient serving
Implementation details
How test whether the UG-Sep mask permits safe sharing?
Compute Only Once: UG-Separation for Efficient Large Recommendation Models
Show answer and example
Answer: Fix user and vary candidates: protected user representations must stay unchanged while item output may change. Check attention and TokenMixer, not only masks. No production kernels/QPS.
Illustrative example: A masked attention path is insufficient if the mixer leaks candidate information back.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Topic guide and reading order
Start with this question¶
When is a better offline method usable under real requests and continued iteration?
Takeaway¶
Move compute to where it is affordable: distillation teaches a light student, request-state sharing avoids repeated encoding, and asynchronous caching removes work from the request path. Automated research tracks hypotheses, execution, validation, and conclusions. Proposing a candidate and actually running and evaluating it are separate. Both research and serving need verifiable execution and independent evaluation.
Example¶
An illustrative user encode costs 2 ms and a candidate interaction 0.02 ms. Re-encoding for 100 candidates costs about 202 ms; encoding once and scoring them costs about 4 ms. Real results depend on parallelism, cache, bandwidth, and operator overhead. This is not a production speedup.
Common pitfall¶
Compare a distilled student with a same-schedule student, not with the stronger teacher. In-process timing is not GPU-cluster throughput. Search selects on validation only, and cost-closed references must not become executable candidates.
Reading order¶
Read Rec-Distill for training-to-serving transfer, ROCS for request reuse, and Self-Evolving RecSys for candidate execution, validation selection, and log feedback. Local mechanisms run, while production serving and A/B remain separate limits.
- Rec-Distill: An Industrial Distillation Pipeline for Large-Scale Recommendation Models · Original paper
- ROCS: Request-Oriented Compute Sharing for Efficient Large-Scale Recommendation · Original paper
- Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents · Original paper
Check your understanding¶
Does writing a new registry name close the research loop if the controller cannot execute or evaluate it?
Show suggested answer
No. Build the candidate, execute its path, obtain comparable validation results, and record failures and limits. A name or proposal is not evidence of improvement.