8000 Commit · tao-to-python/Learning-from-data@85cfad7 · GitHub
[go: up one dir, main page]

Skip to content

Commit 85cfad7

Browse files
committed
Commit
1 parent c3781f5 commit 85cfad7

File tree

2 files changed

+4
-3
lines changed

2 files changed

+4
-3
lines changed
-1.09 KB
Binary file not shown.

Chapter1/md/Chapter 1 The Learning Problem.md

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,6 @@ https://github.com/Doraemonzzz
1010
个人主页:
1111
http://doraemonzzz.com/
1212

13-
1413
参考资料:
1514
https://blog.csdn.net/a1015553840/article/details/51085129
1615
http://www.vynguyen.net/category/study/machine-learning/page/6/
@@ -1188,8 +1187,9 @@ $$
11881187
\begin{aligned}
11891188
P[t \ge \alpha]&=\int _{\alpha}^{+\infty}f(t)dt
11901189
\\&\le\int _{\alpha}^{+\infty}\frac t \alpha f(t)dt\ (注意t\ge \alpha)
1191-
\\&=\frac{\int _{\alpha}^{+\infty}t f(t)dt} \alpha
1192-
\\&=\frac {E(t)}\alpha
1190+
\\&=\frac{\int _{\alpha}^{+\infty}t f(t)dt} \alpha\\
1191+
& \le \frac{\int _{0}^{+\infty}t f(t)dt} \alpha
1192+
\\&= \frac {E(t)}\alpha
11931193
\end{aligned}
11941194
$$
11951195
(b)在(a)中取$t=u-\mu$,注意此处$u$是随机变量,且
@@ -1434,3 +1434,4 @@ $$
14341434
因此由之前结论知道$E_{in}(h)$在$h=y_{med}$取最小值
14351435

14361436
(c)当$y_N$被污染为 $y_N + \epsilon,(\epsilon \to \infty)$时,由定义可知$h_{mean}\to \infty$,而$y_{med}$为中位数,则不会有太大变化,因为元素的相对次序只有$y_N$变了
1437+

0 commit comments

Comments
 (0)
0