Learning signals, multitask learning, and feedback bias¶
简体中文 · English
Search, ads, and recommendation / 144 questions · 36 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
144 questions · 36 papers
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
What do Attribution Sets reveal and what do they leave unspecified?
Statistical Learning from Attribution Sets
Show answer and example
Answer: They constrain which clicks may be linked to a conversion, but provide no unique true match; different sets can overlap. Set statistics can support risk estimation, not a definitive label for each click. Keep that distinction separate from true individual attribution.
Illustrative example: Knowing that a purchase could follow any of three impressions does not justify labeling all three as positives or arbitrarily choosing one.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why not randomly label one click positive when the conversion attribution is only known as a set?
Statistical Learning from Attribution Sets
Show answer and example
Answer: Random pairing invents a precise label, and overlapping sets can affect the same event repeatedly. The method splits binary loss into a label-independent term and a label-dependent moment, estimating risk from set statistics without fabricating individual matches. The printed coefficient for multi-element sets failed a local constant-function check, so the counterexample is retained and the estimator is not fully validated.
Illustrative example: Three impressions may be associated with a purchase and two may also appear in a different attribution set. Choosing one arbitrarily changes the supervision; set statistics also need consistency checks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How do the assumptions of Attribution Sets risk decomposition differ from maximum-prior pseudo-labeling?
Statistical Learning from Attribution Sets
Show answer and example
Answer: Pseudo-labeling chooses a hidden match before training as if it had full supervision. Risk decomposition keeps the match unidentifiable and uses population moments and a position prior for the label-dependent term. It avoids claiming individual ground truth, but still requires a valid estimator and inputs. The local counterexample is a limited check of the printed coefficient, not a corrected replacement theory.
Illustrative example: A prior that favors the first impression does not make it the true positive. If the set estimator fails the constant-function check, audit it rather than reporting an unbiased result.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why must an Attribution Sets implementation not silently clip singular denominators or renormalize by the window count?
Statistical Learning from Attribution Sets
Show answer and example
Answer: The binomial tail probability, selection indicator, and fixed denominator together define the paper's estimator. Changing the denominator changes the statistical object. Fail explicitly at singular boundaries and distinguish known population moments from sample plug-in estimates. Keep the multi-element counterexample visible rather than masking it with a numerical fallback.
Illustrative example: Replacing a zero denominator with a tiny positive number returns a finite result but not the paper's estimator. Report that its assumptions do not hold for that input.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does treatment interference arise in the RTB A/B logs studied by BAFF?
BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Tests
Show answer and example
Answer: Policy choices affect bidding opportunities and prices. An ad decision in one arm may change the competition the other policy actually faces, so A's logs are not automatically examples of what B would observe. Filtering approximately interference-free cases limits transfer; it does not make the arm labels interchangeable.
Illustrative example: When A raises an ad's bid, it can alter the competition. B may not have won the same opportunity at the same price, so treating the record as ordinary B training data imports A's policy effect.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does BAFF check both rank and bid-price differences?
BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Tests
Show answer and example
Answer: Similar ranks can still imply different win probabilities if bids differ; similar bids can still produce different exposure when ranks move. The two conditions remove A logs likely to affect policy B's decisions and reduce training interference. Retained samples are more transferable under these conditions, not evidence of a truly interference-free market.
Illustrative example: A similarly ranked ad may win because A bids much higher. Conversely, equal bids do not make logs interchangeable if a rank crosses the display boundary.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does BAFF's filtering differ from uniformly downweighting all A logs?
BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Tests
Show answer and example
Answer: Uniform downweighting preserves all samples, including opportunities severely affected by A. The two-condition filter rejects incompatible logs based on rank position under B and the bid difference. This can reduce interference at the cost of sample count; stricter thresholds are not always better and do not ensure unbiased survivors.
Illustrative example: Halving the weight of a log with similar prices but very different ranks still uses it. Filtering rejects it, but an overly strict filter can leave too little data and raise variance.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why does BAFF's bid-price distance count only the positive excess of A over B?
BAFF: Bid-Aware Filter Family for Mitigating Training Data Interference in RTB A/B Tests
Show answer and example
Answer: The paper uses `max(bpA−bpB,0)/bpA`, which measures upward price movement in that direction, not a symmetric absolute gap. Rank distance is the position in B divided by K. Keep the direction, normalization, and two separate thresholds.
Illustrative example: A bid of 10 versus B's 8 yields 20%; A's 8 versus B's 10 does not yield the same positive penalty. An absolute difference would change the filter.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
What reference points do the user, item, and request baselines represent in Baseline-Incremental?
Baseline and Incremental: User, Item, and Request Debiasing in Instagram Feed Ranking
Show answer and example
Answer: The user baseline captures customary response, the item baseline broad attractiveness, and the request baseline the current candidate pool's level. Increment scores show how a candidate stands out; raw scores keep absolute value. This is not causal uplift, and a different reference changes the ranking's meaning.
Illustrative example: A high-activity user's video click probability may only slightly exceed their norm, whereas a moderate probability for a less active user is more exceptional. Retain both absolute values.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why keep the raw prediction after subtracting a user or item baseline?
Baseline and Incremental: User, Item, and Request Debiasing in Instagram Feed Ranking
Show answer and example
Answer: The increment measures how far above normal a candidate is, while the raw score preserves absolute business magnitude. The method separately weights a nonlinear increment: compare probabilities in log-odds space and use same-unit differences for regressions. This is a scoring configuration, not causal uplift.
Illustrative example: A small lift over a low baseline can outrank a more valuable candidate on relative change alone; the raw score keeps the high baseline's value visible.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why use log-odds differences for probabilities but original-unit differences for regression?
Baseline and Incremental: User, Item, and Request Debiasing in Instagram Feed Ranking
Show answer and example
Answer: An equal absolute probability difference has a different meaning near zero or one; logit differences express change on the odds scale. Regression targets already have natural units. These distinct scoring responses are intentional and do not confer a causal interpretation.
Illustrative example: Click-through rates of 1% to 2% and 40% to 41% both gain one point but change odds differently; extra watch time can be compared directly in seconds.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why not implement Baseline-Incremental's demotion gate as the negative of its promotion gate?
Baseline and Incremental: User, Item, and Request Debiasing in Instagram Feed Ranking
Show answer and example
Answer: When the promotion amplitude is prediction p, it naturally vanishes near zero. Negating it would barely penalize the low-p candidates that most need demotion. Preserve the constant and gap amplitudes and piecewise limits from the source, explicitly clip probabilities before taking logits, and verify the gates separately.
Illustrative example: A candidate with p near zero receives almost no penalty from −p, while constant demotion can still suppress it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does CASI separate one retrieval per action from re-evaluation of subsets?
CASI: Credit Assignment via Set Intervention for Agentic Retrieval
Show answer and example
Answer: Reretrieval can change action results across subsets, mixing backend randomness with cooperation effects. Freeze action candidate snapshots first and then recombine them to compare marginal contributions over identical evidence. State assumptions about evaluation backend sensitivity.
Illustrative example: Removing one of two equivalent queries may leave the set unchanged. If reretrieval changes the results, redundancy and retrieval fluctuation are no longer distinguishable.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does CASI freeze retrieval snapshots and recombine subsets rather than split the set reward evenly?
CASI: Credit Assignment via Set Intervention for Agentic Retrieval
Show answer and example
Answer: Actions can complement or substitute for each other. CASI retrieves once per action, computes marginal value across subsets of fixed results, and shapes advantages with Shapley credit. This avoids repeated-retrieval noise but does not establish an identical unbiased gradient to the original set objective.
Illustrative example: If rewrites A and B retrieve the same products and C adds a new category, averaging overstates redundant actions; fixed-set recombination exposes C's contribution.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why are Singleton and LOO generally insufficient to recover CASI's Shapley credit with four or more actions?
CASI: Credit Assignment via Set Intervention for Agentic Retrieval
Show answer and example
Answer: Singleton observes individual values and leave-one-out observes removal from the full set. Shapley averages marginal contributions across all coalitions, including intermediate subsets with higher-order cooperation. Equal endpoint values do not fix intermediate values; additive cases need no extra intervention.
Illustrative example: Two queries may be useless alone but jointly cover a need, and a third can replace one. Singles or full-set removals can miss the dependency.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why jointly project CASI's bounded zero-sum advantages instead of clipping dimensions independently?
CASI: Credit Assignment via Set Intervention for Agentic Retrieval
Show answer and example
Answer: Independent clipping breaks zero sum and can shift the mean action advantage away from the original rollout advantage. Joint projection solves for a shared offset λ before clipping to satisfy both bounds and zero sum. It preserves the arithmetic action mean, not a token-length-weighted mean, and does not guarantee the original unbiased gradient.
Illustrative example: Clipping (2, −1, −1) to ±1 yields a negative sum. A common offset before clipping can meet both constraints.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does Causal Representation both retain outcome information and suppress confounding information?
Causal Representation Learning for Generalisable Recommendation
Show answer and example
Answer: Suppressing exposure information alone can remove genuine preference; preserving outcome prediction alone can exploit exposure shortcuts. The dual objective uses conditional outcome information and a confounding penalty to retain generalizable signals. These constraints do not establish causal identification without variable and data assumptions.
Illustrative example: Removing popularity entirely can lose demand information; keeping it unconditionally can copy the old exposure policy.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does deleting all exposure-related information not necessarily produce a good causal recommendation representation?
Causal Representation Learning for Generalisable Recommendation
Show answer and example
Answer: Some signals relate to both exposure and real outcomes. The information-theoretic objective balances outcome information conditional on confounders against dependence on exposure, aiming to preserve transferable information. Causal interpretation still depends on confounders and identification assumptions; distribution-shift metrics alone do not prove all noncausal information was removed.
Illustrative example: Geography affects both exposure and delivery feasibility. Distinguish targeting preference from real delivery effects instead of deleting every regional signal.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Where do causal representation constraints act compared with IPS weighting?
Causal Representation Learning for Generalisable Recommendation
Show answer and example
Answer: Representation constraints change what the encoder stores, while IPS changes how much observed samples contribute to loss. The former needs confounder representations and information estimates; the latter needs valid propensities and support. Proxy results do not establish that one is generally better.
Illustrative example: Weighting rare impressions does not stop the model reading popularity. Suppressing popularity does not create missing unexposed samples.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
How can an implementation of `I(g(T);Y|Z)−λI(g(T);Z)` avoid using target labels at serving time?
Causal Representation Learning for Generalisable Recommendation
Show answer and example
Answer: Y and Z can enter the training objective and estimator; the deployed representation must be computed solely from T available at prediction. The source reports no extra serving overhead after training, but the local public proxy does not prove that causal components were separated.
Illustrative example: Use clicks to train g(T), then compute it before the current click occurs. Concatenating the observed click at serving would leak the answer.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
What are the treatment and outcome in causal retrieval?
Deep-learning Causal Retrieval Optimization for Efficient e-commerce Distribution in Pinterest
Show answer and example
Answer: Treatment is whether the shopping candidate generator runs; outcomes are later business responses across events. Estimate the trigger/no-trigger difference for comparable users, not ordinary shopping-model accuracy. Both decisions must be sufficiently represented in the data.
Illustrative example: The question is whether running shopping retrieval changes purchase or consumption for the same context, not whether that user likes to shop anyway.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why decide whether to trigger causal retrieval by uplift instead of underlying shopping probability?
Deep-learning Causal Retrieval Optimization for Efficient e-commerce Distribution in Pinterest
Show answer and example
Answer: High-propensity users might buy without retrieval, so allocate compute by the outcome changed by triggering. Use randomized logs to learn treated and control outcomes, doubly robust correction to estimate increment, and replay to select a threshold. Adequate experimental support and overlap are still necessary.
Illustrative example: A likely buyer may gain little, while a less likely buyer can be persuaded by relevant candidates. Under a budget, compare intervention increments rather than base propensity.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What does DR uplift add beyond two outcome models for treatment and control?
Deep-learning Causal Retrieval Optimization for Efficient e-commerce Distribution in Pinterest
Show answer and example
Answer: The model difference estimates the outcome gap; a propensity-weighted residual uses observed assignment information to correct fitting error. Double robustness depends on its assumptions and suitable model specification, not immunity to arbitrary bias. Local synthetic randomized treatments do not establish production uplift.
Illustrative example: The residual may correct underestimated treated purchases, but cannot fix zero support when this group has never received treatment.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why check propensity values near zero or one in causal retrieval?
Deep-learning Causal Retrieval Optimization for Efficient e-commerce Distribution in Pinterest
Show answer and example
Answer: The DR residuals divide by e(x) or 1−e(x); extremes amplify noise, and missing overlap can prevent estimation. Choose trigger thresholds on independent replay or validation rather than test. Document any clipping because it changes estimator bias and variance.
Illustrative example: A subgroup triggered only 1% of the time can give one outcome enormous weight; a high score caused by that denominator is not high-confidence uplift.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does Click-A-Buy-B distinguish clicked and purchased items?
Click A, Buy B: Rethinking Conversion Attribution in E-Commerce Recommendations
Show answer and example
Answer: An item can reveal a need and another item satisfy it through price or specs. Separate CABA and CABB supervision retains direct conversions and cross-item guidance; taxonomy offers relation cues. Observed co-occurrence does not prove that A causes purchase of B.
Illustrative example: Clicking one camera brand and buying another is not a conversion of A, but A can still participate in the decision.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why not attribute a purchase of B entirely to clicked item A as a conversion of A itself?
Click A, Buy B: Rethinking Conversion Attribution in E-Commerce Recommendations
Show answer and example
Answer: The clicked and purchased objects can differ; same-item last-click attribution misses cross-item paths. Separate Click-A-Buy-A and Click-A-Buy-B tasks and use taxonomy to describe relations between A and B. This improves observed attribution and prediction, not causal identification.
Illustrative example: A user views an entry-level camera and buys an upgrade. Same-item counting marks the first camera as worthless despite its role in the decision path.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why does CABB need behavior types and item hierarchy beyond ordinary next-item prediction?
Click A, Buy B: Rethinking Conversion Attribution in E-Commerce Recommendations
Show answer and example
Answer: Adjacency alone need not distinguish browsing, clicking, and purchase or describe the A–B relationship. CABB explicitly supervises cross-item purchase paths and uses taxonomy to organize transferable relations. Sequential viewing preserves adjacency only and does not validate real purchase attribution.
Illustrative example: Watching movie B after A can test cross-item connections, but there is no ad-click and transaction loop.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
How should a CABB viewing-sequence proxy be reported without inventing purchase labels?
Click A, Buy B: Rethinking Conversion Attribution in E-Commerce Recommendations
Show answer and example
Answer: State that sequential views proxy Click-A/Buy-B, compare matched data, candidates, and baselines, and limit conclusions to the proxy. Taxonomy weights connect corresponding items and must not use test targets to decide candidate categories. Public ratings are not transaction amounts.
Illustrative example: Report simulated cross-item paths from successive views, not that users really clicked A and bought B. A target category known only afterward is not an inference input.
Sections in the Chinese source: 背景与主要改动, 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why can multitask models with the same marginals predict different joint behavior?
Learned Cross-Task Relationships in Multi-Task Models
Show answer and example
Answer: Marginals give frequencies, not co-occurrence. Covariance is joint probability minus the product of marginals, adding dependence information to shared representations and decisions. The task pair needs enough nondegenerate combinations; mutually exclusive or constant labels do not support the same interpretation.
Illustrative example: Click and long-watch can each have probability one half while always coinciding or never coinciding.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why predict a joint like-and-click label when both marginal rates are already predicted?
Learned Cross-Task Relationships in Multi-Task Models
Show answer and example
Answer: Marginals do not determine whether feedback occurs on the same examples. A joint head models dependence for shared representation supervision and downstream decisions; validate the benefits separately. Check feasibility when reconstructing the distribution rather than clipping negative probabilities and claiming calibration.
Illustrative example: Both rates can be 20% with complete overlap or complete separation. Marginals alone cannot tell how to combine objectives.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why compare true cross-label auxiliary supervision with shuffled labels rather than only adding or removing parameters?
Learned Cross-Task Relationships in Multi-Task Models
Show answer and example
Answer: An extra head can change the backbone through more gradients or regularization. Shuffling keeps the training form while destroying real task relations, helping isolate the relation signal. A sparse small slice is still only diagnostic and does not support stable capability claims.
Illustrative example: If real click-and-long-watch labels help but equal-sized shuffled labels do not, that supports useful joint information; similar results may reflect auxiliary training alone.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why not silently clip negative probabilities when reconstructing four joint cells from pX, pY, and pXY?
Learned Cross-Task Relationships in Multi-Task Models
Show answer and example
Answer: The cells must be nonnegative and sum to one; pXY is also bounded by the marginals. Negatives expose inconsistent predictions. Preserve an infeasible marker instead of clipping and claiming calibration; observed labels belong in loss and evaluation, not pre-impression inputs.
Illustrative example: pX=0.2 and pXY=0.4 imply negative click-only probability, which should be reported as inconsistent.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
How does CWM's potential watch benefit under common duration differ from observed watched seconds?
Counteracting Duration Bias in Video Recommendation via Counterfactual Watch Time
Show answer and example
Answer: Observed seconds mix preference, duration constraints, and content-type relationships. A common duration intervention compares potential outcomes at equal opportunity, reducing inherent long-video advantage. It is unobserved and requires modeling and identification assumptions.
Illustrative example: Completing a 15-second clip versus watching two minutes of a longer clip cannot determine preference from seconds alone.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why might counterfactual watch-time scoring better capture preferences than raw watched seconds?
Counteracting Duration Bias in Video Recommendation via Counterfactual Watch Time
Show answer and example
Answer: Raw seconds combine attraction with the viewing opportunity allowed by duration. CWM estimates potential watch benefit under a common duration intervention. This depends on counterfactual assumptions, is not just dividing by duration, and local proxies do not establish that actual duration or exposure confounding was removed.
Illustrative example: Completing a 20-second clip and abandoning a long clip after 30 seconds may imply a different preference under equal viewing opportunity.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How do CWM and completion-rate ranking differ in their assumptions about duration?
Counteracting Duration Bias in Video Recommendation via Counterfactual Watch Time
Show answer and example
Answer: Completion rate is an observed ratio and can favor short content; it has no explicit counterfactual. CWM estimates a potential outcome under common duration to separate preferences and duration effects. Bias differs, and misspecification can prevent the causal objective from helping.
Illustrative example: A three-second ad is easy to complete, unlike a long tutorial. CWM instead asks which would offer more value at equal duration.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
How should training and prediction duration differ for CWM's `do(D=d0)`?
Counteracting Duration Bias in Video Recommendation via Counterfactual Watch Time
Show answer and example
Answer: Fit the duration mechanism using observed D; for prediction comparisons fix d0 and output the defined potential quantity and bias term. Using each item's original duration is not a common intervention. Local movie proxies do not measure real short-video potential watch benefit.
Illustrative example: Set the same d0 for a 30-second clip and a five-minute clip; setting 30 and 300 reintroduces the original difference.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why treat DADF's mature predictor as a baseline and learn a relative correction?
DADF: A Distribution-Aware Debiasing Framework for Watch-Time Regression in Recommender Systems
Show answer and example
Answer: The predictor already captures stable relationships. A separate factor focuses on conditional systematic errors with the same scalar interface and less risk than full retraining. Near-zero or badly misspecified predictions are harder to correct, and factors cannot recreate missing information.
Illustrative example: Correct a 10% long-video underestimate without discarding every learned user-content relationship.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does DADF freeze the mature first-stage model and learn a multiplicative factor?
DADF: A Distribution-Aware Debiasing Framework for Watch-Time Regression in Recommender Systems
Show answer and example
Answer: Retraining can damage established capabilities or interfaces. Distribution-conditioned proportional residuals adapt to inputs and base predictions while preserving the scalar output. Tiny predictions can destabilize ratios, so check denominator protection and conditional distribution calibration.
Illustrative example: If two groups each start at 10 seconds but one is overestimated and one underestimated, learn distinct factors instead of adding five seconds everywhere.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How do DADF's multiplicative and additive residuals affect scale differently?
DADF: A Distribution-Aware Debiasing Framework for Watch-Time Regression in Recommender Systems
Show answer and example
Answer: Multiplication expresses proportional error and therefore larger absolute adjustments for large predictions; addition expresses fixed-unit error. Choose based on error structure. The local ranking was unchanged, so calibration changes are not automatic recommendation gains.
Illustrative example: A 10% underestimate at 10 and 100 seconds suits multiplication; a consistent five-second error suits addition. A global multiplier preserves ranking.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why check small denominators in DADF's `y/max(y0,ε)` even with frozen y0?
DADF: A Distribution-Aware Debiasing Framework for Watch-Time Regression in Recommender Systems
Show answer and example
Answer: Freezing stabilizes supervision but tiny predictions can produce huge noisy ratios. Record epsilon and use the same baseline version for correction inputs, ratio targets, and output multiplication. Do not update the first-stage model while claiming second-stage-only training.
Illustrative example: An observed 10 seconds divided by a 0.01-second baseline creates a huge factor that is not necessarily reliable preference evidence.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why model general interest and discount preference separately in DANet?
Show answer and example
Answer: Category interest is not the same as willingness to wait for discounts. IPN models general interest, DPN learns discount rhythms, and user and promotion context modulate them. The signals can interact but are not interchangeable.
Illustrative example: Two sneaker fans may buy at full price or wait for a season-end sale despite similar browsing.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does DANet separate high- and low-frequency discount history rather than using only today's discount?
Show answer and example
Answer: Current price cannot describe long-term sensitivity and short-term promotion reactions. DPN separates stable patterns from fast variations and modulates preferences with similar purchases and promotion context; another network models general interest. Purchase-only discount labels are auxiliary and do not identify causal effects.
Illustrative example: Two users see 20% off, but one shops only during annual events and the other reacts to regular small offers.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What structure does DANet's FFT frequency decomposition preserve beyond a recent discount average?
Show answer and example
Answer: A mean compresses trends and fluctuations into one number. Frequency separation reveals promotion rhythm, but depends on temporal sampling and quality, and high frequencies can be noise. Public data without prices provide proxy diagnostics only.
Illustrative example: Steady 10% off with a rare 50% sale can average similarly to weekly swings between 20% off and full price, but behavior can differ.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why does DANet regress observed discounts only on purchases?
Show answer and example
Answer: The target is a transaction discount conditioned on purchase, which unpurchased items lack. Mask with purchase positives rather than inventing labels. After FFT filtering, low-frequency reconstruction plus high-frequency residual should recover the sequence. Local popularity/rating intensity is not real coupon-price regression.
Illustrative example: An unpurchased shoe has no transaction discount; do not assign it zero. Use actual purchase discounts for this head and separate click or ranking supervision.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
What do DCEO's actor and user-level critic each do?
DCEO: Direct Causal Effect Optimization for Long-Term User Value Modeling in E-commerce Search
Show answer and example
Answer: The actor gives contextual weights to fuse click, conversion, and value scores immediately. The critic estimates the action's relative long-term effects during training. Serving keeps only the actor; that does not validate critic causality assumptions.
Illustrative example: The critic checks whether a shift from relevance toward transaction value yields incremental long-term benefit without running that evaluator at serving.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does DCEO use an actor to output contextual objective weights instead of one sitewide CTR/CVR/GMV mix?
DCEO: Direct Causal Effect Optimization for Long-Term User Value Modeling in E-commerce Search
Show answer and example
Answer: Fixed weights assume identical trade-offs across user states. The actor emits dynamic weights summing to one; the critic assesses relative intervention effects in training while serving uses the lightweight actor. Dynamic weights do not establish causal identification without credible controls.
Illustrative example: Exploration may matter for a new user and conversion for a mature shopper, but compare appropriate long-term feedback rather than just clicks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What does DCEO's dynamic simplex weighting add over fixed log fusion, and what are its risks?
DCEO: Direct Causal Effect Optimization for Long-Term User Value Modeling in E-commerce Search
Show answer and example
Answer: Nonnegative weights summing to one can express different trade-offs per request. More flexibility can overfit or exploit proxy rewards, requiring validation and per-objective checks. Local Hit rose but NDCG fell slightly, so this is not a clean sweep.
Illustrative example: Pushing popular items forward can raise hits while degrading positions of relevant items.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why does local DCEO run the held-out test only once for the validation champion?
DCEO: Direct Causal Effect Optimization for Long-Term User Value Modeling in E-commerce Search
Show answer and example
Answer: `causal_gain` and temperature define 20 candidate configurations evaluated only on fixed validation utility. Test only the selected champion to avoid using test variation as search feedback. Public proxy scores and the method's causal name are not evidence of real intervention effects.
Illustrative example: Testing all 20 and taking the highest converts test into validation. Lock the champion first and report any NDCG regression honestly.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why separate survey satisfaction and behavior feedback parameter paths in EASQ?
Towards End-to-End Alignment of User Satisfaction via Questionnaire in Video Recommendation
Show answer and example
Answer: Behavior is plentiful but can reflect short-lived clicks; surveys are direct but sparse. Separate LoRA protects satisfaction learning and supplies a preference reference. Survey response bias remains, so these are not unbiased population labels.
Illustrative example: Clicks followed by reported regret can be drowned out in pooled updates but remain influential through an independent expert.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why give sparse EASQ survey satisfaction a separate LoRA path and dynamic reference?
Towards End-to-End Alignment of User Satisfaction via Questionnaire in Video Recommendation
Show answer and example
Answer: Abundant behavior labels can swamp direct but sparse satisfaction signals. A separate low-rank path preserves survey expertise; online preference optimization uses it as a changing reference instead of chasing clicks alone. This reduces interference, not survey selection bias.
Illustrative example: Curiosity clicks can coexist with dissatisfaction in a few surveys, which remain influential through a dedicated expert.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does a dynamic survey reference differ from a fixed SFT reference?
Towards End-to-End Alignment of User Satisfaction via Questionnaire in Video Recommendation
Show answer and example
Answer: The fixed reference anchors to the initial distribution, while the survey expert adapts to newer satisfaction evidence. A moving reference is nonstationary and needs versions and limits. Updates need not always improve it, and LoRA alone does not prove backbone retention.
Illustrative example: A newer expert can reflect growing dislike of repetitive content, while a fixed reference may keep rewarding stale behavior.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why verify actual trainable parameters for EASQ rather than checking only a LoRA configuration?
Towards End-to-End Alignment of User Satisfaction via Questionnaire in Video Recommendation
Show answer and example
Answer: If the optimizer updates the backbone, the run is not an independent low-rank path for sparse satisfaction. Reference probabilities must match recorded versions, and serving dependencies must agree with training. A public proxy without surveys is not satisfaction reproduction.
Illustrative example: Full backbone updates can lower loss without proving LoRA protected ranking; inspect gradients and optimizer groups.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why transfer CTR knowledge into multiple EKTM CVR tasks instead of learning each from scratch?
Effective Knowledge Transfer for Multi-Task Recommendation Models
Show answer and example
Answer: Dense clicks can give relevance and interest knowledge to sparse conversions, but tasks differ. Similarity controls borrowing and hard-example loss limits harmful transfer. Measure each target separately.
Illustrative example: Cart and purchase can share interest signals, while returns mean something different; both zero transfer and indiscriminate transfer have risks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does EKTM transfer CTR features by task similarity rather than sharing equally across conversions?
Effective Knowledge Transfer for Multi-Task Recommendation Models
Show answer and example
Answer: Click labels are plentiful but relate differently to each conversion. Similarity controls transfer strength, hard-example supervision reduces negative transfer, and CVR towers retain their own targets. Validate similarities; abundant CTR data are not universally trustworthy.
Illustrative example: Cart additions may relate closely to clicks while long-term renewal depends on other factors, so they should not inherit the same strength.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Where does EKTM control conflicts compared with a shared-bottom model?
Effective Knowledge Transfer for Multi-Task Recommendation Models
Show answer and example
Answer: Shared-bottom uses the same backbone for all tasks. EKTM weights task-specific contributions during transfer and constrains harmful sharing with hard examples. This adds conditional specialization, similarity dependence, and tower cost; a movie proxy does not prove conversion improvement.
Illustrative example: A purchase tower can borrow more from add-to-cart knowledge than an unrelated tower instead of competing for an identical shared representation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why verify task identity, not only shape, when EKTM combines fctr and weighted CVR features?
Effective Knowledge Transfer for Multi-Task Recommendation Models
Show answer and example
Answer: Each similarity weight is tied to a source-target task and vectors must be semantically aligned. Preserve ordering mappings and derive hard-example masks from valid labels, never test scores. Public proxies do not create missing production conversion labels.
Illustrative example: A CTR-to-purchase weight can multiply a favorites tower without a shape error, yet corrupt supervision.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why is CTCVR defined on all ESMM impressions but conditional CVR is not?
Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
Show answer and example
Answer: Nonclicks are known negatives for click-and-convert, but whether they would convert if clicked is unobserved. The CTR–CVR product enables full-space joint supervision only under nested click-to-conversion semantics.
Illustrative example: An unclicked ad did not produce a post-click purchase, but this says nothing definitive about purchase under a click.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why train CTR and CTCVR in ESMM rather than treating nonclicks as CVR negatives?
Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
Show answer and example
Answer: CVR is conditional on clicking; no click does not reveal post-click purchase. CTR × CVR represents click-and-convert probability, enabling full-impression CTR and joint supervision to address sparsity and selection. The probability chain does not solve attribution, delayed feedback, or causal identification automatically.
Illustrative example: 10% CTR and 20% CVR give 2% joint rate. A nonclick labels click and joint events zero but cannot label hypothetical post-click conversion.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What impression information does ESMM add beyond CVR learned only in clicked space?
Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
Show answer and example
Answer: Clicked examples reflect user selection and the prior policy. Full-space CTR and CTCVR let nonclicks constrain joint outcomes, and shared features help sparse conversion. Neither AUC nor full-space supervision resolves delayed feedback or all confounding.
Illustrative example: Skipped expensive phones supply impression information, not direct counterfactual conversions if clicked.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Which ESMM losses use nonclicks, and which head should not be directly supervised by them?
Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate
Show answer and example
Answer: Full-impression click labels supervise CTR; full-impression CTCVR labels supervise CTR × CVR. Do not add direct CVR negatives for nonclicks. The local rating-threshold nesting validates wiring, not real ad conversions.
Illustrative example: A nonclick can lower joint probability via low CTR. Forcing CVR to zero adds an unsupported conditional label.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why separate consumption, active engagement, and direction in FLVM?
Mend the Measurement Gap: Latent User Preference Modeling for Short-Form Video Recommendation
Show answer and example
Answer: Watching, acting, and liking are different, and negative feedback can be highly active. Restricted heads use relevant factors rather than counting all engagement positively. Latents do not automatically identify psychological concepts and require semantic checks.
Illustrative example: Finishing a controversial video and disliking it gives high consumption and engagement but low positive direction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does FLVM place measurement confounders in a restricted baseline and correct feedback heads through routed latents?
Mend the Measurement Gap: Latent User Preference Modeling for Short-Form Video Recommendation
Show answer and example
Answer: Watch time reflects length and user habits, not pure preference. The baseline explains measurement conditions; separate consumption, active engagement, and polarity factors reach only relevant heads. Stop-gradient prevents the residual objective from rewriting its reference. These constraints do not fully identify causal latents.
Illustrative example: Similar watched seconds can come from completing a short clip or abandoning a long one; length opportunity and active liking should not become one score.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What shortcut do FLVM's constrained baseline and stop-gradient restrict compared with a shared multitask tower?
Mend the Measurement Gap: Latent User Preference Modeling for Short-Form Video Recommendation
Show answer and example
Answer: Duration and time first explain the measurement baseline. Full user-item information contributes via latents and fixed semantic routing, while baseline gradients train separately. This limits unrestricted mixing but does not remove all confounding; local factor separation was not stable.
Illustrative example: Let length explain greater opportunity to accumulate seconds, rather than using long as a direct synonym for liked.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why distinguish FLVM feedback masks from fixed latent routing masks?
Mend the Measurement Gap: Latent User Preference Modeling for Short-Form Video Recommendation
Show answer and example
Answer: Observation masks indicate whether sample labels exist; routing masks restrict which factors heads read, on different axes. Missing labels are not zero, baseline addition stops the specified gradients, and ranking uses the defined combination of consumption and polarity rather than rewarding activity as positive.
Illustrative example: An unobserved dislike is not a like. Even when observed, a dislike head cannot read unrelated factors to bypass routing.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does GPL target unexposed candidates rather than only adding more exposed-click logs?
Generative Pseudo-Labeling for Pre-Ranking with LLMs
Show answer and example
Answer: The preranker sees a wider pool than final exposure. Interest anchors and LLM weak labels broaden supervision toward retrieval distribution. Inferred labels cannot replace all observed feedback.
Illustrative example: If ten out of 1,000 retrieved items are displayed, the remaining items are not necessarily bad; weak relevance labels do not establish positive user feedback.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why add pseudolabels for unexposed candidates in GPL pre-ranking?
Generative Pseudo-Labeling for Pre-Ranking with LLMs
Show answer and example
Answer: Exposed click examples were selected by the old system and omit many early rejects. An LLM supplies additional labels based on user interest anchors, while a lightweight preranker serves. These noisy judgments are not counterfactual truth; control weight and measure bias.
Illustrative example: A relevant new category may have no logged clicks because it was never shown; estimated relevance does not mean users bought or liked it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What assumption does GPL pseudolabeling address compared with labeling all nonexposures negative?
Generative Pseudo-Labeling for Pre-Ranking with LLMs
Show answer and example
Answer: Missing opportunity is not rejection. Weak labels estimate relevance from intent but can transfer LLM bias; weight them and keep real labels. Removing the LLM from serving does not prove label quality.
Illustrative example: An unseen waterproof shoe can get a weak positive from an interest anchor, yet persuasive ad copy can still fool the teacher.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why record GPL real and pseudo supervision sources and λ separately?
Generative Pseudo-Labeling for Pre-Ranking with LLMs
Show answer and example
Answer: Labels differ in reliability and coverage, and the joint coefficient controls pseudo-example influence. Keep provenance; use available history only and exclude test targets from anchors. Public proxies do not reproduce the production LLM labeling system.
Illustrative example: Ten thousand weak labels can overwhelm 100 real clicks if equally weighted; source and weight make that auditable.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Are HGE's top-K items the displayed recommendations or inputs within one container?
Show answer and example
Answer: They are item inputs for each candidate store or room. Set attention models internal relations and combines user/query context to score the container. Top-K is partial inventory, not a list of K stores or item outputs.
Illustrative example: Three internal products from each of two stores yield six encoded items but only two store scores.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does HGE separately predict container conversion, conditional item purchases, and quantities instead of one store GMV?
Show answer and example
Answer: Aggregate GMV is sparse and noisy. Decompose transaction probability and conditional item contributions, with residuals for top-K omissions. Items are not mutually exclusive, and the fusion gate uses context rather than realized conversion.
Illustrative example: A shopper can buy two inexpensive items or one expensive item; one categorical choice cannot represent both patterns.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why do HGE item sigmoid and mutually exclusive softmax imply different business assumptions?
Show answer and example
Answer: A transaction can contain multiple items, so independent sigmoid scores can all be high. Softmax forces one distribution with a fixed sum and changes basket semantics. Quantity is a distinct head.
Illustrative example: Buying coffee and bread together should not require the probability of bread to fall when coffee increases.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why must HGE not select residual and fusion branches using realized conversion?
Show answer and example
Answer: Residuals can correct over- and underestimation and need not be nonnegative. Predict gates from pre-impression context, not observed transaction labels. The component lacks full multitask training, and differentiating squared output is a gradient diagnostic only.
Illustrative example: Using the decomposition only after learning a store converted leaks the answer and inflates test results.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why does Incrementality define the value of outreach as μ1−μ0?
From Prediction to Incrementality: Causal Optimization for Large-Scale Targeting and Recommendation
Show answer and example
Answer: μ1 estimates the outcome under treatment and μ0 without it. Their difference distinguishes what the action creates from what would happen anyway. Give scarce capacity to people whose behavior can change, not merely those likely to respond. The two potential outcomes cannot be observed together, so estimation needs support and identification assumptions.
Illustrative example: Illustration: A would buy without a message; B changes their choice only with one. A high treated purchase rate does not imply high incremental value, so it is not enough to rank by that outcome alone.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why might a likely buyer not be the best target under a limited outreach budget?
From Prediction to Incrementality: Causal Optimization for Large-Scale Targeting and Recommendation
Show answer and example
Answer: The policy cares about how much taking the action changes the outcome. High purchase probability may mean the user would buy without outreach. The method estimates treated and untreated outcomes and allocates the budget by uplift after an uncertainty penalty. A credible difference needs experimental support and identification conditions; two prediction heads alone do not make it causal.
Illustrative example: Illustration: A often buys either way, while B may buy only after seeing a relevant recommendation. B's raw purchase rate can be lower while B provides more incremental value for the same outreach slot.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does allocating by τ−λσ differ from ranking by mean uplift alone?
From Prediction to Incrementality: Causal Optimization for Large-Scale Targeting and Recommendation
Show answer and example
Answer: The uncertainty penalty deprioritizes poorly supported, possibly overestimated candidates and favors robust budget value. A mean-only policy may chase high-variance extremes. The penalty can also miss genuinely promising new groups and is not an exploration policy. A single proxy policy-value estimate cannot settle the trade-off universally.
Illustrative example: Illustration: Two users have the same estimated uplift, but one has abundant history and the other one response. Conservative allocation prefers the former; active exploration may require a separate budget.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why should fixed-budget allocation check B but allow some budget to remain unused?
From Prediction to Incrementality: Causal Optimization for Large-Scale Targeting and Recommendation
Show answer and example
Answer: The constraint caps actions at B; it does not require all B. If risk-adjusted values are negative, do not send unhelpful messages just to fill the quota. Ranking and allocation must use consistent identities and cutoff features, without selecting people based on future test outcomes. The source's fixed-percentage proxy is not real long-term online incrementality.
Illustrative example: Illustration: If ten messages are available but only three users have positive risk-adjusted value, sending all ten can lower value. Unless the business explicitly requires it, the constraint does not force full use.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why do Light Heads introduce a shallow head instead of changing the shared backbone immediately?
Lightweight Ranking Heads: Accelerating Multi-Task Experimentation in Production Recommender Systems
Show answer and example
Answer: A production system can try a new objective quickly while protecting existing tasks and interfaces. The head reads shared features and updates only itself, making a cheap probe. It can exploit but not improve the backbone through this loss, and cannot recover information absent from those features.
Illustrative example: Illustration: Probe sparse satisfaction on current user embeddings without changing the click network. Adding a head cannot conjure details the embeddings never captured.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Can a new Light Heads objective improve the backbone after a stop-gradient on shared features?
Lightweight Ranking Heads: Accelerating Multi-Task Experimentation in Production Recommender Systems
Show answer and example
Answer: Not through that loss path: it trains the shallow head but cannot update the shared backbone, reducing interference with existing tasks. Window resets make head training ages comparable but may sacrifice fit on sparse objectives. Gradient isolation and resets are separate; improved head AUC does not establish an improved backbone.
Illustrative example: Illustration: Add a feedback head without harming a mature click tower; resetting weekly supports fair upstream comparisons but may leave a rare objective undertrained.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why trade off training-age comparability against sparse fitting when resetting a Light Head?
Lightweight Ranking Heads: Accelerating Multi-Task Experimentation in Production Recommender Systems
Show answer and example
Answer: Resetting each window equalizes training age across upstream variants. Keeping the head preserves sparse label experience and may fit better. Short-window resets clearly regressed in the local source, so the right choice depends on the experimental goal and available data.
Illustrative example: Illustration: A head trained three weeks versus a head trained one day confounds an upstream comparison. Reset both for a fairer comparison, but rare labels may not be enough to relearn.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
What should be checked separately for Light Head gradient isolation and reset?
Lightweight Ranking Heads: Accelerating Multi-Task Experimentation in Production Recommender Systems
Show answer and example
Answer: With only the new-task loss, shared θ must receive zero gradient while light-head ψ receives nonzero gradient. At a window boundary, reinitialize only ψ and preserve existing θ and main head φ as specified. Resetting does not imply isolation; do not erase backbone optimizer state accidentally.
Illustrative example: Illustration: A changed shared parameter after the new-task update violates isolation. Resetting the main click head too would destroy the baseline.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why turn LLM judgments into Beta pseudocounts instead of making direct recommendations in LLM-TS Prior?
LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation
Show answer and example
Answer: Pseudocounts encode an initial success probability in a Bayesian state that feedback can update. Thompson sampling balances exploration, and real observations should be able to override the prior. Text can be biased and user clusters need not be homogeneous.
Illustrative example: Illustration: A favorable text judgment supplies a moderate prior for one group. Later clicks and skips correct it instead of the system recommending the item forever.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why is prior strength κ as important as the probability p when turning an LLM judgment into Beta pseudocounts?
LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation
Show answer and example
Answer: p sets the initial preference and κ controls how much real feedback changes it. A large κ can let wrong semantics dominate for too long, while a tiny one barely helps cold start. Thompson sampling explores and updates the posterior, so the LLM is a starting point. A grouped local proxy does not establish general usefulness of text priors.
Illustrative example: Illustration: Two items start at 80%, but one prior represents a few observations and the other thousands. Repeated failures overturn the first much sooner.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why do equal p and unequal κ produce different responses to early feedback?
LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation
Show answer and example
Answer: p determines the mean, while κ determines how much pseudo-evidence supports it. A stronger prior resists real observations, changing exploration even at the same mean. Too strong can lock in errors; too weak loses useful knowledge. No κ is universally better for all groups.
Illustrative example: Illustration: Two 60% priors represent two and 200 observations. Three failures change the former far more.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why distinguish prior pseudocounts from observed successes and failures when updating a Beta prior?
LLM-Derived Priors for Thompson Sampling in Cold-Start Comment Recommendation
Show answer and example
Answer: Initialize parameters as 1+κp and 1+κ(1−p). Add counts only for arms actually shown and observed, and keep groups separate as specified. Future test feedback cannot initialize the prior. The local genre proxy does not prove actual LLM semantic calls.
Illustrative example: Illustration: An unselected arm has no outcome this round. Counting it as a failure because another arm won distorts the posterior and suppresses exploration.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why build a Macro Task Merging Graph before expert propagation in MGOE?
Macro Graph of Experts for Billion-Scale Multi-Task Recommendation
Show answer and example
Answer: The graph represents stable sharing relations that a per-sample gate does not explicitly encode. Macro Graph Bottom/Experts propagate information before task-specific towers. Relations can change across scenarios, and edges do not establish causality.
Illustrative example: Illustration: Click, watch time, and purchase can share information without implying clicks cause purchases.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
What does MGOE's explicit task graph add to MMoE's sample-level gate?
Macro Graph of Experts for Billion-Scale Multi-Task Recommendation
Show answer and example
Answer: Sample-level mixtures do not explicitly encode stable task relationships. Graph bottom and experts propagate between related objectives before task towers, separating global structure from local routing. Wrong edges can propagate negative transfer. Compare related and unrelated tasks rather than assuming the graph is correct.
Illustrative example: Illustration: Clicks, cart additions, and purchases may share paths, while reports need other signals; the gate need not relearn every task relationship per sample.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What additional sharing bias does MGOE introduce relative to independent MMoE task gates?
Macro Graph of Experts for Billion-Scale Multi-Task Recommendation
Show answer and example
Answer: MMoE shares experts implicitly by example. MGOE adds graph-constrained task propagation, which can help sparse objectives or transmit wrong relations. Overall gains and changed head share do not establish all-task improvement.
Illustrative example: Illustration: A sparse purchase task can borrow click knowledge; a mistakenly connected returns task may inherit the wrong direction.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why align MGOE's normalized adjacency and task indices with expert tensors?
Macro Graph of Experts for Billion-Scale Multi-Task Recommendation
Show answer and example
Answer: Rows and columns of A identify nodes and task towers must read the correct propagated rows of H. Normalization, self-loops, and depth determine mixing. Use labels only in training; do not rebuild the graph from test feedback.
Illustrative example: Illustration: A purchase node paired with watch-time features still multiplies correctly but shares the wrong information.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Does sharing experts but keeping private gates make MMoE tasks independent?
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Show answer and example
Answer: No. Shared expert gradients still transmit effects between tasks. Private gates change expert weights and task heads produce separate outputs. This lies between full sharing and full separation. Check actual routes and task results for specialization.
Illustrative example: Illustration: Click and purchase use the same price expert at different rates; click training still changes the expert that purchase reads.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why can shared experts with task-specific gates in MMoE reduce shared-bottom negative transfer?
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Show answer and example
Answer: A shared bottom forces one intermediate representation and can mix conflicting gradients. MMoE lets each task conditionally combine jointly trained experts, sharing useful parts while selecting different mixtures. It enables soft specialization but does not guarantee interpretable experts or eliminate conflict.
Illustrative example: Illustration: Click and purchase can both use category knowledge while one emphasizes novelty and the other price.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What trade-off does MMoE offer between a shared bottom and independent task networks?
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Show answer and example
Answer: A shared bottom returns one representation, independent networks share no parameters, and MMoE offers several common experts combined per task. Extra experts add flexibility, computation, and collapse risk. Task relationships and data determine whether the compromise helps.
Illustrative example: Illustration: Two tasks can share interest features but differ elsewhere. Unrelated tasks may suffer from sharing, while scarce data can make independent models unstable.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why normalize MMoE gates across experts, and how many sets of weights do four experts and two tasks need?
Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts
Show answer and example
Answer: Each task has a distinct four-weight distribution per sample and combines same-space expert outputs. Normalizing across tasks makes them compete for one budget and changes the algorithm. The four-expert, two-head local control is shared-bottom.
Illustrative example: Illustration: Click and purchase each need four weights summing to one; normalizing all eight together couples them incorrectly.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why isn't PA-Bridge passive-to-active transfer just rewriting browsed titles as questions?
Show answer and example
Answer: Active queries express actions and problems absent from passive views. Align distributions, then use semantic codes and weights to reduce exposure loops. A question mark cannot create user intent, and model inference is not an explicit request.
Illustrative example: Illustration: 'How do I exercise?' rewrites a title but may miss the actual question about protecting a knee.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why align passive browsing to active queries before discretization and reweighting in PA-Bridge?
Show answer and example
Answer: Browsing says what was seen, while active queries express what users want to ask. Direct reuse can suggest familiar but poor conversation starters. Distribution alignment bridges intent spaces, and discrete units with reweighting reduce repeated dominance by popular exposures.
Illustrative example: Illustration: Frequent fitness videos may coexist with a specific need to ask about training with knee discomfort; query alignment can surface the latter.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does PA-Bridge reweighting differ from selecting the most-browsed topic?
Show answer and example
Answer: Counts reflect prior exposure, so top frequency reinforces what was already shown. Reweighting reduces dominant semantic units and broadens active topics, but too much favors irrelevant tail content. Diversity is not satisfaction or causal debiasing.
Illustrative example: Illustration: Reweighting can surface related strength training alongside common weight-loss content, not justify arbitrary unrelated topics.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
What temporal constraint applies when fitting PA-Bridge hpassive to hactive pairs?
Show answer and example
Answer: Use active queries as training targets and cut passive context before the query. Codes and weights must also use allowed history. The public proxy lacks genuine active-query logs, so an Align function alone does not demonstrate cross-behavior transfer.
Illustrative example: Illustration: Rehab videos watched after asking about a knee cannot be part of the prefix used to predict that question.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why identify PEARL's reference distribution when reporting a percentile?
Show answer and example
Answer: A percentile is the fraction of reference outcomes exceeded, so users, context, and windows change its meaning. More comparisons reduce sampling noise, and value weights connect goals. Relative rank does not remove logging bias or prove causal incrementality.
Illustrative example: Illustration: Thirty seconds can be high for short clips and low for long tutorials; a wrong reference reverses interpretation.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why estimate PEARL percentiles via repeated comparisons rather than regress raw behaviors?
Show answer and example
Answer: Raw values differ in scale and bias. Comparing a behavior against references estimates its relative position, with more independent comparisons reducing variance. Value weighting and long-term co-training connect objectives. Percentiles depend on the reference and are not causally debiased value.
Illustrative example: Illustration: Thirty seconds means different things for a 15-second clip and a ten-minute video; compare within suitable references.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How do repeated pairwise comparisons trade scale and variance against raw-label regression?
Show answer and example
Answer: Regression preserves units but is sensitive to extremes. Comparisons organize relative position across scales but lose absolute gaps and introduce sampling error. Under independence, larger N reduces variance; bootstrap does not remove systematic bias. Neither objective is universally superior.
Illustrative example: Illustration: 100 and 101 seconds can differ in percentile despite a small raw gap, while a huge anomaly no longer dominates linearly.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why check dependence among PEARL comparisons before using p(1−p)/N?
Show answer and example
Answer: The expression assumes appropriate Bernoulli comparisons and sampling. Repeated or correlated references do not add N independent observations. Record weights, bootstrap, and co-training provenance; sampling variance is not training variance. Do not use test references to choose targets.
Illustrative example: Illustration: Comparing the same video 100 times does not reduce uncertainty tenfold as 100 independent references might.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why treat PinEqualizer exploration as both a supply and a model problem?
PinEqualizer: Full Funnel Content Exploration and Debiasing System at Pinterest
Show answer and example
Answer: New items can disappear in corpus, retrieval, or ranking. Content reduces dependence on old interactions, an exploration corpus allows entry, and uncertainty allocates feedback. Stage survival locates bottlenecks; a high fresh quota does not guarantee relevance.
Illustrative example: Illustration: A favorable ranker cannot recommend an item that retrieval never includes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why check fresh-content survival at every stage in PinEqualizer instead of boosting it only in fine ranking?
PinEqualizer: Full Funnel Content Exploration and Debiasing System at Pinterest
Show answer and example
Answer: Items filtered in corpus or retrieval never reach the ranker. Track stage inputs and survival to locate bottlenecks. Content features, interaction dropout, and calibration reduce dependence on old exposure; separate exploration and uncertainty rewards collect feedback. Relevance still constrains exploration.
Illustrative example: Illustration: A new recipe filtered before retrieval cannot benefit from a ranking boost. Preserve entry and explore promising items selectively.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why does PinEqualizer UCB consider uncertainty and relevance instead of merely lowering popular scores?
PinEqualizer: Full Funnel Content Exploration and Debiasing System at Pinterest
Show answer and example
Answer: Popularity penalties do not identify worthwhile unknown items. UCB promotes low-exposure or uncertain items, with search relevance limiting unrelated exploration. Locally fresh exposure rose but overall NDCG fell, so report both.
Illustrative example: Illustration: Explore a relevant new recipe, not unrelated news just because it is obscure.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why preserve validation's UCB α=0 rather than tune α for a better fresh metric?
PinEqualizer: Full Funnel Content Exploration and Debiasing System at Pinterest
Show answer and example
Answer: Validation rejected extra exploration under the current objective. Do not reselect on test. The debiased model itself can raise fresh exposure without UCB. Report freshness denominators and overall regression instead of changing objectives afterward.
Illustrative example: Illustration: If the model already increases fresh impressions severalfold and UCB hurts relevance, do not force α above zero to claim bandit use.
Sections in the Chinese source: 本地复现. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why can average task AUC hide PLE's seesaw effect?
Show answer and example
Answer: One task can improve while another regresses and the average obscures the loser. Report each objective under the same joint training. This differs from measurement noise and does not require identical gains across tasks.
Illustrative example: Illustration: Click AUC gains two points and purchase loses one; average AUC rises without both improving.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why does PLE distinguish shared and private experts beyond MMoE's task-specific gates?
Show answer and example
Answer: MMoE mixes differently but all experts receive multiple tasks' gradients. PLE reserves private capacity alongside shared experts and extracts common and task-specific information layerwise. This changes information and gradient paths at extra capacity and routing cost; verify whether regressions actually decline.
Illustrative example: Illustration: Share category interest while purchase-private experts learn affordability and click-private experts learn headline appeal.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why isn't PLE just increasing MMoE expert count?
Show answer and example
Answer: More shared experts still accept all tasks' gradients. PLE changes access and gradient topology with private groups and layered fusion, not just parameter count. Match budgets and do not generalize a local two-task comparison to every conflict.
Illustrative example: Illustration: Ten additional shared experts can still transmit click interference to purchases; a purchase-private group blocks that route.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why restrict each PLE task gate to its private experts and shared experts?
Show answer and example
Answer: This is the CGC separation contract. Accessing another task's private group changes the topology. Verify expert identities, masks, actual gradients, and next-layer channel layout rather than trusting variable names.
Illustrative example: Illustration: Concatenating all experts without a mask can preserve output shape but let click read purchase-private features.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Does cold start in Podcast MTL mean no content or no target feedback?
Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify
Show answer and example
Answer: The gap is ad click/play labels for new podcasts, not necessarily missing titles or topics. Shared content and context help without representing observed ad outcomes. Transfer supplies a training signal, not a real click log.
Illustrative example: Illustration: A show's host and description can suggest likely audiences before exposure, but cannot verify their ad clicks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
How does Podcast MTL use organic promotion for cold ads, and why balance gradients?
Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify
Show answer and example
Answer: User, content, and context representations share abundant organic signals while separate heads preserve objectives. Sample and gradient imbalance can drown the sparse advertising task, so adjust contributions. Transfer can fail when tasks differ; sharing does not guarantee gains.
Illustrative example: Illustration: A new podcast has organic plays but no ad clicks. Learn audience clues in the shared encoder while preventing organic gradients from overwhelming ad supervision.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does gradient balancing treat a small podcast task differently from mixing by counts?
Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify
Show answer and example
Answer: Counts let the large task dominate shared weights. Balancing actual contributions preserves the sparse ad direction, but too much can amplify noise. Evaluate per task; duplicating records cannot guarantee cold-start gains.
Illustrative example: Illustration: One million organic and one thousand ad examples can bury ad gradients. Moderate balancing does not mean infinitely upweighting a single ad label.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why not fill missing Podcast MTL labels with zeros?
Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify
Show answer and example
Answer: An organic example may never expose the ad, so its ad response is unobserved, not negative. Mask that loss; observed objectives can still train shared features. Record task identity, data construction, and α. Movies proxy for podcasts only.
Illustrative example: Illustration: Listening after organic exposure does not imply the user ignored an unseen ad.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Does high PromptShift Drift directly imply lower accuracy?
Measuring and Mitigating Identity-Cue Preference Drift in LLM-based Recommender Systems
Show answer and example
Answer: No. Drift measures list change, not relevance of old and new items. SliceShift adds popularity direction, not quality. Independent relevance or feedback is needed; do not relabel sensitivity as accuracy loss.
Illustrative example: Illustration: Swapping two equally suitable films changes rank drift without necessarily hurting the user.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why hold history fixed and vary only identity prompts in PromptShift, then measure Drift and SliceShift separately?
Measuring and Mitigating Identity-Cue Preference Drift in LLM-based Recommender Systems
Show answer and example
Answer: Changing both confounds actual preference and identity cues. Drift measures overlap/rank changes and SliceShift measures cohort popularity direction; mainstreamness conditions relevance and inverse-popularity blending. This is a controlled sensitivity diagnostic, not causal discrimination proof.
Illustrative example: Illustration: Use the same movie history with and without identity text to see whether rankings shift toward cohort-popular films.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Where does user conditioning enter adaptive inverse-popularity blending versus a uniform tail bonus?
Measuring and Mitigating Identity-Cue Preference Drift in LLM-based Recommender Systems
Show answer and example
Answer: Mainstreamness m changes the mix of relevance and inverse popularity, unlike a uniform bonus. Both can hurt relevance. Diagnostics do not establish real fairness or satisfaction and do not belong on formal capability leaderboards.
Illustrative example: Illustration: A mainstream user and a niche user may need different corrections; pushing even more obscurity can be unhelpful for the latter.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
What must stay fixed between PromptShift's reference and identity-prompt lists?
Measuring and Mitigating Identity-Cue Preference Drift in LLM-based Recommender Systems
Show answer and example
Answer: Keep history, candidates, model, and decoding as consistent as possible and vary the identity cue only. Handle shared item ranks and set changes as defined; do not pair disjoint items artificially. Do not choose mitigation on test.
Illustrative example: Illustration: If one arm also has recent clicks, drift may come from the extra behavior rather than identity.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Does RAMP's non-personalized branch predict the same thing for every request?
Show answer and example
Answer: No. It can use ad content, public attributes, and request context without restricted personal fields. Constant output would discard allowed evidence. Follow permissions and do not disguise personal IDs as public.
Illustrative example: Illustration: Rain gear on a rainy day and food on a sunny day can score differently without private browsing history.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why keep a separate RAMP path for unavailable personalization instead of filling zeros?
Show answer and example
Answer: Zeros conflate unavailable features with true zeros and force one representation across distinct inputs. An availability mask selects personalized or public paths, and training distills rich predictions to the restricted path. Serving remains limited to permitted features and cannot recover hidden personal history.
Illustrative example: Illustration: An unconsented request uses content and context, while authorized training examples can provide soft supervision without exposing restricted fields online.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What does RAMP distillation add beyond training on missing features alone?
Show answer and example
Answer: Missing-feature training uses hard labels. A rich teacher adds soft relational judgments, but student inputs may not recover all information and bias can transfer. A large relative gain over a tiny local baseline is not definitive industrial robustness.
Illustrative example: Illustration: A teacher can distinguish two ads with similar public features; a student may learn a trend but cannot distinguish every user without public clues.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why derive RAMP availability masks from actual permissions rather than prediction quality?
Show answer and example
Answer: The mask expresses feature access, not labels or which branch wins afterward. Distill on authorized samples and keep restricted test traffic free of personal features. Distinguish unavailable values from legitimate zeros.
Illustrative example: Illustration: Selecting the private branch only when a purchase occurs leaks outcomes. Use permission and field availability at request time.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Do SCALR translated target events actually occur?
Synthetic Data from Cross-Domain Events for Large-Scale Recommendation Systems
Show answer and example
Answer: No. They are conditional samples for downstream training, not exposures, clicks, or conversions. Keep synthetic identity and weights.
Illustrative example: Generating a target-domain training click on B from a source event on A does not create an audit fact.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why synthesize events and sample targets instead of always taking top-k?
Synthetic Data from Cross-Domain Events for Large-Scale Recommendation Systems
Show answer and example
Answer: Estimate target distributions from overlap and emit ordinary training records for different models. Sampling retains tail opportunities rather than repeating head products, without claiming the records occurred.
Illustrative example: Travel browsing may synthesize adapters or organizers, not only the highest-probability suitcase.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How does data-level transfer differ from adding cross-domain modules to each model?
Synthetic Data from Cross-Domain Events for Large-Scale Recommendation Systems
Show answer and example
Answer: Synthetic events reuse the ordinary target training interface. Model-level transfer is tied to architecture. Shared interfaces ease reuse but do not guarantee equal effects.
Illustrative example: Several rankers can share events rather than each implementing a special attention module.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
What isolation does conditional SCALR estimation need?
Synthetic Data from Cross-Domain Events for Large-Scale Recommendation Systems
Show answer and example
Answer: Estimate co-occurrence from overlapping train users, not target test events; handle zero denominators and missing coverage. Genre proxies are not Meta conversions or CVR.
Illustrative example: Reading test purchases before building translation probabilities leaks future outcomes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why use both shared and private experts in SMES?
SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity
Show answer and example
Answer: Stable shared experts hold common signals, task-private experts preserve differences, and global load balances cross-task dispatch.
Illustrative example: Viewing and buying share interest features but can retain distinct decision experts.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why combine fixed shared activation, adaptive private experts, and global balance?
SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity
Show answer and example
Answer: Shared capacity handles commonality, private routing handles task differences, and global balance detects concentration hidden within tasks. Actual specialization and balance penalties still require evaluation.
Illustrative example: Clicks and purchases can share interest experts while choosing novelty or price specialists, unless global dispatch overloads one.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
How do shared/private pools differ from one MoE router?
SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity
Show answer and example
Answer: Separate pools constrain common and task-specific selections; one pool lets all compete. This does not guarantee less negative transfer.
Illustrative example: Reserving all shared capacity for purchases can harm other tasks.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Can balancing be computed separately per task only?
SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity
Show answer and example
Answer: No. Separate balance can miss aggregate expert overload. Use cross-task counts. MovieLens lacks production sparse scheduling, so dispatch counts are not throughput.
Illustrative example: Individually spread tasks can all favor the same two experts globally.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why distinguish not-yet-converted from never-converting?
TWICE: Two-Clock, Two-Window Learning for Long-Horizon Conversion Prediction in Online Advertising
Show answer and example
Answer: A recent click can convert later. Final CVR times delay CDF describes current observation without treating immature negatives as permanent.
Illustrative example: Today's click can become tomorrow's order.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why learn final conversion and delay CDF separately?
TWICE: Two-Clock, Two-Window Learning for Long-Horizon Conversion Prediction in Online Advertising
Show answer and example
Answer: An unobserved conversion may be delayed. Event probability times delay CDF gives observable status. Two clocks/windows address maturity bias, subject to a suitable delay model. Public timestamps are not ad results.
Illustrative example: Five minutes without purchase is not equivalent to a week without purchase.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
What do click-clock status and conversion-clock delay measure?
TWICE: Two-Clock, Two-Window Learning for Long-Horizon Conversion Prediction in Online Advertising
Show answer and example
Answer: One measures maturity since click, the other the conversion delay distribution. Joint windows correct observation bias; one clock can mix event likelihood with timing.
Illustrative example: Equal waits can differ in label maturity under different sampling windows.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
What monotonic boundary must the delay CDF satisfy?
TWICE: Two-Clock, Two-Window Learning for Long-Horizon Conversion Prediction in Online Advertising
Show answer and example
Answer: Stay in [0,1] and never decrease with time. Keep it separate from final CVR. Public proxies lack actual ad delay, aggregates, and revenue.
Illustrative example: A two-day CDF cannot fall below the one-day value.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why distinguish immediate and delayed feedback in Twitch ranking?
Show answer and example
Answer: Views and interactions appear fast, while follows and payments may mature later. Lifecycle groups also value objectives differently.
Illustrative example: A new viewer who has not paid yet is not an immediate negative for value.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why handle delays, lifecycle weighting, and MMoE gates together?
Show answer and example
Answer: Outcomes differ in observation time and user stage. Immediate/delayed models address labels, segments encode objectives, and MMoE shares/selects experts. Overall metrics cannot prove all groups improve.
Illustrative example: Support viewing habits for new users and deeper engagement for established users without letting immediate clicks dominate delayed payment.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Are MMoE gates and segment weights at the same level?
Show answer and example
Answer: Gates select expert mixtures per task; segment weights alter task contribution. One global weight does not implement expert interactions.
Illustrative example: New users can emphasize viewing while each task still has a different expert mixture.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Does local Twitch-MOR explain production gains?
Show answer and example
Answer: No. It lacks private features, mature delay labels, and traffic. Fix segments and maturity windows; never define segments using future test payments.
Illustrative example: Labeling future payers as currently high value leaks outcomes.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why separate baseline click propensity and coupon-strength sensitivity?
Jointly Optimizing Debiased CTR and Uplift for Coupons Marketing: A Unified Causal Framework
Show answer and example
Answer: Users may buy anyway. Separate natural propensity from treatment response to estimate increment rather than conversion under a coupon.
Illustrative example: A coupon used by someone who would buy anyway does not necessarily generate a sale.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Why separate baseline and coupon sensitivity before comparing predictions?
Jointly Optimizing Debiased CTR and Uplift for Coupons Marketing: A Unified Causal Framework
Show answer and example
Answer: Natural propensity can masquerade as coupon gain. Two towers model baseline/treatment; counterfactual constraints link unobserved cases, and unit uplift normalizes tier increments. Identification still depends on assignment and assumptions.
Illustrative example: A naturally 80%-likely buyer may gain less than one moving 20%→50%, subject to selection bias.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Why isn't treatment CTR uplift?
Jointly Optimizing Debiased CTR and Uplift for Coupons Marketing: A Unified Causal Framework
Show answer and example
Answer: Uplift compares treated and untreated potential outcomes under matched conditions; high treated CTR can reflect selection. Counterfactual identification needs assumptions, not just two predictions.
Illustrative example: Coupons targeted to high-intent users can show high CTR without causing it.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Does local UniMVT have randomized coupon tiers and counterfactuals?
Jointly Optimizing Debiased CTR and Uplift for Coupons Marketing: A Unified Causal Framework
Show answer and example
Answer: No. MovieLens checks two-tower and counterfactual constraints only. Causal estimates require overlap and confounding control; test outcomes must not define treatment.
Illustrative example: Assigning coupons by rating leaks outcomes into group assignment.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Basics
Why estimate each teacher's difficulty at each SID position in KL-MOPD?
KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation
Show answer and example
Answer: An item ID needs several correct tokens. The click teacher may be easy to imitate early and the value teacher later. Fixed half weights ignore this; KL-MOPD upweights the harder teacher based on each initial student-to-teacher KL gap.
Illustrative example: Example: A three-part code starts with category and ends with attributes. If a teacher diverges only on category, one sequence-wide weight obscures that difference.
Sections in the Chinese source: 背景与主要改动, 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Core mechanism
Does KL-MOPD compute alpha from the current student or the frozen initial student?
KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation
Show answer and example
Answer: Calibrate once before training using the frozen initial student's own sampled prefixes. Training loss uses current student prefixes but does not recalculate alpha from current gaps. Dynamic weights would define a different objective.
Illustrative example: Example: Initial gaps 1 and 3 produce fixed weights 1/4 and 3/4. Later gaps of 2 and 1 do not swap them.
Sections in the Chinese source: 核心公式. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Method comparison
Is weighting two reverse KL losses equivalent to averaging teacher probabilities and computing one KL?
KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation
Show answer and example
Answer: Not in general. Weight the separate student-to-teacher KL losses, not an arithmetic mixture of teacher probabilities, and keep KL(student||teacher), not forward KL. Negative controls distinguish the computations without establishing recommendation gains.
Illustrative example: Example: Teachers favor different tokens. An arithmetic mixture keeps mass on both modes; weighted reverse KL involves log teacher probabilities and yields different gradients.
Sections in the Chinese source: 核心公式, 本地复现与边界. The example illustrates the mechanism.
Search, ads, and recommendation / Learning signals, multitask learning, and feedback bias
Implementation details
Why doesn't a gradient-tested tensor loss establish on-policy recommender training?
KL-MOPD: Discrepancy-Aware Multi-Objective On-Policy Distillation for Generative Recommendation
Show answer and example
Answer: Logits alone don't tell the kernel who sampled a prefix. Initial calibration, current student generation, frozen teacher scoring, SID decoding and real splits require external integration. Only the loss component and small CPU/CUDA mechanism evidence are present.
Illustrative example: Example: The kernel accepts cached old-policy prefixes, but that does not make them samples from the current student.
Sections in the Chinese source: 本地复现与边界. The example illustrates the mechanism.
Topic guide and reading order
Start with this question¶
Which probability or value can observed clicks and conversions supervise?
Takeaway¶
Define labels before architecture. ESMM separates post-impression click probability, post-click conversion, and their joint event. MMoE shares experts with task-specific gates. PLE separates shared from task-private information. Duration, delayed conversion, exposure selection, and attribution change what supervision means. Pseudo-labels and set rewards need justification. Causal lift asks a counterfactual question not answered by prediction accuracy.
Example¶
With 1,000 impressions, CTR 10%, and post-click CVR 20%, joint click-and-conversion probability is 2%, or about 20 conversions. A new policy cannot claim all 20; some users would have purchased anyway.
Common pitfall¶
Sharing tasks does not remove selection bias. Treating unclicked examples as CVR negatives confuses conditional and joint probabilities. Delay, missing features, and exposure are not one noise source. Verify each observation assumption; synthetic labels support only mechanism checks.
Reading order¶
Use ESMM to establish funnel probabilities, MMoE for task-specific selection of shared experts, and PLE for private paths under conflict. All train locally on public constructed tasks, not real ad funnels.
- Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate · Original paper
- Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts · Original paper
- Progressive Layered Extraction (PLE): A Novel Multi-Task Learning Model for Personalized Recommendations · Original paper
Check your understanding¶
CTR rises from 10% to 20% and post-click CVR stays at 20%, doubling joint conversion to 4%. Does this prove better CVR or causal lift?
Show suggested answer
Neither follows. CTR alone can double the joint rate while conditional CVR stays unchanged. Causal lift still requires a credible control or identification assumptions.