100 MACHINE LEARNING QUESTION BANK: BASIC TO PROFESSIONAL LEVEL INTERVIEW & CONCEPT MASTERCLASS

A comprehensive categorized question bank spanning 100 fundamental to professional-level machine learning interview questions, covering supervised learning, neural networks, optimization, MLOps, and system design.

📚 Comprehensive ML Mastery from Foundations to Production Architecture

Preparing for machine learning engineering interviews or strengthening foundational theory requires structured practice across core technical domains. This question bank is divided into 10 progressive tiers (10 questions per tier), moving from basic statistical concepts and supervised algorithms to advanced deep learning, transformer architectures, reinforcement learning, and MLOps production systems.

Tier 1 (Q1–Q10): Fundamentals of Machine Learning & Data Preprocessing
Core introductory concepts covering supervised vs. unsupervised learning, train/test splits, data cleaning, scaling, and handling missing values.
ML Question Bank - Tier 1
Q1. What is the fundamental difference between Supervised and Unsupervised Learning?
-> Supervised learning uses labeled training data to learn mapping functions from inputs to outputs (e.g., classification, regression). Unsupervised learning discovers hidden patterns or intrinsic structures in unlabeled data (e.g., clustering, dimensionality reduction).

Q2. What is the Bias-Variance Trade-off?
-> Bias measures the error from erroneous assumptions in the learning algorithm (leading to underfitting). Variance measures error from sensitivity to small fluctuations in the training set (leading to overfitting). Achieving optimal generalization requires balancing both.

Q3. Why do we split data into Train, Validation, and Test sets?
-> Training set fits model parameters. Validation set tunes hyperparameters and prevents data leakage during model selection. Test set provides an unbiased final evaluation of generalization performance on unseen data.

Q4. What is Data Leakage and how do you prevent it?
-> Data leakage occurs when information from outside the training dataset is improperly used to train the model, resulting in unrealistically high performance. Prevent it by performing feature scaling, imputation, and encoding strictly inside cross-validation folds.

Q5. What is the difference between Normalization (Min-Max Scaling) and Standardization (Z-score)?
-> Min-Max scales features to a fixed range (typically [0, 1]). Standardization centers features to zero mean and unit variance. Standardization is less affected by extreme outliers.

Q6. How do you handle missing values in a dataset?
-> Options include deletion (dropping rows/columns if missingness is high or random), imputation (mean, median, mode for numeric/categorical features), or advanced imputation algorithms like KNN Imputer or MICE.

Q7. What is the curse of dimensionality?
-> As the number of features increases, the feature space becomes increasingly sparse, requiring exponentially more data to achieve reliable statistical generalization, often causing models to overfit.

Q8. What is One-Hot Encoding and what is the dummy variable trap?
-> One-hot encoding converts categorical variables into binary indicator columns. The dummy variable trap occurs when categories are perfectly collinear (sum to 1), causing multicollinearity issues in linear models; resolved by dropping one category column.

Q9. What is Cross-Validation (e.g., K-Fold)?
-> K-Fold cross-validation splits training data into K subsets, trains the model on K-1 folds, and validates on the remaining fold, repeating K times to produce robust performance estimates.

Q10. What is Outlier Detection and how does IQR method work?
-> Outliers are extreme values deviating significantly from overall data distribution. The Interquartile Range (IQR) method defines outliers as data points lying below Q1 - 1.5*IQR or above Q3 + 1.5*IQR.
Output: Tier 1 covers data preprocessing, data leakage, scaling, and foundational ML definitions essential for junior and mid-level interviews.
Tier 2 (Q11–Q20): Supervised Learning: Regression & Classification
In-depth questions on Linear Regression, Logistic Regression, Support Vector Machines (SVM), Decision Trees, and evaluation metrics.
ML Question Bank - Tier 2
Q11. What are the assumptions of Linear Regression?
-> Linearity between features and target, independence of residuals, homoscedasticity (constant variance of residuals), normality of error distribution, and absence of multicollinearity.

