Fetching the paper…
Reading the bibliography…
Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains.
B. Weisfeiler and A. Leman, “The reduction of a graph to canonical form and the algebra which appears therein,”
1968
Earlier work this paper cites.
L. Freeman, “The development of social network analysis,”
2004
Earlier work this paper cites.
S. Yan, D. Xu, B. Zhang, H.-J. Zhang, Q. Yang, and S. Lin, “Graph embedding and extensions: A general framework for dimensionality reduction,”
2006
Earlier work this paper cites.
M. Nickel, V. Tresp, H.-P. Kriegel
2011
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in
2014
Earlier work this paper cites.
C. Yang, Z. Liu, D. Zhao
2015
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in
2016
Earlier work this paper cites.
C. Shi, Y. Li, J. Zhang
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,”
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,”
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,”
2017
Earlier work this paper cites.
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in
2018
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova
2018
Earlier work this paper cites.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in
2018
Earlier work this paper cites.
J. B. Lee, R. Rossi, and X. Kong, “Graph classification using structural attention,” in
2018
Earlier work this paper cites.
J. Howard and S. Ruder, “Universal language model fine-tuning for text classification,” in
2018
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in
2019
Earlier work this paper cites.
C. Wang, S. Pan, R. Hu
2019
Earlier work this paper cites.
Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in
2019
Earlier work this paper cites.
X. Jiang, P. Ji, and S. Li, “Censnet: convolution with edge-node switching in graph neural networks,” in
2019
Earlier work this paper cites.
J. Devlin, M. Chang, K. Lee, and K. Toutanova, “BERT: pre-training of deep bidirectional transformers for language understanding,” in
2019
Earlier work this paper cites.
P. Veličković, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in
2019
Earlier work this paper cites.
N. Reimers and I. Gurevych, “Sentence-bert: Sentence embeddings using siamese bert-networks,” in
2019
Earlier work this paper cites.
Z. Yang, Z. Dai, Y. Yang, J. Carbonell, R. R. Salakhutdinov, and Q. V. Le, “Xlnet: Generalized autoregressive pretraining for language understanding,”
2019
Earlier work this paper cites.
N. Saunshi, O. Plevrakis, S. Arora, M. Khodak, and H. Khandeparkar, “A theoretical analysis of contrastive unsupervised representation learning,” in
2019
Earlier work this paper cites.
X. Liu, P. He, W. Chen, and J. Gao, “Multi-task deep neural networks for natural language understanding,” in
2019
Earlier work this paper cites.
N. Houlsby, A. Giurgiu, S. Jastrzebski
2019
Earlier work this paper cites.
X. Wang, H. Ji, C. Shi
2019
Earlier work this paper cites.
H. Yang, “Aligraph: A comprehensive graph neural network platform,” in
2019
Earlier work this paper cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,”
2020
Earlier work this paper cites.
Z. Wu, S. Pan, F. Chen
2020
Earlier work this paper cites.
J. Gao, T. Zhang, and C. Xu, “Learning to model relationships for zero-shot video classification,”
2020
Earlier work this paper cites.
Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification,” in
2020
Earlier work this paper cites.
O. Wieder, S. Kohlbacher, M. Kuenemann
2020
Earlier work this paper cites.
X. Qiu, T. Sun, Y. Xu, Y. Shao, N. Dai, and X. Huang, “Pre-trained models for natural language processing: A survey,”
2020
Earlier work this paper cites.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Deep Graph Contrastive Representation Learning,” in
2020
Earlier work this paper cites.
T. Brown, B. Mann, N. Ryder
2020
Earlier work this paper cites.
C. Raffel, N. Shazeer, A. Roberts
2020
Earlier work this paper cites.
J. Qiu, Q. Chen, Y. Dong
2020
Earlier work this paper cites.
Y. You, T. Chen, Y. Sui
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
Y. Rong, Y. Bian, T. Xu
2020
Earlier work this paper cites.
Z. Hu, Y. Dong, K. Wang
2020
Earlier work this paper cites.
M. Lewis, Y. Liu, N. Goyal
2020
Earlier work this paper cites.
Z. Jiang, F. F. Xu, J. Araki, and G. Neubig, “How can we know what language models know?”
2020
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,”
2020
Earlier work this paper cites.
D. Zhang, X. Huang, Z. Liu
2020
Earlier work this paper cites.
O. J. Wouters, M. McKee, and J. Luyten, “Estimated research and development investment needed to bring a new medicine to market, 2009-2018,”
2020
Earlier work this paper cites.
X. Wang, Y. Ma, Y. Wang, W. Jin, X. Wang, J. Tang, C. Jia, and J. Yu, “Traffic flow prediction via spatial temporal graph neural network,” in
2020
Earlier work this paper cites.
J. You, Z. Ying, and J. Leskovec, “Design space for graph neural networks,”
2020
Earlier work this paper cites.
P. Li, Y. Wang, H. Wang, and J. Leskovec, “Distance encoding: Design provably more powerful neural networks for graph representation learning,”
2020
Earlier work this paper cites.
X. Zou, X. Zhao, P. Liò, and Y. Zhao, “Will more expressive graph neural networks do better on generative tasks?” in
2020
Earlier work this paper cites.
R. Bommasani, D. A. Hudson, E. Adeli
2021
Earlier work this paper cites.
U. Alon and E. Yahav, “On the bottleneck of graph neural networks and its practical implications,” in
2021
Earlier work this paper cites.
G. Muzio, L. O’Bray, and K. Borgwardt, “Biological network analysis with deep learning,”
2021
Earlier work this paper cites.
M. Li, S. Chen, X. Chen
2021
Earlier work this paper cites.
B. Zhang, J. Xiao, J. Jiao, Y. Wei, and Y. Zhao, “Affinity attention graph neural network for weakly supervised semantic segmentation,”
2021
Earlier work this paper cites.
C. Ying, T. Cai, S. Luo
2021
Earlier work this paper cites.
D. Kreuzer, D. Beaini, W. Hamilton, V. Létourneau, and P. Tossou, “Rethinking graph transformers with spectral attention,” in
2021
Earlier work this paper cites.
C. Yang, J. Liu, and C. Shi, “Extract the knowledge of graph neural networks and go beyond it: An effective knowledge distillation framework,” in
2021
Earlier work this paper cites.
M. Sun, J. Xing, H. Wang, B. Chen, and J. Zhou, “Mocl: data-driven molecular fingerprint via knowledge-aware contrastive learning from molecular graph,” in
2021
Earlier work this paper cites.
X. L. Li and P. Liang, “Prefix-tuning: Optimizing continuous prompts for generation,” in
2021
Earlier work this paper cites.
Q. Lhoest, A. V. del Moral, Y. Jernite
2021
Earlier work this paper cites.
L. Wu, H. Lin, C. Tan, Z. Gao, and S. Z. Li, “Self-supervised learning on graphs: Contrastive, generative, or predictive,”
2021
Earlier work this paper cites.
A. Dosovitskiy, L. Beyer, A. Kolesnikov
2021
Earlier work this paper cites.
Z. Liu, Y. Lin, Y. Cao, H. Hu, Y. Wei, Z. Zhang, S. Lin, and B. Guo, “Swin transformer: Hierarchical vision transformer using shifted windows,” in
2021
Earlier work this paper cites.
B. Lester, R. Al-Rfou, and N. Constant, “The power of scale for parameter-efficient prompt tuning,” in
2021
Earlier work this paper cites.
X. Jiang, Y. Lu, Y. Fang, and C. Shi, “Contrastive pre-training of gnns on heterogeneous graphs,” in
2021
Earlier work this paper cites.
X. Jiang, T. Jia, Y. Fang
2021
Earlier work this paper cites.
P. He, X. Liu, J. Gao, and W. Chen, “Deberta: Decoding-enhanced bert with disentangled attention,” in
2021
Earlier work this paper cites.
C. Poth, J. Pfeiffer, A. Rücklé, and I. Gurevych, “What to pre-train on? efficient intermediate task selection,” in
2021
Earlier work this paper cites.
J. Yang, Z. Liu, S. Xiao
2021
Earlier work this paper cites.
C. Edwards, C. Zhai, and H. Ji, “Text2mol: Cross-modal molecule retrieval with natural language queries,” in
2021
Earlier work this paper cites.
B. Wang, C. Xu, S. Wang
2021
Earlier work this paper cites.
X. Wang, H. Liu, C. Shi, and C. Yang, “Be confident! towards trustworthy graph neural networks via confidence calibration,”
2021
Earlier work this paper cites.
B. Fatemi, L. El Asri, and S. M. Kazemi, “Slaps: Self-supervision improves structure learning for graph neural networks,” in
2021
Cited alongside, same era.
R. Zhu, X. Jiang, J. Lu, and S. Li, “Cross-domain graph convolutions for adversarial unsupervised domain adaptation,”
2021
Cited alongside, same era.
J. Wei, Y. Tay, R. Bommasani
2022
Cited alongside, same era.
J. Wang, Z. Zhang, Z. Shi, J. Cai, S. Ji, and F. Wu, “Duality-induced regularizer for semantic matching knowledge graph embeddings,”
2022
Cited alongside, same era.
S. Zafeiriou, M. Bronstein, T. Cohen
2022
Cited alongside, same era.
W. Jiang and J. Luo, “Graph neural network for traffic forecasting: A survey,”
2022
Cited alongside, same era.
H. Wang, Z. Jiang, Y. You
2023
Closest in time.
Y. Yuan, “On the power of foundation models,” in
2023
Closest in time.
A. Davies, R. Green, N. Ajmeri, and T. S. Filho, “Its all graph to me: Single-model graph representation learning on multiple domains,” in
2023
Closest in time.
Y. Jiang, C. Chan, M. Chen, and W. Wang, “Lion: Adversarial distillation of proprietary large language models,” in
2023
Closest in time.
Y. Yao, P. Wang, B. Tian, S. Cheng, Z. Li, S. Deng, H. Chen, and N. Zhang, “Editing large language models: Problems, methods, and opportunities,” in
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Chen, L. O’Bray, and K. Borgwardt, “Structure-aware transformer for graph representation learning,” in
2022
Cited alongside, same era.
L. Rampášek, M. Galkin, V. P. Dwivedi, A. T. Luu, G. Wolf, and D. Beaini, “Recipe for a general, powerful, scalable graph transformer,”
2022
Cited alongside, same era.
Z. Song, X. Yang, Z. Xu, and I. King, “Graph-based semi-supervised learning: A comprehensive review,”
2022
Cited alongside, same era.
Y. Liu, M. Jin, S. Pan
2022
Cited alongside, same era.
J. Wei, X. Wang, D. Schuurmans
2022
Cited alongside, same era.
2022
Cited alongside, same era.
2023
Closest in time.
H. Zhang, H. Song, S. Li, M. Zhou, and D. Song, “A survey of controllable text generation using transformer-based pre-trained language models,”
2023
Closest in time.
J. Xia, Y. Zhu, Y. Du, and S. Z. Li, “A systematic survey of chemical pre-trained models,” in
2023
Closest in time.
X. Wang, D. Wang, L. Chen, F.-Y. Wang, and Y. Lin, “Building transportation foundation model via generative graph transformer,” in
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
H. Chen, T. Zhu, T. Zhang, W. Zhou, and P. S. Yu, “Privacy and fairness in federated learning: on the perspective of trade-off,”
2023
Closest in time.
L. Zeng, L. Li, Z. Gao, P. Zhao, and J. Li, “Imgcl: Revisiting graph contrastive learning on imbalanced node classification,” in
2023
Closest in time.
Z. Lian, L. Chen, L. Sun, B. Liu, and J. Tao, “Gcnet: Graph completion network for incomplete multimodal learning in conversation,”
2023
Closest in time.
J. M. Thomas, A. Moallemy-Oureh, S. Beddar-Wiesing, and C. Holzhüter, “Graph neural networks designed for different graph types: A survey,”
2023
Closest in time.
Z. Zhao, W. Fan, J. Li
2024
Closest in time.
C. Zhou, Q. Li, C. Li
2024
Closest in time.
S. Pan, L. Luo, Y. Wang, C. Chen, J. Wang, and X. Wu, “Unifying large language models and knowledge graphs: A roadmap,”
2024
Closest in time.
R. Lu, Z. Cheng, B. Chen, and X. Yuan, “Motion-aware dynamic graph neural network for video compressive sensing,”
2024
Closest in time.
Q. Dong, L. Li, D. Dai
2024
Closest in time.
S. Li, X. Han, and J. Bai, “Adaptergnn: Parameter-efficient fine-tuning improves generalization in gnns,” in
2024
Closest in time.
A. Gui, J. Ye, and H. Xiao, “G-adapter: Towards structure-aware parameter-efficient transfer learning for graph transformer networks,” in
2024
Closest in time.
L. Sun, Z. Huang, Z. Wang, F. Wang, H. Peng, and S. Y. Philip, “Motif-aware riemannian graph neural network with generative-contrastive learning,” in
2024
Closest in time.
X. He, X. Bresson, T. Laurent
2024
Closest in time.
L. Müller, M. Galkin, C. Morris, and L. Rampásek, “Attending to graph transformers,”
2024
Closest in time.
H. Zhao, A. Chen, X. Sun, H. Cheng, and J. Li, “All in one and one for all: A simple yet effective method towards cross-domain graph pretraining,” in
2024
Closest in time.
J. Zhao, D. Jin, M. Ge
2024
Closest in time.
Y. Sun, Q. Zhu, Y. Yang, C. Wang, T. Fan, J. Zhu, and L. Chen, “Fine-tuning graph neural networks by preserving graph generative patterns,” in
2024
Closest in time.
Y. Yan, P. Zhang, Z. Fang, and Q. Long, “Inductive graph alignment prompt: Bridging the gap between graph pre-training and inductive fine-tuning from spectral perspective,” in
2024
Closest in time.
C. Niu, G. Pang, L. Chen, and B. Liu, “Replay-and-forget-free graph class-incremental learning: A task profiling and prompting approach,” in
2024
Closest in time.
X. Yu, Z. Liu, Y. Fang, Z. Liu, S. Chen, and X. Zhang, “Generalized graph prompt: Toward a unification of pre-training and downstream tasks on graphs,”
2024
Closest in time.
X. Yu, C. Zhou, Y. Fang, and X. Zhang, “Multigprompt for multi-task pre-training and prompting on graphs,” in
2024
Closest in time.
X. Yu, Y. Fang, Z. Liu, and X. Zhang, “Hgprompt: Bridging homogeneous and heterogeneous graphs for few-shot prompt learning,” in
2024
Closest in time.
Y. Deng, R. Zhang, P. Xu, J. Ma, and Q. Gu, “Pre-trained hypergraph convolutional neural networks with self-supervised learning,”
2024
Closest in time.
M. Yang, Z. Liu, L. Yang
2024
Closest in time.
R. Ye, C. Zhang, R. Wang, S. Xu, and Y. Zhang, “Language is all a graph needs,” in
2024
Closest in time.
Z. Chen, H. Mao, H. Li
2024
Closest in time.
N. Chen, Y. Li, J. Tang, and J. Li, “Graphwiz: An instruction-following language model for graph problems,” in
2024
Closest in time.
A. Antonucci, G. Piqué, and M. Zaffalon, “Zero-shot causal graph extrapolation from text via llms,”
2024
Closest in time.
Z. Zhang, X. Wang, Z. Zhang, H. Li, Y. Qin, S. Wu, and W. Zhu, “Llm4dyg: Can large language models solve problems on dynamic graphs?” in
2024
Closest in time.
R. Lei, Y. Hu, Y. Ren, and Z. Wei, “Intruding with words: Towards understanding graph injection attacks at the text level,” in
2024
Closest in time.
H. Liu, J. Feng, L. Kong, N. Liang, D. Tao, Y. Chen, and M. Zhang, “One for all: Towards training one graph model for all classification tasks,” in
2024
Closest in time.
W. Wei, X. Ren, J. Tang
2024
Closest in time.
J. Zhu, X. Song, V. Ioannidis, D. Koutra, and C. Faloutsos, “Touchup-g: Improving feature representation through graph-centric finetuning,” in
2024
Closest in time.
Z. Chen, H. Mao, H. Wen, H. Han, W. Jin, H. Zhang, H. Liu, and J. Tang, “Label-free node classification on graphs with large language models (llms),” in
2024
Closest in time.
X. Huang, K. Han, Y. Yang
2024
Closest in time.
Y. Zhu, Y. Wang, H. Shi, and S. Tang, “Efficient tuning and inference for large language models on textual graphs,” in
2024
Closest in time.
L. Xia, B. Kao, and C. Huang, “Opengraph: Towards open graph foundation models,” in
2024
Closest in time.
X. Ren, W. Wei, L. Xia
2024
Closest in time.
P. Liu, Y. Ren, J. Tao, and Z. Ren, “Git-mol: A multi-modal large language model for molecular science with graph, image, and text,”
2024
Closest in time.
M. Zhang, M. Sun, P. Wang
2024
Closest in time.
J. Tang, Y. Yang, W. Wei, L. Shi, L. Su, S. Cheng, D. Yin, and C. Huang, “Graphgpt: Graph instruction tuning for large language models,” in
2024
Closest in time.
Z. Liu, X. He, Y. Tian, and N. V. Chawla, “Can we soft prompt llms for graph learning tasks?” in
2024
Closest in time.
J. Wang, J. Wu, Y. Wu
2024
Closest in time.
D. Wang, Y. Zuo, F. Li, and J. Wu, “Llms as zero-shot graph learners: Alignment of GNN representations with LLM token embeddings,” in
2024
Closest in time.
X. He, Y. Tian, Y. Sun
2024
Closest in time.
J. Tang, Y. Yang, W. Wei, L. Shi, L. Xia, D. Yin, and C. Huang, “Higpt: Heterogeneous graph language model,” in
2024
Closest in time.
A. Bazaga, P. Liò, and G. Micklem, “Hyperbert: Mixing hypergraph-aware layers with language models for node classification on text-attributed hypergraphs,” in
2024
Closest in time.
Z. Li, Z. Gou, X. Zhang, Z. Liu, S. Li, Y. Hu, C. Ling, Z. Zhang, and L. Zhao, “Teg-db: A comprehensive dataset and benchmark of textual-edge graphs,” in
2024
Closest in time.
X. Li, W. Chen, Q. Chu, H. Li, Z. Sun, R. Li, C. Qian, Y. Wei, Z. Liu, C. Shi
2024
Closest in time.
Z. Zeng, J. Yu, T. Gao, Y. Meng, T. Goyal, and D. Chen, “Evaluating large language models at evaluating instruction following,” in
2024
Closest in time.
T. Dao and A. Gu, “Transformers are ssms: Generalized models and efficient algorithms through structured state space duality,” in
2024
Closest in time.
Y. Yu, S. Buchanan, D. Pai, T. Chu, Z. Wu, S. Tong, B. Haeffele, and Y. Ma, “White-box transformers via sparse rate reduction,” in
2024
Closest in time.
Z. Wang, Y. Li, B. Ding, Y. Li, and Z. Wei, “Exploring neural scaling law and data pruning methods for node classification on large-scale graphs,” in
2024
Closest in time.
H. Mao, Z. Chen, W. Tang
2024
Closest in time.
Y. Zhu, Y. Wang, H. Shi, Z. Zhang, D. Jiao, and S. Tang, “Graphcontrol: Adding conditional control to universal graph pre-trained models for graph domain transfer learning,” in
2024
Closest in time.
J. Yu, R. He, and Z. Ying, “Thought propagation: An analogical approach to complex reasoning with large language models,” in
2024
Closest in time.
Z. Zhang, M. Zhang, Y. Yu, C. Yang, J. Liu, and C. Shi, “Endowing pre-trained graph models with provable fairness,” in
2024
Closest in time.
B. Yan, Y. Cao, H. Wang, W. Yang, J. Du, and C. Shi, “Federated heterogeneous graph neural network for privacy-preserving recommendation,” in
2024
Closest in time.
R. Staab, M. Vero, M. Balunovic, and M. Vechev, “Beyond memorization: Violating privacy via inference with large language models,” in
2024
Closest in time.
Z. Shi, Y. Wang, F. Yin, X. Chen, K.-W. Chang, and C.-J. Hsieh, “Red teaming language model detectors with language models,”
2024
Closest in time.
W. Tu, B. Xiao, X. Liu, S. Zhou, Z. Cai, and J. Cheng, “Revisiting initializing then refining: an incomplete and missing graph imputation network,”
2024
Closest in time.
X. Yu, J. Zhang, Y. Fang, and R. Jiang, “Non-homophilic graph pre-training and prompt learning,” in
2025
Closest in time.
H. Gao, C. Zhang, F. Wu, J. Zhao, C. Zheng, and H. Liu, “Bootstrapping heterogeneous graph representation learning via large language models: A generalized approach,” in
2025
Closest in time.
Z. Zhang, X. Wang, H. Zhou, Y. Yu, M. Zhang, C. Yang, and C. Shi, “Can large language models improve the adversarial robustness of graph neural networks?” in
2025
Closest in time.
T. Trouillon, J. Welbl, S. Riedel, É. Gaussier, and G. Bouchard, “Complex embeddings for simple link prediction,” in
2080
Closest in time.