Fetching the paper…
Reading the bibliography…
Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one.
Asymptotic evaluation of certain markov process expectations for large time
M. D. Donsker and S. R. S. Varadhan · 1983
Earlier work this paper cites.
The information bottleneck method
Naftali Tishby, Fernando C. Pereira, and William Bialek · 1999
Earlier work this paper cites.
gspan: graph-based substructure pattern mining
Xifeng Yan and Jiawei Yan · 2002
Earlier work this paper cites.
Protein function prediction via graph kernels
Karsten M. Borgwardt, Cheng Soon Ong, Stefan Schanauer, S. V. N. Vishwanathan, Alexander J. Smola, and Hans-Peter Kriegel · 2005
Earlier work this paper cites.
Subdue: compression-based frequent pattern discovery in graph data
Nikhil S Ketkar, Lawrence Bruce Holder, and Diane Cook · 2005
Earlier work this paper cites.
Efficiently mining frequent embedded unordered trees
Mohammed Javeed Zaki · 2005
Earlier work this paper cites.
Fast and accurate modeling of molecular atomization energies with machine learning
Matthias Rupp, Alexandre Tkatchenko, Klaus-Robert Muller, and O. Anatole von Lilienfeld · 2012
Earlier work this paper cites.
Dense subgraph discovery: Kdd 2015 tutorial
Aristides Gionis and Charalampos E. Tsourakakis · 2015
Earlier work this paper cites.
The network data repository with interactive graph analytics and visualization
Ryan A. Rossi and Nesreen K. Ahmed · 2015
Earlier work this paper cites.
Deep variational information bottleneck
Alexander A. Alemi, Ian Fischer, Joshua V. Dillon, and Kevin Murphy · 2017
Earlier work this paper cites.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl · 2017
Earlier work this paper cites.
Inductive representation learning on large graphs
William L. Hamilton, Zhitao Ying, and Jure Leskovec · 2017
Earlier work this paper cites.
Semi-supervised classification with graph convolutional networks
Thomas N. Kipf and Max Welling · 2017
Earlier work this paper cites.
Graph attention networks
Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lia, and Yoshua Bengio · 2017
Cited alongside, same era.
Mutual information neural estimation
Mohamed Ishmael Belghazi, Aristide Baratin, Sai Rajeswar, Sherjil Ozair, Yoshua Bengio, R. Devon Hjelm, and Aaron C. Courville · 2018
Cited alongside, same era.
Hierarchical graph representation learning with differentiable pooling
Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, and Jure Leskovec · 2018
Cited alongside, same era.
An end-to-end deep learning architecture for graph classification
Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen · 2018
Cited alongside, same era.
Edge contraction pooling for graph neural networks
Frederik Diehl · 2019
Cited alongside, same era.
Efficient algorithms for densest subgraph discovery
Significance-aware information bottleneck for domain adaptive semantic segmentation
Yawei Luo, Ping Liu, Tao Guan, Junqing Yu, and Yi Yang · 2019
Later among the works it cites.
Variational discriminator bottleneck: Improving imitation learning, inverse rl, and gans by constraining information flow
XueBin Peng, Angjoo Kanazawa, Sam Toyer, Pieter Abbeel, and Sergey Levine · 2019
Later among the works it cites.
How Powerful are Graph Neural Networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2019
Later among the works it cites.
Gnnexplainer: Generating explanations for graph neural networks
Rex Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec · 2019
Later among the works it cites.
Graph-revised convolutional network
Donghan Yu, Ruohong Zhang, Zhengbao Jiang, Yuexin Wu, and Yiming Yang · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, and Xuemin Lin · 2019
Cited alongside, same era.
Learning discrete structures for graph neural networks
Luca Franceschi, Mathias Niepert, Massimiliano Pontil, and Xiao He · 2019
Cited alongside, same era.
Graph u-nets
Hongyang Gao and Shuiwang Ji · 2019
Cited alongside, same era.
Infobot: Transfer and exploration via the information bottleneck
Anirudh Goyal, Riashat Islam, Daniel Strouse, Zafarali Ahmed, Matthew Botvinick, Hugo Larochelle, Yoshua Bengio, and Sergey Levine · 2019
Cited alongside, same era.
Generalization in reinforcement learning with selective noise injection and information bottleneck
Maximilian Igl, Kamil Ciosek, Yingzhen Li, Sebastian Tschiatschek, Cheng Zhang, Sam Devlin, and Katja Hofmann · 2019
Cited alongside, same era.
Understanding attention and generalization in graph neural networks
Boris Knyazev, Graham W. Taylor, and Mohamed R. Amer · 2019
Cited alongside, same era.
Self-attention graph pooling
Junhyun Lee, Inyeop Lee, and Jaewoo Kang · 2019
Cited alongside, same era.
Subgraph neural networks
Emily Alsentzer, Samuel G. Finlayson, Michelle M. Li, and Marinka Zitnik · 2020
Closest in time.
Spectral clustering with graph neural networks for graph pooling
Filippo Maria Bianchi, Daniele Grattarola, and Cesare Alippi · 2020
Closest in time.
Graph structure learning for robust graph neural networks
Wei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang, Suhang Wang, and Jiliang Tang · 2020
Closest in time.
Multi-objective molecule generation using interpretable substructures
Wengong Jin, Regina Barzilay, and Tommi Jaakkola · 2020
Closest in time.
Unsupervised speech decomposition via triple information bottleneck
Kaizhi Qian, Yang Zhang, Shiyu Chang, David Cox, and Mark Hasegawa-Johnson · 2020
Closest in time.
Asap: Adaptive structure aware pooling for learning hierarchical graph representations
Ekagra Ranjan, Soumya Sanyal, and Partha Pratim Talukdar · 2020
Closest in time.
Learning efficient multi-agent communication: An information bottleneck approach
Rundong Wang, Xu He, Runsheng Yu, Wei Qiu, Bo An, and Zinovi Rabinovich · 2020
Closest in time.