Q12. What is Logistic Regression and why is it a classification algorithm?
-> Logistic regression applies the sigmoid function to a linear combination of features to output a probability between 0 and 1, establishing a decision boundary for binary classification.

Q13. What is the difference between L1 (Lasso) and L2 (Ridge) Regularization?
-> Ridge (L2) adds a penalty proportional to the sum of squared coefficients, shrinking weights toward zero. Lasso (L1) adds a penalty proportional to the absolute sum of coefficients, driving redundant feature weights to exact zero for feature selection.

Q14. How does a Support Vector Machine (SVM) work?
-> SVM finds an optimal hyperplane that maximizes the geometric margin between different classes. Kernel tricks (RBF, polynomial) project non-linearly separable data into higher dimensions.

Q15. Explain Precision, Recall, F1-Score, and ROC-AUC.
-> Precision = TP / (TP + FP) (minimizes false positives). Recall = TP / (TP + FN) (minimizes false negatives). F1-Score is the harmonic mean of Precision and Recall. ROC-AUC measures true positive rate against false positive rate across classification thresholds.

Q16. When would you use Precision over Recall, and vice versa?
-> Use Precision in spam detection (where false positives block legitimate emails). Use Recall in medical cancer screening (where false negatives miss life-threatening diseases).

Q17. What is Multicollinearity and how do you detect it?
-> Multicollinearity occurs when independent features are highly correlated. Detect it using correlation matrices and Variance Inflation Factor (VIF) scores exceeding 5 or 10.

Q18. What is the difference between Hard Margin and Soft Margin SVM?
-> Hard margin strictly prohibits any misclassifications (requires linear separability). Soft margin introduces slack variables governed by regularization parameter C to allow allowable misclassifications for noisy data.

Q19. What is Logistic Regression's decision threshold and how do you tune it?
-> Default threshold is 0.5. Tune it using Precision-Recall curves or F1-score optimization depending on business cost asymmetries for false positives vs false negatives.

Q20. What is Polynomial Regression and how does it relate to linear models?
-> Polynomial regression fits a non-linear relationship by raising existing features to powers (e.g., x^2, x^3). It remains a linear model because it is linear in the unknown parameters (coefficients).
Output: Tier 2 covers regression assumptions, regularization mechanics, SVM kernels, and classification performance metrics.
Tier 3 (Q21–Q30): Ensemble Learning & Tree-Based Models
Advanced questions on Decision Trees, Random Forests, Gradient Boosting (GBM, XGBoost, LightGBM, CatBoost), Bagging, and Boosting.
ML Question Bank - Tier 3
Q21. What is the difference between Bagging and Boosting?
-> Bagging (Bootstrap Aggregating) trains multiple base learners independently in parallel on bootstrapped subsets and averages predictions to reduce variance (e.g., Random Forest). Boosting trains base learners sequentially, where each new model corrects errors made by previous ones, reducing bias.

Q22. How does a Random Forest reduce overfitting compared to a single Decision Tree?
-> Random Forests build multiple independent trees using random subsets of training samples (bagging) and random subsets of features at each split, decorrelating trees and lowering overall variance.

Q23. Explain how Gradient Boosting Machines (GBM) work.
-> GBM builds trees sequentially. Each new tree is trained to predict the residual errors (gradients of the loss function) of the combined ensemble.

Q24. What are the key architectural improvements of XGBoost over traditional GBM?
-> XGBoost adds second-order Taylor expansion approximation of loss function, built-in L1/L2 regularization, parallelized tree construction (column block structure), and efficient handling of missing values.

Q25. How does LightGBM achieve faster training speeds on massive datasets?
-> LightGBM introduces Gradient-based One-Side Sampling (GOSS) to filter out data instances with small gradients and Exclusive Feature Bundling (EFB) to merge mutually exclusive sparse features, combined with leaf-wise tree growth.

Q26. How does CatBoost handle categorical features natively?
-> CatBoost uses ordered target encoding on permutations of the training dataset to prevent target leakage and greedy categorical feature combinations during tree growth.

