🔬 Applied Scientist & ML Specialist938 Problems · 127 Topics🌐 Linked to Tech Vault

TalentMe Science Depth: Universal Applied Science & ML Depth Problem Bank

938 end-to-end science depth, system design, transition bridge & BQ problems covering derivations, production trade-offs, pitfalls, and follow-ups.

🎯

Science Depth Mastery Tracker

0% Mastered

Locally synced in your browser. Track, review, and master all 938 scientific & design topics.

Mastered: 0
Reviewing: 0
Unstarted: 938
🚀 Start Next Unpracticed →
🌐
Linked to TalentMe Tech Vault & MindmapsGlobal System
All 938 questions are directly linked to TalentMe's Tech Vault guides, atomic cards, and interactive mindmaps.
🧭Math Foundations Mindmap & Cards→📖Bayesian Inference, Entropy & KL Divergence→🎯DS Track→
Found 24 in-depth questions
M7-043Retrieval, Ranking & RecSysCross-Encoder Re-Ranking
Hard

Explain Latency and Throughput Optimization Techniques for Deep Re-Ranking Models

⚡ One-Sentence Answer

Re-ranking latency is optimized through candidate pool pruning, model distillation (MiniLM), INT8/FP8 quantization, ONNX Runtime/TensorRT compilation, FlashAttention-2, and cascading coarse-to-fine re-ranking.

Math & Tradeoffs→
M7-044Retrieval, Ranking & RecSysCross-Encoder Re-Ranking
Hard

Explain the Methodologies, Advantages, and Operational Costs of LLM-Based Listwise Re-Ranking

⚡ One-Sentence Answer

LLM listwise re-ranking feeds the query and a formatted candidate list directly into a large language model prompt to output an ordered permutation, capturing multi-hop contextual reasoning and document cross-comparisons at the cost of high token latency and position bias.

Math & Tradeoffs→
M7-045Retrieval, Ranking & RecSys学习排序 (LTR)
Easy

Compare Pointwise, Pairwise, and Listwise Learning-to-Rank (LTR) Methodologies

⚡ One-Sentence Answer

Pointwise LTR models relevance as independent regression or classification per document, Pairwise LTR optimizes the relative ordering of document pairs as an AUC proxy, and Listwise LTR directly minimizes permutation divergence against metric benchmarks like NDCG.

Math & Tradeoffs→
M7-046Retrieval, Ranking & RecSys学习排序 (LTR)
Easy

Explain the Core Principles, Lambda Gradients, and GBDT Integration of LambdaMART

⚡ One-Sentence Answer

LambdaMART marries the non-smooth metric optimization of LambdaRank with the robust expressive power of Gradient Boosted Decision Trees (MART), utilizing virtual lambda gradients scaled by absolute metric changes (|Delta NDCG|) as pseudo-residuals for tree fitting.

Math & Tradeoffs→
M7-047Retrieval, Ranking & RecSys学习排序 (LTR)
Medium

Explain Position Bias in Search Ranking and Algorithmic Debiasing via Inverse Propensity Scoring (IPS)

⚡ One-Sentence Answer

Position bias causes users to disproportionately view and click higher-ranked results regardless of true relevance; training directly on raw click logs creates a self-reinforcing feedback loop that Inverse Propensity Scoring (IPS) and counterfactual learning systematically resolve.

Math & Tradeoffs→
M7-048Retrieval, Ranking & RecSys学习排序 (LTR)
Medium

Explain the Taxonomy and Classification of Ranking Features in Search and Recommendation

⚡ One-Sentence Answer

Ranking features are systematically categorized into query features, document/item features, query-document interaction features, and user context features; dense interaction features deliver the strongest discriminative power but demand the highest compute.

Math & Tradeoffs→
M7-049Retrieval, Ranking & RecSys学习排序 (LTR)
Hard

Explain Multi-Objective Ranking Formulation, Loss Functions, and Pareto Optimization

⚡ One-Sentence Answer

Multi-objective ranking models simultaneously predict diverse user engagement signals (CTR, CVR, dwell time, long-term retention) and combine them via parametric weighting, Pareto efficiency, or constrained optimization to balance short-term monetization against ecosystem health.

