1 code implementation • 29 Sep 2023 • Hao liu, Jiarui Feng, Lecheng Kong, Ningyue Liang, DaCheng Tao, Yixin Chen, Muhan Zhang
For in-context learning on graphs, OFA introduces a novel graph prompting paradigm that appends prompting substructures to the input graph, which enables it to address varied tasks without fine-tuning.
1 code implementation • 19 Sep 2023 • Hao liu, Jiarui Feng, Lecheng Kong, DaCheng Tao, Yixin Chen, Muhan Zhang
In our study, we first identify two crucial advantages of contrastive learning compared to meta learning, including (1) the comprehensive utilization of graph nodes and (2) the power of graph augmentations.
1 code implementation • NeurIPS 2023 • Jiarui Feng, Lecheng Kong, Hao liu, DaCheng Tao, Fuhai Li, Muhan Zhang, Yixin Chen
We theoretically prove that even if we fix the space complexity to $O(n^k)$ (for any $k\geq 2$) in $(k, t)$-FWL, we can construct an expressiveness hierarchy up to solving the graph isomorphism problem.
Ranked #2 on Graph Regression on ZINC-500k
no code implementations • 5 Mar 2023 • Hao liu, Muhan Zhang, Zehao Dong, Lecheng Kong, Yixin Chen, Bradley Fritz, DaCheng Tao, Christopher King
We view time-associated disease prediction as classification tasks at multiple time points.
no code implementations • 27 Jan 2023 • Lecheng Kong, Christopher King, Bradley Fritz, Yixin Chen
Learning to represent free text is a core task in many clinical machine learning (ML) applications, as clinical text contains observations and plans not otherwise available for inference.
1 code implementation • 6 Oct 2022 • Lecheng Kong, Yixin Chen, Muhan Zhang
The GNN embeddings of nodes on the shortest paths are used to generate geodesic representations.