Q27. What is Gini Impurity vs. Information Gain (Entropy)?
-> Gini impurity measures the probability of misclassifying a randomly chosen element. Information gain measures the reduction in entropy (uncertainty) after splitting data on a feature.

Q28. What is Out-Of-Bag (OOB) error in Random Forests?
-> OOB error estimates generalization error using samples not included in the bootstrap sample for each individual tree, eliminating the need for a separate validation set.

Q29. What is Tree Pruning (Pre-pruning vs. Post-pruning)?
-> Pre-pruning stops tree growth early based on criteria like max depth or min samples per split. Post-pruning grows a full tree and removes branches that provide little predictive power relative to complexity cost (Cost Complexity Pruning).

Q30. Why might a gradient boosted tree outperform a deep neural network on tabular data?
-> Tabular datasets often feature heterogeneous column types, uninformative feature scales, and irregular decision boundaries where axis-aligned gradient boosted trees excel without requiring extensive feature normalization.
Output: Tier 3 covers ensemble theory, bagging vs. boosting, and advanced gradient boosting libraries (XGBoost, LightGBM, CatBoost).
Tier 4 (Q31–Q40): Unsupervised Learning & Dimensionality Reduction
Clustering algorithms (K-Means, DBSCAN, Hierarchical), Principal Component Analysis (PCA), t-SNE, and anomaly detection.
ML Question Bank - Tier 4
Q31. How does K-Means clustering work and what are its limitations?
-> K-Means partitions data into K clusters by iteratively assigning points to the nearest centroid and recalculating centroids. Limitations include sensitivity to initial centroid placement, requirement to pre-specify K, and assumption of spherical clusters.

Q32. How do you select the optimal number of clusters (K) in K-Means?
-> Using the Elbow Method (plotting inertia/within-cluster sum of squares vs. K) and the Silhouette Score (measuring how similar a point is to its own cluster compared to other clusters).

Q33. What is DBSCAN and how does it outperform K-Means on complex data?
-> DBSCAN (Density-Based Spatial Clustering of Applications with Noise) groups dense regions of points, allowing it to discover arbitrarily shaped clusters and identify noise outliers without pre-specifying cluster counts.

Q34. How does Principal Component Analysis (PCA) work?
-> PCA is an unsupervised linear dimensionality reduction technique that projects high-dimensional data onto orthogonal axes (principal components) that maximize variance.

Q35. What is the difference between PCA and Linear Discriminant Analysis (LDA)?
-> PCA is unsupervised and maximizes total variance regardless of class labels. LDA is supervised and maximizes class separability by projecting data to maximize between-class variance relative to within-class variance.

Q36. What is t-SNE and when is it used?
-> t-Distributed Stochastic Neighbor Embedding (t-SNE) is a non-linear dimensionality reduction technique optimized for visualizing high-dimensional data in 2D or 3D scatter plots by preserving local neighborhood probabilities.

Q37. What is Hierarchical Clustering (Agglomerative vs. Divisive)?
-> Agglomerative clustering is a bottom-up approach that starts with each data point as its own cluster and iteratively merges closest clusters. Divisive is top-down, starting with all points in one cluster and splitting iteratively.

Q38. What is Anomaly Detection and how does Isolation Forest work?
-> Isolation Forest isolates anomalies by randomly selecting features and split values. Because anomalies are few and distinct, they require fewer splits to isolate and appear closer to the root of random trees.

Q39. What is Gaussian Mixture Model (GMM) and Expectation-Maximization (EM)?
-> GMM assumes data is generated from a mixture of Gaussian distributions. Expectation-Maximization (EM) algorithm iteratively estimates latent cluster assignment probabilities (E-step) and updates distribution parameters (M-step).

