optimization

DP feels like pattern-matching magic until you have a method. The signal is a repeatable drill: spot overlapping subproblems and optimal substructure, define the state and recurrence, then memoize or tabulate. Here is that method applied to a worked example.

Many state-of-the-art training runs hold a shadow copy of the weights that averages the trajectory, then serve that rather than the final step. It's a few lines and a genuine accuracy gain. Here it is.

Nearly every modern training run relies on warmup-then-cosine, and getting it wrong destabilizes early training or squanders the tail. It's a closed-form function of the step. Here is the implementation and the why.

Binary search on the answer cracks minimize-the-maximum and capacity problems by guessing the result and testing feasibility with a monotone predicate. The signal is spotting monotonicity and writing a clean feasibility function. Here is the answer.

A build-it-yourself check on how learning-rate schedules are actually computed. What matters is correct closed-form formulas, knowing when each schedule shines, and why decaying the rate aids convergence. Below is the implementation of the common ones.

Optimizer questions probe whether you grasp what each one adapts and the subtle AdamW fix that the whole field now relies on. The signal is the per-parameter adaptivity story plus why tying weight decay to Adam was a bug. Here is that answer.

A bandit learns and optimizes at the same time, moving traffic toward the winning arm during the experiment rather than holding the split fixed like an A/B test. Interviewers look for the explore-exploit tradeoff, the three core algorithms, and a clear sense of when a bandit wins over a clean A/B test.

The learning rate is the single hyperparameter that can NaN your run at step 50 or stall it indefinitely. Modern training schedules it rather than pinning it to one value. Interviewers want you to know precisely what warmup and decay each give you. Here is the answer.

Everyone says 'gradient descent,' but the batch-size decision and momentum are the actual interview content. What earns credit is the noise-vs-cost tradeoff across batch/SGD/mini-batch and why momentum pays off.

The loss sets what the model optimizes, and the wrong choice silently sinks it. What counts is matching the loss to the task and data (outliers, imbalance), rather than reflexively reaching for MSE or cross-entropy.

'The model won't train' comes down to a short list of usual suspects, each with a distinctive loss-curve signature. The shape of the curve names the bug before you touch a single hyperparameter. Here is how to read it.

The notion that models, like students, learn better starting from easy examples is intuitive, and it sometimes works and sometimes does nothing. Knowing when it pays off is the real signal. Here is the honest answer.

The reflex is 'add an index,' but a good engineer reads the plan before touching anything. The signal is spotting the operator that dominates runtime, comparing estimated against actual rows, and knowing the seq-scan, bad-join, and spill patterns.

Dynamic pricing combines demand forecasting, optimization, and real-time serving, under fairness and trust constraints. The signal is the predict-then-optimize structure plus guardrails against perverse outcomes. Here is the design.

The trap is leaping straight to 'add more GPUs.' The signal is profiling first, then reaching for the cheap, no-retrain levers in the correct sequence. Here is the diagnose-then-optimize playbook for p99.

OOM is the wall you hit most often in deep learning, and 'buy a bigger GPU' is the weakest reply. What counts is naming the memory consumers, knowing which one dominates, and pairing the right lever with it.