Prev Next

Python / Python Mathematical Intuition and Scikit Learn Interview Questions

What is the mathematical difference between L1 (Lasso) and L2 (Ridge) regularization, and why does L1 produce sparse solutions?

Both methods add a penalty term to the loss function to discourage large coefficients. Ridge (L2) adds λΣβᵢ²; Lasso (L1) adds λΣ|βᵢ|. The mathematical consequence of this difference is profound: L1 regularization can drive coefficients to exactly zero (producing sparse, interpretable models with automatic feature selection), while L2 shrinks coefficients toward zero but almost never makes them exactly zero.

The geometric explanation: think of the regularization term as a constraint region — L2's constraint Σβᵢ² ≤ t is a smooth circle/sphere, while L1's constraint Σ|βᵢ| ≤ t is a diamond/polytope with sharp corners on the axes. When you find the point where the elliptical loss contours first touch the constraint region, the circular L2 region rarely touches exactly on an axis (rarely zeroing a coefficient), but the diamond-shaped L1 region has corners precisely on the axes — the loss contours are statistically much more likely to first touch at one of these corners, zeroing out one or more coefficients.

from sklearn.linear_model import Ridge, Lasso
import numpy as np

# Ridge: shrinks coefficients but rarely to exactly zero
ridge = Ridge(alpha=1.0).fit(X_train, y_train)
print('Ridge coefficients:', ridge.coef_)
# e.g. [0.31, 0.02, 0.18, 0.04]  — small but non-zero

# Lasso: drives some coefficients to exactly zero
lasso = Lasso(alpha=0.1).fit(X_train, y_train)
print('Lasso coefficients:', lasso.coef_)
# e.g. [0.45, 0.0, 0.22, 0.0]   — automatic feature selection!

selected_features = np.where(lasso.coef_ != 0)[0]
print(f'Lasso selected {len(selected_features)} of {len(lasso.coef_)} features')

# ElasticNet: combines both penalties
from sklearn.linear_model import ElasticNet
en = ElasticNet(alpha=0.1, l1_ratio=0.5).fit(X_train, y_train)
Why does L1 regularization tend to produce exactly zero coefficients while L2 does not?
What is the practical benefit of Lasso's tendency to zero out coefficients?

Invest now in Acorns!!! 🚀 Join Acorns and get your $5 bonus!

Invest now in Acorns!!! 🚀
Join Acorns and get your $5 bonus!

Earn passively and while sleeping

Acorns is a micro-investing app that automatically invests your "spare change" from daily purchases into diversified, expert-built portfolios of ETFs. It is designed for beginners, allowing you to start investing with as little as $5. The service automates saving and investing. Disclosure: I may receive a referral bonus.

Invest now!!! Get Free equity stock (US, UK only)!

Use Robinhood app to invest in stocks. It is safe and secure. Use the Referral link to claim your free stock when you sign up!.

The Robinhood app makes it easy to trade stocks, crypto and more.


Webull! Receive free stock by signing up using the link: Webull signup.

More Related questions...

Why does linear regression minimise the sum of squared errors instead of, say, absolute errors? Explain the mathematical intuition behind gradient descent and why the learning rate matters. Why do you need to scale features before using gradient descent-based models or distance-based algorithms like KNN? Explain the bias-variance tradeoff mathematically and how it relates to model complexity. What is the mathematical difference between L1 (Lasso) and L2 (Ridge) regularization, and why does L1 produce sparse solutions? How does maximum likelihood estimation connect to the logistic regression cost function? How do decision trees decide which feature and threshold to split on? Explain Gini impurity and entropy. Why does a random forest reduce variance compared to a single decision tree, and what role does feature randomness play? What is the mathematical intuition behind gradient boosting? How does it differ from random forests? Explain the mathematical foundation of PCA. What do eigenvectors and eigenvalues represent in this context? What is the mathematical concept of the margin in Support Vector Machines, and why does maximizing it improve generalization? What is the kernel trick in SVMs and why does it avoid explicitly computing high-dimensional feature mappings? Why does K-Nearest Neighbors suffer from the curse of dimensionality, mathematically? What is the mathematical objective function K-Means optimises, and why can it converge to a local minimum? What is the statistical rationale behind k-fold cross-validation, and why are k=5 or k=10 commonly used? What does the ROC-AUC score mathematically represent, and why is it threshold-independent? Explain the mathematical tradeoff between precision and recall, and why F1 score is the harmonic mean rather than the arithmetic mean. What is the 'naive' independence assumption in Naive Bayes, and why does it still work well in practice despite being unrealistic? Why is a log transformation commonly applied to skewed numerical features before modeling, mathematically? What is multicollinearity, mathematically, and how does the Variance Inflation Factor (VIF) detect it? Why must features be standardized before applying Ridge or Lasso regularization, mathematically? What is the mathematical relationship between learning_rate and n_estimators in gradient boosting? How does the softmax function generalize logistic regression to multiclass classification, mathematically? Why does fitting a scaler or transformer on the entire dataset (before train/test split) cause data leakage, mathematically? How does the class_weight parameter mathematically address class imbalance in scikit-learn classifiers? Why does using simple label encoding (integers) for nominal categorical features mislead most machine learning models, mathematically? What is the difference between a single train/validation/test split and k-fold cross-validation for hyperparameter tuning, statistically? Why is PCA sensitive to feature scaling while decision tree feature importance is not, mathematically? Why is the decision boundary of standard logistic regression always a straight line (or hyperplane), mathematically? Why can R-squared be a misleading metric for model comparison, and how does adjusted R-squared address this? Derive mathematically why bagging (bootstrap aggregating) reduces variance, and under what condition it does NOT help. Why does convexity of the loss function matter for optimization algorithms like gradient descent, mathematically? Mathematically, why does RobustScaler handle outliers better than StandardScaler? What does it mean for a classifier's predicted probabilities to be 'well-calibrated', and why don't all models produce calibrated probabilities naturally? Mathematically, why does stochastic gradient descent (SGD) scale to large datasets better than batch gradient descent? Beyond scaling, why must feature selection methods also be included inside a cross-validation pipeline rather than applied beforehand?
Show more question and Answers...

Python Deep Learning and Neural Networks Interview Questions

Comments & Discussions