Q40. What is Kernel PCA?
-> Kernel PCA extends linear PCA to non-linear dimensionality reduction by mapping input features into a high-dimensional kernel Hilbert space where linear principal components can be extracted.
Output: Tier 4 covers clustering paradigms, dimensionality reduction (PCA, t-SNE), and anomaly detection techniques.
Tier 5 (Q41–Q50): Deep Learning Foundations & Neural Networks
Perceptrons, backpropagation, activation functions, vanishing gradients, weight initialization, and optimizers.
ML Question Bank - Tier 5
Q41. What is the difference between a Perceptron and a Multi-Layer Perceptron (MLP)?
-> A single perceptron is a linear binary classifier without hidden layers. An MLP contains an input layer, one or more hidden layers with non-linear activation functions, and an output layer, enabling representation of non-linear decision boundaries.

Q42. What is Backpropagation and how does the Chain Rule apply?
-> Backpropagation calculates the gradient of the loss function with respect to neural network weights by applying the calculus chain rule backward from the output layer to the input layer.

Q43. Why do neural networks require non-linear activation functions?
-> Without non-linear activations, stacking multiple linear layers collapses into a single linear transformation, preventing the network from learning complex hierarchical patterns.

Q44. What is the Vanishing Gradient Problem and how do you mitigate it?
-> In deep networks with saturating activations (sigmoid/tanh), gradients shrink exponentially near zero during backpropagation. Mitigate it using ReLU activations, Batch Normalization, ResNet skip connections, and residual weight initializations (He/Xavier).

Q45. What is the difference between Batch Gradient Descent, Stochastic Gradient Descent (SGD), and Mini-batch SGD?
-> Batch GD computes gradients over the entire dataset (slow, stable). SGD updates weights using a single sample (noisy, fast). Mini-batch SGD computes gradients over small batches (e.g., 32/64 samples), balancing computational efficiency and gradient stability.

Q46. Explain Xavier (Glorot) vs. He weight initialization.
-> Xavier initialization scales random weights based on input and output layer dimensions, ideal for sigmoid/tanh. He initialization scales weights based on input dimensions, optimized for ReLU activations.

Q47. What is Batch Normalization and how does it regularize training?
-> Batch normalization normalizes layer activations across mini-batches to zero mean and unit variance, neutralizing internal covariate shift and allowing significantly higher learning rates.

Q48. How do Adam and AdamW optimizers work?
-> Adam combines momentum (first-moment tracking) and RMSProp (second-moment variance tracking). AdamW decouples weight decay penalty directly from gradient updates, preventing L2 penalty corruption during adaptive scaling.

Q49. What is Dropout Regularization?
-> During training, dropout randomly zeroes out a percentage of neuron activations in a layer per iteration, preventing co-adaptation of features and forcing the network to learn robust redundant representations.

Q50. What is Early Stopping?
-> Early stopping monitors validation loss during training and halts execution when validation performance fails to improve over a specified patience window, preventing overfitting.
Output: Tier 5 covers neural network backpropagation, activation functions, gradient stabilization, and modern optimizers.
Tier 6 (Q51–Q60): Computer Vision & CNN Architectures
Convolution operations, pooling, stride/padding, ResNet, object detection (YOLO, Mask R-CNN), and transfer learning.
ML Question Bank - Tier 6
Q51. How does a 2D Convolutional layer work on images?
-> A convolutional layer applies a sliding filter (kernel) across input image channels, computing element-wise dot products to extract spatial feature maps representing edges, textures, and shapes.

Q52. What is the purpose of Pooling layers (Max Pooling vs. Average Pooling)?
-> Pooling layers downsample feature maps, reducing spatial dimensions, parameter counts, and computational load while providing spatial translation invariance.

Q53. How do residual connections in ResNet solve the degradation problem?
-> ResNet introduces skip connections (shortcuts) that add input $x$ to layer output $F(x)$, creating a gradient superhighway ($F(x) + x$) that prevents vanishing gradients in ultra-deep networks.

Q54. What is the difference between Object Detection and Image Segmentation?
-> Object detection predicts bounding boxes and class labels for multiple objects. Image segmentation classifies every single pixel in the image (semantic vs. instance segmentation).

