NeurIPS 2016 accepted papers on Graph learning
15 of the 570 papers accepted at NeurIPS 2016 (2.6%) are on Graph learning. They fall into 4 topics.
See NeurIPS 2016 in the interactive map
Submitting to NeurIPS? Checklist →
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Graph algorithms and clustering · 11 papers
- Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity (187 citations)
- On Valid Optimal Assignment Kernels and Applications to Graph Classification (120 citations)
- The Multiscale Laplacian Graph Kernel (111 citations)
- Edge-exchangeable graphs and sparsity (33 citations)
- Structured Prediction Theory Based on Factor Graph Complexity (30 citations)
- Community Detection on Evolving Graphs (18 citations)
- Graph Clustering: Block-models and model free results (5 citations)
- On Graph Reconstruction via Empirical Risk Minimization: Fast Learning Rates and Scalability (5 citations)
- Data driven estimation of Laplace-Beltrami operator (1 citation)
- Graphons, mergeons, and so on!
- The Product Cut
GNN architectures · 2 papers
- Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering (1,699 citations)
- Semiparametric Differential Graph Models (12 citations)
Graph self-supervised learning · 1 paper
- Diffusion-Convolutional Neural Networks (566 citations)
