Machine Learning GATE DA: Syllabus, Books & PYQs

Machine learning on GATE DA is not a Kaggle competition. It is a pen-and-paper exam where you are expected to reason about model assumptions, compute decision boundaries by hand, trace k-means iterations on five data points, and decompose error into bias² + variance + noise. The syllabus is bounded — every model you need is named — and the biggest mistake aspirants make is over-studying deep learning and ensemble methods that are not on the list.

Below: the official syllabus, a model-comparison decision matrix (print it), the recommended book (Hands-On ML by Géron, supplemented with theory), and a study plan that starts with the prerequisite maths you need before touching any ML topic.

Official Syllabus

Supervised Learning

• Regression — simple linear, multiple linear, ridge
• Logistic regression
• K-nearest neighbour, naive Bayes classifier
• Linear discriminant analysis (LDA)
• Support vector machine (SVM)
• Decision trees
• Bias-variance trade-off
• Cross-validation — leave-one-out (LOO), k-folds
• Multi-layer perceptron (neural networks), feed-forward

Unsupervised Learning

• Clustering — k-means, k-medoid, hierarchical (top-down, bottom-up); single and multiple linkage
• Dimensionality reduction — PCA

Every model you need is on this list. Random forests, gradient boosting, transformers, reinforcement learning, and generative models are not. The explicit mention of bias-variance trade-off and cross-validation means these are direct question targets, not background reading.

The Model Decision Matrix

Print this. Most GATE DA ML questions test whether you can pick the right model for a described problem and reason about its assumptions.

Book and Resources

Full book list: GATE DA books and resources guide.

Topic Walkthrough

Regression — Linear, Multiple, Ridge

OLS estimator (closed-form), residuals, R², assumptions. Ridge adds L2 penalty; understand how λ shrinks coefficients and trades bias for variance. Be able to compute the closed-form ridge solution.

Logistic Regression

Sigmoid activation, binary cross-entropy loss, linear decision boundary. Maximum likelihood interpretation. The decision boundary shape is the same hyperplane as a linear SVM — different optimisation objective, different boundary position.

KNN and Naive Bayes

KNN is non-parametric; effect of k and distance metric matter; curse of dimensionality is a common MSQ target. Naive Bayes assumes conditional independence given the class; this is applied Bayes' theorem.

LDA — and Why PCA Is Not the Same Thing

LDA: maximises between-class / within-class scatter. PCA: maximises variance. LDA is supervised; PCA is unsupervised. Both reduce dimensions; different objectives. This distinction is one of the most consistently tested topics on the paper.

SVM

Maximum-margin classifier. Hard-margin vs soft-margin (C controls the trade-off). Support vectors are points on the margin; the boundary depends only on them. Kernel trick (polynomial, RBF) for non-linear boundaries — conceptual exposure, not derivation depth.

Decision Trees

Splits via information gain (entropy reduction) or Gini impurity. Pruning controls overfitting. Be able to compute the next split given a small dataset.

Bias-Variance Trade-off

Error = bias² + variance + irreducible. Underfitting = high bias; overfitting = high variance. Regularisation (ridge), early stopping, and reduced complexity trade variance for bias. PYQs ask you to identify which is responsible for a train/test gap.

Cross-Validation

LOO: uses n − 1 for training, 1 for validation, repeated n times — high variance, expensive. K-fold: splits into k partitions — lower variance. Stratified k-fold preserves class proportions.

Clustering

K-means: minimise within-cluster sum of squares; iterate assignment/centroid update; sensitive to initialisation and k. Hierarchical: agglomerative (bottom-up) or divisive (top-down); linkage choices (single, complete, average).

PCA

Eigen-decomposition of the covariance matrix; principal components = eigenvectors of largest eigenvalues. PCA = SVD applied to centred data — this is where linear algebra meets ML.

Neural Networks

Perceptron, MLP, activation functions (sigmoid, tanh, ReLU), forward pass, backpropagation. Be able to trace a small forward/backprop by hand. Vanishing gradient with sigmoid — conceptual exposure. DL is a small slice of the paper; do not over-invest.