Q55. How does YOLO (You Only Look Once) achieve real-time object detection?
-> YOLO frames object detection as a single regression problem, dividing the image into a grid and predicting bounding boxes and class probabilities simultaneously in one forward pass.

Q56. What is Transfer Learning in Computer Vision?
-> Transfer learning takes a model pretrained on massive datasets (e.g., ImageNet using ResNet or EfficientNet) and fine-tunes its later layers on a smaller custom domain dataset, drastically reducing training time.

Q57. What is Data Augmentation and why is it crucial for CNNs?
-> Data augmentation applies label-preserving transformations (rotation, scaling, cropping, color jitter) to training images, artificially expanding dataset diversity and reducing overfitting.

Q58. What is Depthwise Separable Convolution?
-> Depthwise separable convolution splits standard convolution into a depthwise spatial filtering step followed by a pointwise 1x1 convolution, drastically reducing parameter counts (used in MobileNet).

Q59. What is Semantic Segmentation vs. Instance Segmentation?
-> Semantic segmentation assigns every pixel to a class label without distinguishing individual objects. Instance segmentation distinguishes separate objects within the same class (e.g., separating two overlapping cars).

Q60. What is a Vision Transformer (ViT) and how does it compare to CNNs?
-> ViT splits images into non-overlapping patches, projects them into linear embeddings, and processes them through standard Transformer self-attention blocks, capturing global context better than local CNN receptive fields.
Output: Tier 6 covers CNN mechanics, ResNet skip connections, object detection (YOLO), and Vision Transformers.
Tier 7 (Q61–Q70): Natural Language Processing & Sequence Models
Text preprocessing, TF-IDF, Word2Vec, RNNs, LSTMs, GRUs, Attention mechanisms, and Transformer architectures.
ML Question Bank - Tier 7
Q61. What is the limitation of Bag-of-Words and TF-IDF representations?
-> Bag-of-Words and TF-IDF ignore word order (syntax) and semantic relationships between words, resulting in high-dimensional sparse representations.

Q62. How does Word2Vec capture semantic meaning in vector space?
-> Word2Vec trains shallow neural networks (CBOW or Skip-gram) on massive text corpora to predict context words, mapping words into dense vector embeddings where semantic analogies hold true (e.g., king - man + woman = queen).

Q63. Why do Recurrent Neural Networks (RNNs) suffer from Vanishing Gradients?
-> RNNs unroll across long time steps, multiplying the same recurrent weight matrix repeatedly during backpropagation, causing gradients to vanish or explode exponentially.

Q64. How do LSTM cells solve the long-term dependency problem?
-> LSTMs introduce an internal cell state and three gating mechanisms (input, forget, and output gates) that regulate information flow, allowing gradients to flow uninterrupted over long sequences.

Q65. What is the core innovation of the Transformer architecture ("Attention Is All You Need")?
-> Transformers discard recurrence entirely, relying on parallel Self-Attention mechanisms and positional encodings to process token sequences simultaneously.

Q66. Explain Scaled Dot-Product Attention.
-> $\text{Attention}(Q,K,V) = \text{softmax}\left(\frac{QK^T}{\sqrt{d_k}}\right)V$, calculating query-key compatibility scores scaled by square root of key dimension to stabilize gradients.

Q67. What is Multi-Head Attention?
-> Multi-head attention projects queries, keys, and values into multiple subspaces, allowing the model to attend to different contextual aspects simultaneously across heads.

Q68. Why do Transformers require Positional Encoding?
-> Because self-attention is permutation-invariant (treating text as an unordered set), sinusoidal or learned positional encodings are added to token embeddings to preserve word order.

Q69. What is the difference between BERT (Encoder-only) and GPT (Decoder-only)?
-> BERT uses bidirectional self-attention for understanding tasks (classification, NER). GPT uses causal masked attention for autoregressive text generation.

