Prev Next

Python / Python Mathematical Intuition and Scikit Learn Interview Questions

Mathematically, why does stochastic gradient descent (SGD) scale to large datasets better than batch gradient descent?

Batch gradient descent computes the exact gradient of the loss using all n training examples before taking a single parameter update step: ∇L(θ) = (1/n)Σᵢ ∇Lᵢ(θ). This requires O(n) computation per update — for datasets with millions of examples, even one update step becomes expensive, and you typically need many updates to converge.

SGD instead estimates the gradient using a single randomly sampled example (or a small mini-batch): ∇L_i(θ) for a random i. This is an unbiased estimator of the true gradient — its expected value equals the true gradient — but with added noise/variance. The key insight is that SGD can take many more update steps in the same amount of computation (since each step is O(1) or O(batch_size) instead of O(n)), and despite the noisier individual steps, the overall trajectory converges because the noise averages out over many iterations. For very large datasets, this tradeoff strongly favours SGD: you converge faster in wall-clock time even though each individual step is less precise.

from sklearn.linear_model import SGDRegressor, LinearRegression
import numpy as np
import time

# Simulating a large dataset
n_samples = 1_000_000
X = np.random.randn(n_samples, 10)
y = X @ np.random.randn(10) + np.random.randn(n_samples) * 0.1

# SGDRegressor processes data in small batches, scales to large n
start = time.time()
sgd = SGDRegressor(max_iter=5, tol=1e-3)
sgd.fit(X, y)
print(f'SGD time: {time.time() - start:.3f}s')

# Closed-form OLS (LinearRegression) computes (X^T X)^-1 X^T y
# Cost scales with O(n*d^2 + d^3) — fine here but problematic
# for very high-dimensional or extremely large n cases
start = time.time()
lr = LinearRegression().fit(X, y)
print(f'Closed-form time: {time.time() - start:.3f}s')

# partial_fit allows incremental learning on streaming/chunked data —
# impossible with the closed-form or full-batch approach
sgd2 = SGDRegressor()
for chunk_start in range(0, n_samples, 10000):
    chunk = slice(chunk_start, chunk_start + 10000)
    sgd2.partial_fit(X[chunk], y[chunk])
Why is a single-example gradient estimate in SGD still useful despite being noisier than the full batch gradient?
What capability does SGD's partial_fit provide that closed-form OLS cannot offer?

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