斯坦福大学机器学习所有问题及答案合集.pdfVIP

CS 229 机器学习 (问题及答案) 斯坦福大学 目录 (1) 作业1 （Supervised Learning） 1 (2) 作业1解答 （Supervised Learning） 5 (3) 作业2 （Kernels, SVMs, and Theory ） 15 (4) 作业2解答 （Kernels, SVMs, and Theory ） 19 (5) 作业3 （Learning Theory and Unsupervised Learning ） 27 (6) 作业3解答 （Learning Theory and Unsupervised Learning ） 31 (7) 作业4 （Unsupervised Learning and Reinforcement Learning ） 39 (8) 作业4解答 （Unsupervised Learning and Reinforcement Learning ） 44 (9) Problem Set #1: Supervised Learning 56 (10) Problem Set #1 Answer 62 (11) Problem Set #2: Problem Set #2: Naive Bayes, SVMs, and Theory 78 (12) Problem Set #2 Answer 85 CS229 Problem Set #1 1 CS 229, Public Course Problem Set #1: Supervised Learning 1. Newton’s method for computing least squares In this problem, we will prove that if we use Newton’s method solve the least squares optimization problem, then we only need one iteration to converge to θ∗ . 1 m T (i) (i) 2 (a) Find the Hessian of the cost function J (θ) = 2 i=1(θ x − y ) .