b0928f2d4ba7ea33b05024f21d937f48-Paper.pdf

Neural Information Processing Systems 

We demonstrate this by deriving an upper bound on theRademacher Complexitythatdepends ontwokeyquantities: (i)theintrinsic dimension, which is a measure of isotropy, and (ii) the largest eigenvalue of the second moment (covariance) matrix ofthe distribution.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found