What to Skip

• Random forests, gradient boosting, XGBoost — ensemble methods beyond basic intuition
• Reinforcement learning — Q-learning, policy gradients
• Transformers and attention mechanisms
• Generative models — GANs, VAEs, diffusion
• Production ML / MLOps
• Specific DL frameworks beyond conceptual MLP
• Statistical learning theory proofs (VC dimension, PAC bounds) beyond conceptual awareness

The biggest risk: over-studying deep learning. DL is a few marks; in-syllabus models are the rest.

Past-Paper Patterns

ML PYQs since 2024 cluster around six types:

1. Identify the right model for a described problem
2. Compute the next iteration of k-means or a decision-tree split
3. Bias-variance attribution given train/test errors
4. PCA computation on a small covariance matrix
5. Bayes-style probabilistic classification
6. SVM support-vector identification

Solve every ML question from official GATE DA 2024 and 2025 papers. The decision matrix above tells you what to look for; PYQs train the pattern recognition.

Study Plan

Prerequisites (do first)

Probability and statistics (naive Bayes, bias-variance, evaluation) and linear algebra (PCA, ridge, SVM, neural networks). Do both before ML.

Weeks 1–4: Supervised Learning

1. Linear, multiple, ridge regression — Géron + theory notes.
2. Logistic regression — sigmoid, log-loss, boundary.
3. KNN, naive Bayes.
4. LDA — and the PCA comparison.
5. SVM — hard/soft margin, support vectors, kernel intuition.
6. Decision trees — Gini, entropy, information gain.
7. Bias-variance + cross-validation.

Weeks 5–6: Unsupervised + Neural Networks

1. K-means, hierarchical clustering — trace on small datasets.
2. PCA — covariance eigen-decomposition, SVD connection.
3. Neural networks — MLP, activations, forward/backprop trace.

Weeks 7–8: PYQs and Revision

1. Every ML PYQ from GATE DA 2024 and 2025.
2. 2–3 topic-wise tests from The ML Hub GATE DA test series.
3. Finalise the decision matrix and PCA-vs-LDA reference.

Mistakes That Cost Marks

• Over-studying deep learning. DL is a small slice. RL, generative models, and transformers are not in the syllabus.
• Confusing PCA and LDA. PCA = unsupervised, maximises variance. LDA = supervised, maximises class separation.
• Treating Hands-On ML as complete. Géron is practice-leaning; supplement theory for SVM, bias-variance algebra, LDA vs PCA.
• Skipping bias-variance. Explicitly in the syllabus, common PYQ target.
• Forgetting PCA = SVD on centred data. Reinforces the LA connection.
• Studying ensembles "just in case". Not in the syllabus. Allocate that time to in-syllabus models.

ML in The ML Hub's Course

The ML block in The ML Hub's GATE DA course layers mentor-led theory on top of Géron's practical material. Every in-syllabus model is covered, plus the bias-variance decomposition and cross-validation methods the syllabus names explicitly. Topic-wise tests include dedicated ML packs aligned to PYQ patterns. See ranker journeys for how AIR 9 and AIR 6 candidates used this material.

FAQs

Which book for GATE DA machine learning?

Aurélien Géron's Hands-On Machine Learning. It covers nearly every algorithm in the syllabus. Pair with mentor notes for theory (SVM, bias-variance, LDA vs PCA).

Is deep learning in GATE DA?

Yes — MLP, feed-forward, activation functions, and backpropagation are in the syllabus. But DL is a small slice. Generative models, transformers, and RL are not.

Is SVM in the GATE DA syllabus?

Yes. Cover the maximum-margin formulation, hard/soft margin (C), support vectors, and kernel trick at conceptual level.

What is bias-variance trade-off in GATE DA?

Explicitly in the syllabus. Error = bias² + variance + irreducible. Underfitting = high bias; overfitting = high variance.

Related Guides

ML's natural neighbours: Artificial Intelligence (overlaps on probabilistic reasoning), Probability & Statistics and Linear Algebra (both prerequisites). Full subject map: GATE DA books and resources · GATE DA syllabus 2027 guide.