40Walk me through SGD vs mini-batch vs Adam, learning-rate schedules, and what vanishing or exploding gradients look like in practice.▼mediumGoogleDatabricksScale1 replies◆ premiumMost candidates recite the Adam update equation and stop. The interviewer wants the decision: when plain SGD with momentum still wins, why Adam is the safe default for new architectures, and how you diagnose a training run that is silently dying from a gradient that shrank to zero.Open full answer →
41Explain backpropagation and why deep networks can be trained at all, without writing a wall of calculus.▼medium★ EssentialGoogleScaleMeta1 replies◆ premiumBackprop is just the chain rule run efficiently in reverse, but the question that separates levels is why a hundred-layer network trains when a naive one wouldn't. The credit-assignment intuition plus the three tricks that keep gradients alive.Open full answer →
42Why did attention and transformers replace RNNs for sequence modeling? Explain it conceptually.▼mediumGoogleScaleMeta1 replies◆ premiumThe answer is not just 'transformers are better.' It is two specific wins: every position can attend to every other in one step (long-range dependencies) and the whole sequence trains in parallel instead of one token at a time. Plus the cost that buys, and where RNNs still make sense.Open full answer →
43Explain CNN fundamentals (convolution, pooling, parameter sharing). When does classical computer vision still matter?▼mediumGoogleScaleMeta1 replies◆ premiumConvolution and parameter sharing are why a CNN needs a tiny fraction of the weights a dense net would, and why it generalizes across position. The conceptual answer, the feature-hierarchy picture, and the honest take on when a fine-tuned CNN still beats reaching for a giant vision-language model.Open full answer →
44Gradient boosting vs random forests: how does each build trees, the bias-variance behavior, and when to pick which?▼hardDatabricksGoogleSnowflake1 replies◆ premiumBoth are tree ensembles, but one averages independent deep trees to kill variance and the other adds shallow trees in sequence to kill bias. That single difference dictates the failure modes, the tuning burden, and which one you hand a customer who will retrain it after you leave.Open full answer →
45Explain SVMs and the kernel trick: what is the margin, when do kernels actually help, and why did SVMs fade for large datasets?▼mediumGoogleDatabricksScale1 replies◆ premiumThe margin idea is elegant and worth understanding, and the kernel trick is a clever move. But the question that separates levels is why a model that dominated the 2000s is now a niche pick. The scaling math that killed it for big data, and where it still wins.Open full answer →
46Walk me through Bayes' theorem on a real diagnostic problem: why can a 99%-accurate test still be wrong most of the time it fires?▼mediumGoogleDatabricksScale2 replies◆ premiumThe base-rate trap is the classic, and it is not academic: it is exactly how a high-accuracy fraud or disease classifier drowns ops in false alarms. The worked numbers, the tree you draw on the whiteboard, and the two levers that actually fix it in production.Open full answer →
47MLE vs MAP: what exactly does the prior buy you, and when does it matter in an applied model?▼mediumGoogleDatabricksScale1 replies◆ premiumMAP is MLE plus a prior, and that prior is not academic decoration: it is the same thing as regularization, and it is what stops a model from making confident nonsense out of three data points. The connection that makes this an applied answer, not a stats-class recitation.Open full answer →
48How do you choose and interpret a distribution for a quantity? When is it Bernoulli vs Poisson vs Normal?▼mediumGoogleDatabricksScale1 replies◆ premiumPicking the wrong distribution silently breaks your model: counts are not Gaussian, and treating them that way predicts negative events and underestimates the variance of busy periods. The decision tree by data type, the variance gotcha, and what each choice implies for the model you reach for.Open full answer →
49Core difference between machine learning and deep learning, and when would you pick classical ML over a neural net?▼easyDatabricksGoogleScale1 replies◆ premiumThe honest version: deep learning learns its own features but is hungry for data and compute, and on a customer's 50,000-row tabular dataset a gradient-boosted tree wins on accuracy, cost, and time-to-ship. The dividing line and the conditions that flip it.Open full answer →
50What are Type I and Type II errors? Use an enterprise spam filter to make it concrete and tie each to a business cost.▼easyGoogleMicrosoftDatabricks1 replies◆ premiumA Type I error blocks a real invoice; a Type II error delivers the phishing email. Which one costs the customer more decides where you set the threshold. The spam-filter framing, the precision/recall mapping, and the asymmetric-cost call interviewers want.Open full answer →
51Handed a messy new customer dataset: your first exploratory steps, and how do you handle missing values?▼mediumDatabricksScalePalantir1 replies◆ premiumProfile before you model: shape, types, target balance, leakage check. Then the part most candidates botch, that a missing value is often the most predictive feature in the table, so you flag it before you fill it. The first-hour playbook and the imputation decisions that survive production.Open full answer →
52Contrastive loss vs triplet loss for training embedding models: when would you reach for each?▼mediumCohereScaleGlean1 replies◆ premiumTriplet loss contrasts an anchor against one negative; modern contrastive losses like InfoNCE contrast against a whole batch at once, which is why CLIP-style training scales and old triplet pipelines stalled. The mining problem, the batch-size lever, and the call interviewers want.Open full answer →
53L1 vs L2 regularization: what does each do to the weights, why does L1 induce sparsity, and when would you prefer L1?▼mediumGoogleDatabricksScale1 replies◆ premiumL2 shrinks every weight smoothly toward zero; L1 drives many weights to exactly zero, which is automatic feature selection. The geometric reason L1 hits the corners is the part interviewers actually want, plus the call on when sparsity beats smooth shrinkage.Open full answer →
54What is a confusion matrix, and give a concrete case where accuracy is misleading.▼easyGoogleMicrosoftScale1 replies◆ premiumA confusion matrix is the 2x2 of right and wrong predictions per class, and it is the reason a 99% accurate fraud model can be useless. The worked imbalance example, and how reading the matrix as precision and recall fixes the lie.Open full answer →
55What is a validation set for, and how do you use it during training without overfitting to it?▼easyGoogleDatabricksMicrosoft1 replies◆ premiumThe validation set is the one you tune and select on; the test set is the one you only look at once. Confusing them, or tuning so hard you overfit the validation set, is how a model that aced offline metrics dies in production.Open full answer →
56Explain gradient descent intuitively, and how do you decide when to stop training?▼mediumGoogleDatabricksOpenAI1 replies◆ premiumGradient descent is walking downhill on the loss surface, one step proportional to the slope. Knowing when to stop is the part that separates people who have trained models from people who have read about them: it is the validation curve, not the training curve, that tells you.Open full answer →
70Two annotators labeled 500 support tickets and disagree on 30%. The customer wants to train on these labels next week. What do you do?▼mediumNewScalePalantirDatabricks2 replies◆ premiumThirty percent disagreement is not a fact about the annotators. It is a fact about the task definition, and on a skewed label set it can mean the labels are worse than chance. The week is spent on the guideline and the gold set, not on the model, because no model trains past the noise in its labels.Open full answer →