⚖️ The Scale & Distance Paradox
Distance-based models like KNN, SVM with RBF kernels, and gradient-descent algorithms (Logistic Regression, Neural Networks) rely on Euclidean norms: d = √((x₁-y₁)² + (x₂-y₂)²).
When Feature 2 spans $10,000 to $250,000 while Feature 1 spans 18 to 75, the distance metric becomes almost 100% dependent on Feature 2. Normalization or Z-score standardization scales both dimensions to identical variance, restoring geometric equilibrium.
🎯 The Outlier & Squared-Loss Leverage
Convex optimization algorithms optimize Mean Squared Error (MSE) or Log-Loss. Because errors are squared, a single point at coordinates (x = 10, y = 10,000) generates an astronomical penalty.
The optimizer tilts the entire hyperplane away from the underlying ground truth just to appease that single extreme outlier. Applying IQR winsorization caps leverage points before weights are fit.
📉 Zero-Imputation & Distribution Rupture
Filling missing values with arbitrary zeros (e.g., zero for missing salary or missing age) shifts the expected value E[X] and creates multimodal spike artifacts that never exist in production.
Median imputation preserves monotonic rank order while resisting extreme outliers, maintaining consistent class distributions across training and production serving.