Q70. What is FlashAttention and how does it optimize transformer training?
-> FlashAttention reorganizes memory access (SRAM tiling and gradient recomputation) to avoid costly high-level GPU memory read/writes, reducing memory complexity from quadratic to linear.
Output: Tier 7 covers NLP text vectorization, RNN/LSTM gates, and Transformer self-attention mechanisms.
Tier 8 (Q71–Q80): Reinforcement Learning & Decision Processes
Markov Decision Processes, Bellman equations, Q-learning, Deep Q-Networks (DQN), policy gradients, and PPO.
ML Question Bank - Tier 8
Q71. What is a Markov Decision Process (MDP)?
-> An MDP is a mathematical framework for modeling sequential decision-making where outcomes are partly random and partly under the control of a decision-making agent, satisfying the Markov property.

Q72. State the Bellman Optimality Equation.
-> $V(s) = \max_a \sum_{s'} P(s' | s, a) [R(s, a, s') + \gamma V(s')]$, expressing the value of a state as the maximum expected return over possible next states and actions.

Q73. What is the difference between Q-Learning and Policy Gradient methods?
-> Q-Learning is value-based, learning action-value functions $Q(s,a)$ to derive greedy policies. Policy gradients optimize the policy function directly without requiring intermediate value estimations.

Q74. What problem do Experience Replay Buffers solve in Deep Q-Networks (DQN)?
-> Consecutive transitions in RL environments are highly correlated. Experience replay stores transitions in a buffer and samples random mini-batches, breaking temporal correlations and stabilizing training.

Q75. Why do DQNs use a separate Target Network?
-> Using the same network for prediction and target calculation creates a moving target that destabilizes training. A separate target network holds weights fixed for C steps.

Q76. What is the Exploration vs. Exploitation dilemma in Reinforcement Learning?
-> Agents must balance exploring unknown states to discover high rewards (exploration) with exploiting currently known actions that yield high rewards (exploitation).

Q77. How does Epsilon-Greedy policy work?
-> With probability $\epsilon$, the agent selects a random action (exploration); with probability $1-\epsilon$, it selects the action with the highest estimated Q-value (exploitation).

Q78. What is Proximal Policy Optimization (PPO)?
-> PPO is a policy gradient algorithm that uses a clipped surrogate objective function to prevent destructively large policy updates during training.

Q79. What is Model-Based vs. Model-Free Reinforcement Learning?
-> Model-based RL learns an internal transition model of the environment to plan actions. Model-free RL learns policies or value functions directly through trial and error without modeling environmental dynamics.

Q80. What is Reward Shaping and what are its risks?
-> Reward shaping adds intermediate auxiliary rewards to guide agent learning. Risks include reward hacking, where the agent exploits loopholes to maximize reward without solving the intended task.
Output: Tier 8 covers RL foundations, MDPs, Q-learning, DQN mechanics, and PPO policy optimization.
Tier 9 (Q81–Q90): MLOps, Model Serialization & Production Deployment
Model serialization (Joblib, ONNX), FastAPI serving, Docker containerization, CI/CD pipelines, and MLflow tracking.
ML Question Bank - Tier 9
Q81. Why is model serialization necessary in MLOps?
-> Serialization converts trained in-memory estimator objects into portable binary files (e.g., Joblib, ONNX) so inference microservices can load pre-trained weights without retraining.

Q82. What are the advantages of FastAPI for serving Machine Learning models?
-> FastAPI provides asynchronous request handling, automatic Pydantic request/response payload validation, and interactive Swagger documentation out-of-the-box.

Q83. Why do we containerize ML models using Docker?
-> Docker packages application code, runtime dependencies, system libraries, and model artifacts into immutable containers, eliminating "it works on my machine" deployment bugs across cloud environments.

Q84. What is MLflow and what are its core components?
-> MLflow is an open-source MLOps platform consisting of Tracking (logging params/metrics), Projects (packaging code), Models (managing deployment formats), and Model Registry (version control and stage promotion).

Q85. What is ONNX (Open Neural Network Exchange)?
-> ONNX is an open format built to represent machine learning models, allowing models trained in PyTorch or TensorFlow to be exported and executed efficiently across diverse hardware runtimes.

