AppliedAIPrep logoAppliedAI/Prep

optimization

Applied AI interview questions tagged optimization, across every topic.

16 questions · 2 unlocked for you

Concepts behind "optimization"

The curriculum that explains the ideas these questions test.

Foundational
📊 Evaluation & ML Foundations
Gradient Descent and OptimizersGradient descent is how models learn: compute the gradient of the loss with respect to the parameters and step opposite it to reduce error. Mini-batch SGD (a small batch per step) is the workhorse, balancing stable gradients with speed and GPU parallelism. Momentum smooths the path, and Adam (momentum plus per-parameter adaptive rates) is the default. The learning rate is the most important knob, scheduled with warmup and decay. Applied-AI interviews probe it because it underlies all training and the failure modes (divergence, getting stuck) are diagnosable.
Core
💻 Coding & Engineering CraftSign in
Dynamic ProgrammingDynamic programming solves problems that have overlapping subproblems and optimal substructure by defining a state, writing a recurrence, and caching results so each subproblem is computed once. The skill is the framework (state, recurrence, base case, order of evaluation), not memorizing tricks. Applied-AI interviews probe it because it screens for whether you can turn a fuzzy optimization into a precise recurrence rather than recognizing a pattern you saw before.
Core
💻 Coding & Engineering CraftSign in
Greedy AlgorithmsGreedy algorithms build a solution by always taking the locally best choice and never reconsidering. They are fast and simple, but only correct when a greedy choice is provably globally optimal, which you justify with an exchange argument. Applied-AI interviews probe greedy because the screen is whether you can tell when it works (interval scheduling, Huffman) from when it silently returns a wrong answer, and whether you reach for DP instead.