**NPTEL Introduction to Machine Learning Assignment 2 Answers 2022:-** In this post, We have provided answers of NPTEL Introduction to Machine Learning Assignment 2. We provided answers here only for reference. Plz, do your assignment at your own knowledge.

## NPTEL Introduction to Machine Learning Assignment 2 Answers 2022 [July-Dec]

**Q1. The parameters obtained in linear regression**

a. can take any value in the real space

b. are strictly integers

c. always lie in the range [0,1]

d. can take only non-zero values

Answer:-a

**2. Suppose that we have NN independent variables (X1,X2,…XnX1,X2,…Xn) and the dependent variable is YY . Now imagine that you are applying linear regression by fitting the best fit line using the least square error on this data. You found that the correlation coefficient for one of its variables (Say X1X1) with YY is -0.005.**

a. Regressing Y on X1 mostly does not explain away Y.

b. Regressing Y on X1 explains away Y.

c. The given data is insufficient to determine if regressing Y on X1 explains away Y or not.

Answer:-a

**Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW**

**3. Consider the following five training examples**

`We want to learn a function f(x) of the form f(x)=ax+b which is parameterised by (a,b).Using mean squared error as the loss function, which of the following parameters would you use to model this function to get a solution with the minimum loss?`

- (4, 3)
- (1, 4)
- (4, 1)
- (3, 4)

Answer:-b

**4. The relation between studying time (in hours) and grade on the final examination (0-100) in a random sample of students in the Introduction to Machine Learning Class was found to be:**

Grade = 30.5 + 15.2 (h)

How will a studentโs grade be affected if she studies for four hours?

a. It will go down by 30.4 points.

b. It will go down by 30.4 points.

c. It will go up by 60.8 points.

d. The grade will remain unchanged.

e. It cannot be determined from the information given

Answer:-c

**5. Which of the statements is/are True?**

a. Ridge has sparsity constraint, and it will drive coefficients with low values to 0.

b. Lasso has a closed form solution for the optimization problem, but this is not the case for Ridge.

c. Ridge regression does not reduce the number of variables since it never leads a coefficient to zero but only minimizes it.

d. If there are two or more highly collinear variables, Lasso will select one of them randomly.

Answer:-c, d

**6. Consider the following statements:**

Assertion(A): Orthogonalization is applied to the dimensions in linear regression.

Reason(R): Orthogonalization makes univariate regression possible in each orthogonal dimension separately to produce the coefficients.

a. Both A and R are true, and R is the correct explanation of A.

b. Both A and R are true, but R is not the correct explanation of A.

c. A is true, but R is false.

d. A is false, but R is true.

e. Both A and R are false.

Answer:-a

๐**For Week 03 Assignment Answers**๐

**7. Consider the following statements:****Statement A: In Forward stepwise selection, in each step, that variable is chosen which has the maximum correlation with the residual, then the residual is regressed on that variable, and it is added to the predictor.Statement B: In Forward stagewise selection, the variables are added one by one to the previously selected variables to produce the best fit till then**

a. Both the statements are True.

b. Statement A is True, and Statement B is False

c. Statement A if False and Statement B is True

d. Both the statements are False.

Answer:-d

**8. The linear regression model y=a _{0}+a_{1}x_{1}+a_{2}x_{2}+…+a_{p}x_{p} is to be fitted to a set of N training data points having p attributes each. Let X be Nร(p+1) vectors of input values (augmented by 1โs), Y be Nร1 vector of target values, and ฮธ be (p+1)ร1 vector of parameter values (a0,a1,a2,…,ap). If the sum squared error is minimized for obtaining the optimal regression model, which of the following equation holds**?

Answer:-d

**For More NPTEL Answers:- CLICK HERE****Join Our Telegram:- CLICK HERE**

Introduction to Machine Learning | Answers |

Assignment 1 | Click Here |

Assignment 2 | Click Here |

Assignment 3 | Click Here |

Assignment 4 | Click Here |

Assignment 5 | Click Here |

Assignment 6 | Click Here |

Assignment 7 | Click Here |

Assignment 8 | Click Here |

Assignment 9 | Click Here |

Assignment 10 | Click Here |

Assignment 11 | NA |

Assignment 12 | NA |

## About Introduction to Machine Learning

With the increased availability of data from varied sources there has been increasing attention paid to the various data driven disciplines such as analytics and machine learning. In this course we intend to introduce some of the basic concepts of machine learning from a mathematically well motivated perspective. We will cover the different learning paradigms and some of the more popular algorithms and architectures used in each of these paradigms.

### COURSE LAYOUT

**Week 0:**Probability Theory, Linear Algebra, Convex Optimization โ (Recap)**Week 1:**Introduction: Statistical Decision Theory โ Regression, Classification, Bias Variance**Week 2:**Linear Regression, Multivariate Regression, Subset Selection, Shrinkage Methods, Principal Component Regression, Partial Least squares**Week 3:**Linear Classification, Logistic Regression, Linear Discriminant Analysis**Week 4:**Perceptron, Support Vector Machines**Week 5:**Neural Networks โ Introduction, Early Models, Perceptron Learning, Backpropagation, Initialization, Training & Validation, Parameter Estimation โ MLE, MAP, Bayesian Estimation**Week 6:**Decision Trees, Regression Trees, Stopping Criterion & Pruning loss functions, Categorical Attributes, Multiway Splits, Missing Values, Decision Trees โ Instability Evaluation Measures**Week 7:**Bootstrapping & Cross Validation, Class Evaluation Measures, ROC curve, MDL, Ensemble Methods โ Bagging, Committee Machines and Stacking, Boosting**Week 8:**Gradient Boosting, Random Forests, Multi-class Classification, Naive Bayes, Bayesian Networks**Week 9:**Undirected Graphical Models, HMM, Variable Elimination, Belief Propagation**Week 10:**Partitional Clustering, Hierarchical Clustering, Birch Algorithm, CURE Algorithm, Density-based Clustering**Week 11:**Gaussian Mixture Models, Expectation Maximization**Week 12:**Learning Theory, Introduction to Reinforcement Learning, Optional videos (RL framework, TD learning, Solution Methods, Applications)

**CRITERIA TO GET A CERTIFICATE**

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.

Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

**YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.**

please provide assignment answers