Math & Tradeoffs→
M7-050Retrieval, Ranking & RecSys学习排序 (LTR)
Hard

Explain the Sources of Offline-Online Metric Discrepancies in Search and Recommendation

⚡ One-Sentence Answer

Discrepancies between offline evaluation gains (NDCG, AUC) and online business outcomes (CTR, GMV, retention) stem from feature distribution skew, presentation and position bias, feedback loop compounding, and fundamental metric misalignment.

Math & Tradeoffs→
M7-051Retrieval, Ranking & RecSys学习排序 (LTR)
Hard

Explain Feature Engineering and Feature Importance Analysis (SHAP, Gain) in Learning-to-Rank

⚡ One-Sentence Answer

Effective LTR feature engineering designs non-linear interactions, temporal aggregates, and normalized embeddings, while feature attribution methods (such as GBDT split gain and SHAP values) quantify feature impact and identify candidates for pruning.

Math & Tradeoffs→
M7-052Retrieval, Ranking & RecSysRecommender Systems Foundations
Easy

Explain the Two Paradigms of Collaborative Filtering: User-Based CF versus Item-Based CF

⚡ One-Sentence Answer

UserCF recommends items favored by historically similar users, while ItemCF recommends items historically co-interacted with items the user previously engaged with; ItemCF is preferred in industry due to item stability and computational scalability.

Math & Tradeoffs→
M7-053Retrieval, Ranking & RecSysRecommender Systems Foundations
Easy

Explain Matrix Factorization (MF) and Latent Factor Models in Collaborative Filtering

⚡ One-Sentence Answer

Matrix Factorization decomposes a sparse user-item interaction matrix into low-rank user and item latent embedding matrices, predicting ratings via vector dot products trained through Stochastic Gradient Descent (SGD) or Alternating Least Squares (ALS).

Math & Tradeoffs→
M7-054Retrieval, Ranking & RecSysRecommender Systems Foundations
Medium

Explain the Distinctions Between Explicit and Implicit Feedback and Methodologies for Implicit Data (iALS)

⚡ One-Sentence Answer

Explicit feedback provides clear positive and negative ratings but suffers from extreme sparsity, whereas implicit feedback (clicks, views) is abundant but lacks explicit negatives; implicit systems employ confidence weighting (iALS) and negative sampling (BPR) for robust modeling.

Math & Tradeoffs→
M7-055Retrieval, Ranking & RecSysRecommender Systems Foundations
Medium

Explain the Theoretical and Operational Necessity of the Two-Stage (Retrieval-Ranking) Architecture

⚡ One-Sentence Answer

The two-stage cascade architecture is mathematically mandated by finite compute and strict latency constraints, decoupling high-capacity candidate generation over millions of items from expressive, high-precision ranking over a concentrated subset.

Math & Tradeoffs→
M7-056Retrieval, Ranking & RecSysRecommender Systems Foundations
Hard

Explain Sequential Recommendation and User Behavior Modeling (GRU4Rec, SASRec, BERT4Rec)

⚡ One-Sentence Answer

Sequential recommendation models the dynamic chronological evolution of user interests from interaction sequences, progressing from recurrent neural networks (GRU4Rec) to causal self-attention (SASRec) and bidirectional masked models (BERT4Rec).

Math & Tradeoffs→
M7-057Retrieval, Ranking & RecSysRecommender Systems Foundations
Hard

Explain the Alignment Between Offline Evaluation Metrics and Online Business Objectives in Recommendation

⚡ One-Sentence Answer

Recommendation systems evaluate offline algorithmic quality via Recall@K, NDCG@K, and Group AUC (GAUC), systematically aligning these proxy metrics with online business objectives (CTR, GMV, dwell time, retention) while monitoring health guardrails.

Math & Tradeoffs→
M7-058Retrieval, Ranking & RecSysRecommender Systems Foundations
Hard

Explain Candidate Generation Channel Architecture in Recommender Systems (i2i, u2i, Popularity, New Items)

