文章标题

【机器基石】-6课： Theory of Generalization
台大林轩田
6-1 Restriction of Break Point
Growth Function m_H(N): Max number of dichotomies
- positve rays: m_h(2)=3<2²: break point at 2
m_h(N) = N+1
- positive Intervals: m_h(3) = 7 < 2³
m_h(N) =1/2N² +1/2*N+1
- convex sets: m_H=2^N
- 2D perceptrons:
最后提出一个问题：这个问题如果是从k过度到k+1,成长函数应该会怎么样
break point K ====> break point K+1,…..
what else?
* 后面这段讲shelter的部分有点不太明白*

6-2 Bounding Function
上限函数
Bounding Function B(N, k)
Break point =k

6-3 Bounding Function-Inductive Cases