Fetching the paper…
Reading the bibliography…
The rapid growth of graph data poses significant challenges in storage, transmission, and particularly the training of graph neural networks (GNNs).
D. A. Spielman and N. Srivastava, “Graph sparsification by effective resistances,” in Proceedings of the fortieth annual ACM symposium on Theory of computing , 2008, pp. 563–568
2008
Earlier work this paper cites.
J. Bang-Jensen and G. Z. Gutin, Digraphs: theory, algorithms and applications . Springer Science & Business Media, 2008
2008
Earlier work this paper cites.
J. Bergstra, R. Bardenet, Y. Bengio, and B. Kégl, “Algorithms for hyper-parameter optimization,” Advances in neural information processing systems , vol. 24, 2011
2011
Earlier work this paper cites.
K. Jung, W. Heo, and W. Chen, “Irie: Scalable and robust influence maximization in social networks,” in 2012 IEEE 12th International Conference on Data Mining . IEEE, 2012, pp. 918–923
2012
Earlier work this paper cites.
C.-Y. Lu, H. Min, Z.-Q. Zhao, L. Zhu, D.-S. Huang, and S. Yan, “Robust and efficient subspace segmentation via least squares regression,” in Computer Vision–ECCV 2012: 12th European Conference on Computer Vision, Florence, Italy, October 7-13, 2012, Proceedings, Part VII 12 . Springer, 2012, pp. 347–360
2012
Earlier work this paper cites.
A. Gretton, K. M. Borgwardt, M. J. Rasch, B. Schölkopf, and A. Smola, “A kernel two-sample test,” JMLR , 2012
2012
Earlier work this paper cites.
S. M. Randall, J. H. Boyd, A. M. Ferrante, J. K. Bauer, and J. B. Semmens, “Use of graph theory measures to identify errors in record linkage,” Computer methods and programs in biomedicine , vol. 115, no. 2, pp. 55–63, 2014
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: a survey,” Data mining and knowledge discovery , vol. 29, pp. 626–688, 2015
2015
Earlier work this paper cites.
C. J. Maddison, A. Mnih, and Y. W. Teh, “The concrete distribution: A continuous relaxation of discrete random variables,” in ICLR , 2016
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain , 2016
2016
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in ICML , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings , 2017
2017
Earlier work this paper cites.
Y. Li, J. Fan, Y. Wang, and K.-L. Tan, “Influence maximization on social graphs: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 10, pp. 1852–1872, 2018
2018
Earlier work this paper cites.
J. Chen, T. Ma, and C. Xiao, “Fastgcn: Fast learning with graph convolutional networks via importance sampling,” in 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings . OpenReview.net, 2018
2018
Earlier work this paper cites.
A. Loukas and P. Vandergheynst, “Spectrally approximating large graphs with smaller graphs,” in Proceedings of the 35th International Conference on Machine Learning, ICML 2018 , 2018
2018
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada , 2018
2018
Earlier work this paper cites.
F. Wu, A. H. S. Jr., T. Zhang, C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” in ICML , 2019
2019
Earlier work this paper cites.
G. Bravo Hermsdorff and L. Gunderson, “A unifying framework for spectrum-preserving graph sparsification and coarsening,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Earlier work this paper cites.
S. S. Du, K. Hou, R. R. Salakhutdinov, B. Poczos, R. Wang, and K. Xu, “Graph neural tangent kernel: Fusing graph neural networks with graph kernels,” in NeurIPS , 2019
2019
Earlier work this paper cites.
Z. Kang, H. Pan, S. C. Hoi, and Z. Xu, “Robust graph learning from noisy data,” IEEE transactions on cybernetics , vol. 50, no. 5, pp. 1833–1843, 2019
2019
Earlier work this paper cites.
J. Gasteiger, A. Bojchevski, and S. Günnemann, “Predict then propagate: Graph neural networks meet personalized pagerank,” in International Conference on Learning Representations (ICLR) , 2019
2019
Earlier work this paper cites.
T. Akiba, S. Sano, T. Yanase, T. Ohta, and M. Koyama, “Optuna: A next-generation hyperparameter optimization framework,” in The 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 2623–2631
2019
Earlier work this paper cites.
H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. K. Prasanna, “Graphsaint: Graph sampling based inductive learning method,” in 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26-30, 2020 . OpenReview.net, 2020
2020
Earlier work this paper cites.
M. Wu, S. Pan, and X. Zhu, “Openwgl: Open-world graph learning,” in 2020 IEEE international conference on data mining (icdm) . IEEE, 2020, pp. 681–690
2020
Earlier work this paper cites.
B. Zhao, K. R. Mopuri, and H. Bilen, “Dataset condensation with gradient matching,” in ICLR , 2020
2020
Earlier work this paper cites.
T. Nguyen, Z. Chen, and J. Lee, “Dataset meta-learning from kernel ridge-regression,” in ICLR , 2020
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
W. Jin, Y. Ma, X. Liu, X. Tang, S. Wang, and J. Tang, “Graph structure learning for robust graph neural networks,” in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining , 2020, pp. 66–74
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
S. M. Kazemi, R. Goel, K. Jain, I. Kobyzev, A. Sethi, P. Forsyth, and P. Poupart, “Representation learning for dynamic graphs: A survey,” The Journal of Machine Learning Research , vol. 21, no. 1, pp. 2648–2720, 2020
2020
Earlier work this paper cites.
F. Wang, P. Cui, J. Pei, Y. Song, and C. Zang, “Recent advances on graph analytics and its applications in healthcare,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 3545–3546
2020
Earlier work this paper cites.
B. M. Oloulade, J. Gao, J. Chen, T. Lyu, and R. Al-Sabri, “Graph neural architecture search: A survey,” Tsinghua Science and Technology , vol. 27, no. 4, pp. 692–708, 2021
2021
Earlier work this paper cites.
2021
Earlier work this paper cites.
2021
Earlier work this paper cites.
M. Zhu, X. Wang, C. Shi, H. Ji, and P. Cui, “Interpreting and unifying graph neural networks with an optimization framework,” in Proceedings of the Web Conference 2021 , 2021, pp. 1215–1226
2021
Earlier work this paper cites.
N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan, “A survey on bias and fairness in machine learning,” ACM computing surveys (CSUR) , 2021
2021
Earlier work this paper cites.
2021
Cited alongside, same era.
E. Dai and S. Wang, “Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information,” in Proceedings of the 14th ACM International Conference on Web Search and Data Mining , 2021, pp. 680–688
2021
Cited alongside, same era.
Y. Gao, H. Yang, P. Zhang, C. Zhou, and Y. Hu, “Graph neural architecture search,” in International joint conference on artificial intelligence . International Joint Conference on Artificial Intelligence, 2021
2021
Cited alongside, same era.
F. Xia, K. Sun, S. Yu, A. Aziz, L. Wan, S. Pan, and H. Liu, “Graph learning: A survey,” IEEE Transactions on Artificial Intelligence , vol. 2, no. 2, pp. 109–127, 2021
2021
Cited alongside, same era.
S. Zhang, A. Sohrabizadeh, C. Wan, Z. Huang, Z. Hu, Y. Wang, J. Cong, Y. Sun et al. , “A survey on graph neural network acceleration: Algorithms, systems, and customized hardware,” arXiv , 2023
2023
Later among the works it cites.
X. Li, K. Wang, H. Deng, Y. Liang, and D. Wu, “Attend who is weak: Enhancing graph condensation via cross-free adversarial training,” arXiv , 2023
2023
Later among the works it cites.
J. Gao and J. Wu, “Multiple sparse graphs condensation,” Knowledge-Based Systems , 2023
2023
Later among the works it cites.
Q. Feng, Z. Jiang, R. Li, Y. Wang, N. Zou, J. Bian, and X. Hu, “Fair graph distillation,” in NeurIPS , 2023
2023
Later among the works it cites.
R. Mao, W. Fan, and Q. Li, “GCARe: Mitigating subgroup unfairness in graph condensation through adversarial regularization,” Applied Sciences , 2023
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Wu, F. Sun, W. Zhang, X. Xie, and B. Cui, “Graph neural networks in recommender systems: a survey,” ACM Computing Surveys , vol. 55, no. 5, pp. 1–37, 2022
2022
Cited alongside, same era.
2022
Cited alongside, same era.
M. Ding, X. Liu, T. Rabbani, T. Ranadive, T.-C. Tuan, and F. Huang, “Faster hyperparameter search for GNNs via calibrated dataset condensation,” arXiv , 2022
2022
Cited alongside, same era.
W. Zhang, Z. Sheng, M. Yang, Y. Li, Y. Shen, Z. Yang, and B. Cui, “Nafs: A simple yet tough-to-beat baseline for graph representation learning,” in International Conference on Machine Learning . PMLR, 2022, pp. 26 467–26 483
2022
Cited alongside, same era.
W. Zhang, Z. Yin, Z. Sheng, Y. Li, W. Ouyang, X. Li, Y. Tao, Z. Yang, and B. Cui, “Graph attention multi-layer perceptron,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2022, pp. 4560–4570
2022
Cited alongside, same era.
W. Jin, L. Zhao, S. Zhang, Y. Liu, J. Tang, and N. Shah, “Graph condensation for graph neural networks,” in ICLR , 2022
2022
Cited alongside, same era.
W. Jin, X. Tang, H. Jiang, Z. Li, D. Zhang, J. Tang, and B. Yin, “Condensing graphs via one-step gradient matching,” in SIGKDD , 2022
2022
Cited alongside, same era.
M. Liu, S. Li, X. Chen, and L. Song, “Graph condensation via receptive field distribution matching,” arXiv , 2022
2022
Cited alongside, same era.
Q. Pan, R. Wu, T. Liu, T. Zhang, Y. Zhu, and W. Wang, “FedGKD: Unleashing the power of collaboration in federated graph neural networks,” arXiv , 2023
2023
Later among the works it cites.
L. Wang, W. Fan, J. Li, Y. Ma, and Q. Li, “Fast graph condensation with structure-based neural tangent kernel,” arXiv , 2023
2023
Later among the works it cites.
Y. Liu, R. Qiu, Y. Tang, H. Yin, and Z. Huang, “PUMA: Efficient continual graph learning with graph condensation,” arXiv , 2023
2023
Later among the works it cites.
B. Zhao and H. Bilen, “Dataset condensation with distribution matching,” in WACV , 2023
2023
Later among the works it cites.
X. Wei, X. Gong, Y. Zhan, B. Du, Y. Luo, and W. Hu, “Clnode: Curriculum learning for node classification,” in Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining , 2023, pp. 670–678
2023
Later among the works it cites.
2023
Later among the works it cites.
H. Tu, S. Yu, V. Saikrishna, F. Xia, and K. Verspoor, “Deep outdated fact detection in knowledge graphs,” in 2023 IEEE International Conference on Data Mining Workshops (ICDMW) . IEEE, 2023, pp. 1443–1452
2023
Later among the works it cites.
F. G. Febrinanto, F. Xia, K. Moore, C. Thapa, and C. Aggarwal, “Graph lifelong learning: A survey,” IEEE Computational Intelligence Magazine , vol. 18, no. 1, pp. 32–51, 2023
2023
Later among the works it cites.
X. Gao, W. Zhang, J. Yu, Y. Shao, Q. V. H. Nguyen, B. Cui, and H. Yin, “Accelerating scalable graph neural network inference with node-adaptive propagation,” ICDE , 2024
2024
Closest in time.
2024
Closest in time.
M. Hashemi, S. Gong, J. Ni, W. Fan, B. A. Prakash, and W. Jin, “A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation,” International Joint Conference on Artificial Intelligence (IJCAI) , 2024
2024
Closest in time.
X. Gao, T. Chen, Y. Zang, W. Zhang, Q. V. H. Nguyen, K. Zheng, and H. Yin, “Graph condensation for inductive node representation learning,” in ICDE , 2024
2024
Closest in time.
S. Lei and D. Tao, “A comprehensive survey of dataset distillation,” TPAMI , 2024
2024
Closest in time.
N. Shabani, J. Wu, A. Beheshti, Q. Z. Sheng, J. Foo, V. Haghighi, A. Hanif, and M. Shahabikargar, “A comprehensive survey on graph summarization with graph neural networks,” IEEE Transactions on Artificial Intelligence , 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
J. Gao, J. Wu, and J. Ding, “Heterogeneous graph condensation,” IEEE Transactions on Knowledge and Data Engineering , 2024
2024
Closest in time.
J. Fang, X. Li, Y. Sui, Y. Gao, G. Zhang, K. Wang, X. Wang, and X. He, “Exgc: Bridging efficiency and explainability in graph condensation,” WWW , 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
X. Gao, H. Yin, T. Chen, G. Ye, W. Zhang, and B. Cui, “Robgc: Towards robust graph condensation,” arXiv , 2024
2024
Closest in time.
Y. Zhang, T. Zhang, K. Wang, Z. Guo, Y. Liang, X. Bresson, W. Jin, and Y. You, “Navigating complexity: Toward lossless graph condensation via expanding window matching,” ICML 2024 , 2024
2024
Closest in time.
Z. Liu, C. Zeng, and G. Zheng, “Graph data condensation via self-expressive graph structure reconstruction,” KDD , 2024
2024
Closest in time.
X. Gao, T. Chen, W. Zhang, Y. Li, X. Sun, and H. Yin, “Graph condensation for open-world graph learning,” KDD , 2024
2024
Closest in time.
Y. Liu, D. Bo, and C. Shi, “Graph distillation via eigenbasis matching,” ICML , 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
M. Gupta, S. Manchanda, S. Ranu, and H. Kodamana, “Mirage: Model-agnostic graph distillation for graph classification,” ICLR , 2024
2024
Closest in time.
A. Chen, R. A. Rossi, N. Park, P. Trivedi, Y. Wang, T. Yu, S. Kim, F. Dernoncourt, and N. K. Ahmed, “Fairness-aware graph neural networks: A survey,” ACM Transactions on Knowledge Discovery from Data , vol. 18, no. 6, pp. 1–23, 2024
2024
Closest in time.
2024
Closest in time.