Stability and Generalization of $\ell_p$-Regularized Stochastic Learning for GCN

Shiyu Liu, Linsen Wei, Shaogao Lv, Ming Li

Graph convolutional networks (GCN) are viewed as one of the most popular representations among the variants of graph neural networks over graph data and have shown powerful performance in empirical experiments. That $\ell_2$-based graph smoothing enforces the global smoothness of GCN, while (soft) $\ell_1$-based sparse graph learning tends to promote signal sparsity to trade for discontinuity. This paper aims to quantify the trade-off of GCN between smoothness and sparsity, with the help of a general $\ell_p$-regularized $(1

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment