AIInterviewTraining logoAIInterview/Training

classification

AI, ML & GenAI interview questions tagged classification, across every topic.

13 questions · 1 unlocked for you

Concepts behind "classification"

The curriculum that explains the ideas these questions test.

Foundational
📊 Evaluation & ML Foundations
Linear and Logistic RegressionLinear regression fits a weighted sum of features to a continuous target by minimizing squared error; logistic regression squashes that same linear score through a sigmoid and fits it with cross-entropy to yield a probability. Interviews probe these because they are the baseline every model is measured against, the coefficients read directly, and logistic regression is still the production default when you need a calibrated binary score.
Foundational
📊 Evaluation & ML Foundations
kNN and the Curse of Dimensionalityk-nearest-neighbors is a lazy, instance-based learner that labels a point by majority vote of its closest training examples under some distance metric. Interviews probe it because its failure mode, distance concentration in high dimensions, shows why naive nearest-neighbor search breaks down and why production systems rely on approximate nearest-neighbor indexes instead.
Core
🧠 Foundations of LLMs & GenAISign in
Logits, Log-Probs, and Logit BiasThe output layer of an LLM is an API surface, not just an implementation detail. Logits are raw per-token scores, softmax turns them into probabilities, and log-probs are what providers actually return because they are numerically stable and add up across a sequence. Four production techniques live here: confidence scoring for routing and abstention, logit bias to ban or force a token, structured decoding by masking invalid tokens, and classification by reading a single position's log-probs instead of parsing prose. AI, ML, and GenAI engineer interviews probe it because it is the difference between treating the model as a text box and treating it as a probabilistic component.
Core
📊 Evaluation & ML FoundationsSign in
SVMs and the Kernel TrickA support vector machine finds the decision boundary with the widest margin to the nearest points (the support vectors), trading hinge loss against margin width. The kernel trick lets it draw nonlinear boundaries by computing inner products in a high-dimensional space without ever building the features. Interviews probe SVMs because they reward grasping margins, duality, and the specific regime (small, high-dimensional data) where they still beat trees and neural nets.
Core
📊 Evaluation & ML FoundationsSign in
Generative vs Discriminative Models (Naive Bayes)A discriminative model learns P(y|x) directly, the decision boundary. A generative model learns the joint P(x,y), so it models how the data is produced and recovers the label via Bayes. Naive Bayes is the canonical generative classifier and rests on a strong conditional-independence assumption. AI, ML, and GenAI engineer interviews probe this to check whether you know that generative wins with little data or missing features while discriminative wins on raw accuracy once data is plentiful.
Core
📊 Evaluation & ML FoundationsSign in
Imbalanced Data and ResamplingImbalanced data is when one class is rare (fraud, churn, disease), so a model that predicts only the majority scores high accuracy while being useless. The fixes are resampling, class weighting, and threshold moving, plus choosing the right metric. AI, ML, and GenAI engineer interviews probe it because nearly every real classification problem is skewed, and the trap of resampling the test set or trusting accuracy is common.