⚡ One-Sentence Answer

Industrial recommendation deploys heterogeneous candidate generation channels—Item-to-Item (i2i), User-to-Item (u2i), real-time session, and exploratory channels—allocating candidate quotas based on distinct marginal recall contributions.

Math & Tradeoffs→
M7-059Retrieval, Ranking & RecSysDeep Recommendation Models
Easy

Explain the Architecture, Memorization versus Generalization Trade-Off, and Joint Training of Wide&Deep

⚡ One-Sentence Answer

Wide&Deep unifies linear models with manual cross-features (Wide component for memorization of frequent co-occurrences) and deep neural networks with dense embeddings (Deep component for generalization to unseen feature combinations) via joint backpropagation.

Math & Tradeoffs→
M7-060Retrieval, Ranking & RecSysDeep Recommendation Models
Easy

Explain the Architectural Upgrades of DeepFM over Wide&Deep: Automatic 2nd-Order Crosses and Shared Embeddings

⚡ One-Sentence Answer

DeepFM eliminates manual cross-feature engineering by replacing Wide&Deep's linear Wide component with a Factorization Machine (FM) engine and sharing embedding matrices between FM and Deep components for end-to-end training.

Math & Tradeoffs→
M7-061Retrieval, Ranking & RecSysDeep Recommendation Models
Medium

Explain the Architecture and Target-Aware Attention Mechanism of Deep Interest Network (DIN)

⚡ One-Sentence Answer

DIN replaces static user pooling with a target-aware local activation unit, dynamically calculating attention weights over a user's historical behavior sequence conditioned on the specific candidate ad/item being evaluated.

Math & Tradeoffs→
M7-062Retrieval, Ranking & RecSysDeep Recommendation Models
Medium

Explain Multi-gate Mixture-of-Experts (MMoE) and Multi-Task Learning Architectures in Recommendation Systems

⚡ One-Sentence Answer

MMoE resolves task conflicts and negative transfer in multi-task recommendation by replacing rigid Shared-Bottom layers with an ensemble of sub-expert networks dynamically combined through task-specific gating routers.

Math & Tradeoffs→
M7-063Retrieval, Ranking & RecSysDeep Recommendation Models
Hard

Explain How the Entire Space Multi-Task Model (ESMM) Eliminates Sample Selection Bias (SSB) and Data Sparsity in CVR

⚡ One-Sentence Answer

ESMM models post-click conversion rate (CVR) across the entire impression space by mathematically decomposing Click-Through and Conversion Rate (CTCVR) as pCTCVR = pCTR * pCVR, training on unselected impression logs to eliminate sample selection bias.

Math & Tradeoffs→
M7-064Retrieval, Ranking & RecSysDeep Recommendation Models
Hard

Explain Key Principles of Feature Engineering and Embedding Design in Deep Recommendation

⚡ One-Sentence Answer

Deep recommendation feature architectures balance continuous and sparse high-cardinality categorical inputs through non-linear bucketization, empirical fourth-root embedding dimension scaling (dim ~ cardinality^0.25), and frequency-based regularization.

Math & Tradeoffs→
M7-065Retrieval, Ranking & RecSysDeep Recommendation Models
Hard

Explain Long-Sequence User Behavior Modeling and Two-Stage Search-Based Interest Networks (SIM)

⚡ One-Sentence Answer

SIM (Search-based Interest Model) decouples long-sequence user modeling (sequences with thousands of items) into two stages: a fast General Search Unit (GSU) that sub-samples candidates to top-k relevant items, and an Exact Search Unit (ESU) that executes target-aware attention.

Math & Tradeoffs→
M7-066Retrieval, Ranking & RecSysCold Start & Long-Tail Distribution
Easy

Explain the Three Types of Cold-Start Problems in Recommendation and Practical Mitigation Strategies

⚡ One-Sentence Answer

The cold-start challenge manifests across new users (no behavior history), new items (no interaction data), and new systems (no collaborative signal); robust systems mitigate it using side-information, bandit exploration, content embeddings, and cross-domain transfer.

Math & Tradeoffs→