Q86. How do you implement Inference Caching in production?
-> By integrating Redis or Memcached in front of the inference API to cache prediction results using request hash keys, returning sub-millimeter responses for repeated queries.

Q87. What is Blue-Green Deployment vs. Canary Releases?
-> Blue-green deployment maintains two identical production environments, switching router traffic instantly from old (blue) to new (green). Canary releases route a small percentage of live traffic (e.g., 5%) to a new model version before scaling up.

Q88. What is Shadow Deployment?
-> Shadow deployment routes incoming live production traffic to both the current model and a candidate model in parallel, logging candidate predictions silently without affecting user responses.

Q89. How do you monitor model performance in production?
-> By tracking HTTP latency SLAs, error rates, output prediction distributions, and input feature schemas using Prometheus, Grafana, and data validation tools like Great Expectations.

Q90. What is Quantization in Deep Learning?
-> Quantization reduces model memory footprint and inference latency by converting high-precision weights (FP32) into lower-precision formats (INT8 or FP16) with minimal loss in predictive accuracy.
Output: Tier 9 covers MLOps production deployment, FastAPI, Docker, MLflow, ONNX, and deployment strategies.
Tier 10 (Q91–Q100): Model Monitoring, Drift, Explainable AI & Ethics
Data drift, concept drift, Population Stability Index (PSI), SHAP, LIME, AI ethics, fairness, and bias mitigation.
ML Question Bank - Tier 10
Q91. What is the difference between Data Drift (Covariate Shift) and Concept Drift?
-> Data drift occurs when input feature distributions change over time ($P(X)$ changes while $P(Y|X)$ remains constant). Concept drift occurs when the statistical relationship between inputs and targets changes ($P(Y|X)$ changes).

Q92. How does the Population Stability Index (PSI) measure data drift?
-> PSI quantifies how much a feature distribution has shifted between training baseline data and production inference data across binned quantiles. PSI > 0.25 signals significant drift.

Q93. What is Explainable AI (XAI) and why is it critical in regulated industries?
-> XAI techniques make black-box model predictions interpretable, fulfilling legal mandates (e.g., GDPR Article 22, FCRA adverse action notices) and building user trust in healthcare and finance.

Q94. How do Shapley Additive exPlanations (SHAP) work?
-> SHAP computes feature attribution scores based on cooperative game theory, measuring each feature's marginal contribution across all possible feature subsets for guaranteed local accuracy.

Q95. How does LIME (Local Interpretable Model-agnostic Explanations) work?
-> LIME perturbs input features around a specific data point, observes prediction changes, and fits a local interpretable linear surrogate model to explain that single prediction.

Q96. What is Disparate Impact and the Four-Fifths Rule?
-> Disparate impact compares favorable outcome rates between protected and privileged groups. The Four-Fifths Rule states that a selection rate for any group less than 80% of the rate for the group with the highest rate is evidence of adverse impact.

Q97. What is Equal Opportunity in algorithmic fairness?
-> Equal opportunity requires that the True Positive Rate (recall) is identical across all demographic groups, ensuring qualified individuals have an equal chance of receiving favorable outcomes regardless of group membership.

Q98. What is Proxy Variable Bias?
-> Proxy variable bias occurs when models use seemingly neutral features (e.g., zip code, school attended) that correlate strongly with protected attributes (race, gender), inadvertently reintroducing historical discrimination.

Q99. What is Adversarial Debiasing?
-> Adversarial debiasing trains a primary task model alongside an adversary network attempting to predict protected attributes from hidden representations, forcing the primary model to scrub demographic signals.

Q100. What is LLM Alignment (RLHF and Constitutional AI)?
-> LLM alignment trains language models using Reinforcement Learning from Human Feedback (RLHF) or rule-based constitutional AI principles to ensure generated outputs are helpful, honest, and harmless (HHH).
Output: Tier 10 covers data drift, PSI, SHAP, LIME, AI fairness, disparate impact, and LLM alignment.