SupplementaryMaterial OnProvableBenefitsofDepthinTraining GraphConvolutionalNetworks

Neural Information Processing Systems 

Under the assumption thatγGCN 1, i.e., the graph is densely connected and the largest singular value ofweight matrices issmall, we havedM(H(`+1)) γGCN dM(H(`)).

Similar Docs  Excel Report  more

TitleSimilaritySource
None found