We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
在证明对于 d-D Perceptrons 有 dVC = d+1 时提到:
对于矩阵 X (d+2 x d+1),因为其 行数多于列数,所以行存在 线性相关 关系;
为什么?
对于学过线性代数的同学来说,这是个简单的问题。
此外,还希望有人能帮我 改进 这段证明的解释。
The text was updated successfully, but these errors were encountered:
学习了线性代数就明白了:
在 n 维空间中,如果有 m > n 个向量,那么这 m 个向量一定存在线性相关关系, 因为在 n 维空间中最多就只有 n 个相互独立的向量(每个维度都是单位向量的 n 个向量)
具体可以参见线性代数中的矩阵的 Reduce Row Echelon Form (RREF)。
Sorry, something went wrong.
[FIX] Fix linear dependence in VC (#2)
b6fefd3
No branches or pull requests
Lecture 7: VC Dimension
在证明对于 d-D Perceptrons 有 dVC = d+1 时提到:
为什么?
对于学过线性代数的同学来说,这是个简单的问题。
此外,还希望有人能帮我 改进 这段证明的解释。
The text was updated successfully, but these errors were encountered: