🔬 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
M6-092Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Easy

Core Challenges of Video Generation Beyond 2D Image Synthesis: Temporal Consistency and Physics

⚡ One-Sentence Answer

Video generation extends 2D image synthesis into the temporal dimension, confronting severe challenges in inter-frame consistency, continuous physical law adherence, and explosive spatio-temporal computational costs.

Math & Tradeoffs→
M6-093Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Easy

Spatio-Temporal Attention Architectures in Video Diffusion Models

⚡ One-Sentence Answer

Video diffusion models manage the quadratic computational complexity of multi-frame sequences by factorizing attention into decoupled spatial self-attention, cross-attention, and temporal self-attention blocks.

Math & Tradeoffs→
M6-094Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Medium

Neural Radiance Fields (NeRF) vs 3D Gaussian Splatting: Continuous Volumetric vs Discrete Primitives

⚡ One-Sentence Answer

NeRF models 3D scenes as continuous implicit neural volumetric functions optimized via ray marching, while 3D Gaussian Splatting represents scenes using explicit anisotropic 3D Gaussians rendered via fast tile-based rasterization.

Math & Tradeoffs→
M6-095Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Medium

Foundational Pipelines of Speech Recognition (ASR) and Text-to-Speech (TTS)

⚡ One-Sentence Answer

Speech processing spans dual inverse workflows: Automatic Speech Recognition (ASR) decodes raw audio waveforms into text tokens via acoustic encoders, while Text-to-Speech (TTS) synthesizes audio waveforms from text via acoustic models and neural vocoders.

Math & Tradeoffs→
M6-096Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Hard

Challenges and Trade-offs of Unified Multimodal Tokenization

⚡ One-Sentence Answer

Unified multimodal tokenization compresses heterogeneous modalities (text, vision, audio) into a single vocabulary, balancing discretization information loss against sequence length explosion and representation scale imbalance.

Math & Tradeoffs→
M6-097Multimodal & Generative ModelsVideo, 3D & Audio Generative Models
Hard

Evaluation Methodologies and Holistic Benchmarking in Omni-Modal Models

⚡ One-Sentence Answer

Evaluating omni-modal foundation models requires multi-tiered benchmarking across cross-modal synergy, sensory understanding, real-time conversational streaming, and robustness under missing modalities.

Math & Tradeoffs→
M7-001Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Easy

Write the BM25 Formula and Explain the Roles of Hyperparameters k1 and b

⚡ One-Sentence Answer

BM25 weights terms using saturated term frequency with document length normalization and inverted document frequency (IDF), where k1 modulates the term frequency saturation curve and b governs the strength of document length penalty.

Math & Tradeoffs→
M7-002Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Easy

Explain the Structure and Query Processing Pipeline of an Inverted Index

⚡ One-Sentence Answer

An inverted index maps vocabulary terms to posting lists containing document IDs, term frequencies, and positions; query processing intersects or unions posting lists before ranking documents via scoring algorithms.

Math & Tradeoffs→
M7-003Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Medium

Explain the Motivation Behind TF-IDF and Its Two Constituent Components

⚡ One-Sentence Answer

TF evaluates a term's local relevance within a specific document, while IDF measures its global discriminative power across the entire corpus; their product assigns maximum weight to terms that are frequent locally yet rare globally.

Math & Tradeoffs→
M7-004Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Medium

Explain the Principles and Architecture of Learned Sparse Retrieval Such as SPLADE

⚡ One-Sentence Answer

SPLADE projects tokens through a BERT masked language modeling (MLM) head with ReLU activations and max-pooling to produce sparse term weights over the vocabulary, combining deep semantic expansion with inverted index execution efficiency.

Math & Tradeoffs→
M7-005Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Hard

Explain the Limitations of Sparse Retrieval and Key Directions for Improvement

⚡ One-Sentence Answer

Sparse retrieval is fundamentally constrained by vocabulary mismatch, word order insensitivity, and lack of semantic generalization; key remediation strategies include learned query expansion, learned sparse models, and dense-sparse hybrid retrieval.

Math & Tradeoffs→
M7-006Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Hard

Explain the Impact of Document Length on Retrieval Scoring and Common Mitigation Strategies

⚡ One-Sentence Answer

Long documents naturally accumulate higher raw term frequencies and accidental matches; length normalization (such as BM25 parameter b), document chunking, and field weighting eliminate unfair verbosity advantages.

Math & Tradeoffs→
M7-007Retrieval, Ranking & RecSysSparse Retrieval (BM25 / TF-IDF)
Hard

