This is the most beautiful explanation of Nystrom methods I've ever seen. This guy is just THAT GOOOOD !!
@RajivSambasivan5 жыл бұрын
He has a real gift for teaching and expressing really complex ideas in a very accessible manner. All of his lectures are simply fantastic.
@wenweilin47947 жыл бұрын
This series of lectures is amazing. Please keep uploading. Thanks you professor.
@liyangxie19207 жыл бұрын
I am not sure if I misunderstand something or not: in 33:13, in order for (\Sigma)^{1/2} to have inverse, rank(\Sigma)=m, (means each diagonal of \Sigma is nonzero), and of course we have rank(\Sigma)=rank(A) \leq rank(K), so we have m \leq rank(K), but not m \geq rank(K). am I right?