From 29e31912a1bc6c9ac37825d41e01fbe8bbfe50b5 Mon Sep 17 00:00:00 2001 From: YDZ Date: Sat, 10 Mar 2018 21:39:22 +0800 Subject: [PATCH] =?UTF-8?q?=E6=B5=8B=E8=AF=95=E6=A0=BC=E5=BC=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- contents/Machine_Learning/Gradient_descent.ipynb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/contents/Machine_Learning/Gradient_descent.ipynb b/contents/Machine_Learning/Gradient_descent.ipynb index 86f2f36c..72991ed2 100644 --- a/contents/Machine_Learning/Gradient_descent.ipynb +++ b/contents/Machine_Learning/Gradient_descent.ipynb @@ -38,7 +38,7 @@ "\n", "如何选择 $\\theta_{0}$、$\\theta_{1}$，使得 $h_{\\theta}(x)$ 更接近于训练集 (x,y) ？\n", "\n", - "上述问题可以转换为求 $$ \\rm{CostFunction} = \\rm{F}({\\theta_{0}},{\\theta_{1}}) = \\frac{1}{2m} \\sum_{i = 1}^{m} (h_{\\theta})^2 \\tag {平方误差代价函数}$$ 求最小值$$\\min_{{\\theta_{0}} {\\theta_{1}}} \\rm{F}({\\theta_{0},{\\theta_{1}})} $$\n", + "上述问题可以转换为求 $$ \\rm{CostFunction} = \\rm{F}({\\theta_{0}},{\\theta_{1}}) = \\frac{1}{2m} \\sum_{i = 1}^{m} {(h_{\\theta})}^2 \\tag {平方误差代价函数}$$ 求最小值$$\\min_{{\\theta_{0}} {\\theta_{1}}} \\rm{F}({\\theta_{0},{\\theta_{1}})} $$\n", "\n", "\n", "\n",