Explain Key BM25 Extensions and Enhancements: BM25+, BM25F, and Learning-to-Rank Weights

⚡ One-Sentence Answer

BM25+ establishes a lower bound on term frequency scores to prevent over-penalizing verbose documents, BM25F computes non-linear saturation over weighted multi-field combinations, and Learning-to-Rank dynamically learns feature weights.

Math & Tradeoffs→
M7-008Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Easy

Explain the Architecture and Training Protocol of Dual Encoder (Bi-Encoder) Retrieval

⚡ One-Sentence Answer

Dual encoder models map queries and documents into a shared vector embedding space via separate or shared encoders, enabling document vectors to be precomputed offline and queried online in sub-millisecond time via approximate nearest neighbor (ANN) search.

Math & Tradeoffs→
M7-009Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Easy

Explain Dense Passage Retrieval (DPR) Training with In-Batch Negatives

⚡ One-Sentence Answer

DPR trains independent query and passage encoders using in-batch negatives (treating other queries' positive passages within the batch as negatives) augmented with BM25 hard negatives to optimize retrieval discriminativeness.

Math & Tradeoffs→
M7-010Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Medium

Explain the Role and Methodology of Hard Negative Mining in Dense Retrieval

⚡ One-Sentence Answer

Random negatives provide negligible gradient signals because the model easily distinguishes them; hard negative mining identifies semantically or lexically similar non-relevant passages to enforce sharp decision boundaries.

Math & Tradeoffs→
M7-011Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Medium

Explain the Temperature Parameter in Contrastive Learning and Its Impact on Optimization

⚡ One-Sentence Answer

The temperature parameter tau scales the logit distribution in the softmax denominator; a smaller tau sharpens the distribution to focus gradients on the hardest negatives, while a larger tau distributes gradients more uniformly across all samples.

Math & Tradeoffs→
M7-012Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain the Trade-Off Between Embedding Dimensionality and Storage/Compute Costs in Dense Retrieval

⚡ One-Sentence Answer

Higher embedding dimensions improve semantic capacity but scale index storage and ANN latency linearly; techniques like Matryoshka Representation Learning (MRL), Product Quantization (PQ), and binary quantization optimize the Pareto frontier.

Math & Tradeoffs→
M7-013Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain the Key Challenges and Solutions in Cross-Modal Dense Retrieval

⚡ One-Sentence Answer

Cross-modal retrieval projects disparate modalities (text, images, audio) into a shared embedding space, facing core hurdles including modality gaps, noisy training alignment, and preserving fine-grained details against global semantics.

Math & Tradeoffs→
M7-014Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain Instruction-Based and Task-Specific Dense Embeddings in Modern Retrievers

⚡ One-Sentence Answer

Instruction-based embedding models (e.g., E5, BGE, Instructor) prepend task instructions or prefixes to inputs, enabling a single unified encoder to dynamically optimize representations for disparate tasks like retrieval, clustering, and classification.

Math & Tradeoffs→
M7-015Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain the Problem of False Negatives in Dense Retrieval and Debiasing Strategies

⚡ One-Sentence Answer

In-batch and mined negatives frequently contain unlabeled yet genuinely relevant passages; treating them as negative samples injects destructive gradient penalties that suppress relevant content, necessitating algorithmic debiasing and filtering.

Math & Tradeoffs→
M7-016Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain Domain Adaptation and Fine-Tuning Strategies for Dense Retrieval Models

⚡ One-Sentence Answer

General-domain embeddings degrade under specialized domain vocabularies (medical, legal, code); unsupervised masked language model adaptation, synthetic query generation (GPL), and contrastive fine-tuning with hard negatives restore state-of-the-art recall.

Math & Tradeoffs→
M7-017Retrieval, Ranking & RecSysDense Retrieval & Dual-Encoders
Hard

Explain Multilingual and Cross-Lingual Dense Retrieval Architectures and Alignment Techniques

⚡ One-Sentence Answer

Multilingual dense retrieval maps queries and documents from diverse languages into a shared vector space, enabling direct cross-lingual matching (e.g., Chinese query retrieving English documents) without runtime machine translation.

Math & Tradeoffs→
M7-018Retrieval, Ranking & RecSysHybrid Retrieval & RRF Fusion
Easy

Explain the Principles of Reciprocal Rank Fusion (RRF) and the Role of Hyperparameter k

⚡ One-Sentence Answer

RRF fuses multiple retrieval candidate lists by summing the reciprocal of each item's rank offset by constant k, providing scale-invariant, calibration-free rank aggregation that is highly robust to score distribution disparities.

Math & Tradeoffs→