Name
Abstract | ||
|---|---|---|
We propose the Lanczos network (LanczosNet), which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution. Relying on the tridiagonal decomposition of the Lanczos algorithm, we not only efficiently exploit multi-scale information via fast approximated computation of matrix power but also design learnable spectral filters. Being fully differentiable, LanczosNet facilitates both graph kernel learning as well as learning node embeddings. We show the connection between our LanczosNet and graph based manifold learning methods, especially the diffusion maps. We benchmark our model against several recent deep graph networks on citation networks and QM8 quantum chemistry dataset. Experimental results show that our model achieves the state-of-the-art performance in most tasks. |
Year | Venue | Field |
|---|---|---|
2019 | ICLR | Graph,Computer science,Artificial intelligence,Machine learning |
DocType | Volume | Citations |
Journal | abs/1901.01484 | 3 |
PageRank | References | Authors |
0.37 | 31 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renjie Liao | 1 | 204 | 13.34 |
| Zhizhen Zhao | 2 | 42 | 6.36 |
| Raquel Urtasun | 3 | 6810 | 304.97 |
| Richard S. Zemel | 4 | 4958 | 425.68 |