Search Results for author: Jiarui Feng

Found 10 papers, 10 papers with code

GOFA: A Generative One-For-All Model for Joint Graph Language Modeling

1 code implementation12 Jul 2024 Lecheng Kong, Jiarui Feng, Hao liu, Chengsong Huang, Jiaxin Huang, Yixin Chen, Muhan Zhang

For example, current attempts at designing general graph models either transform graph data into a language format for LLM-based prediction or still train a GNN model with LLM as an assistant.

All Language Modeling +2

TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models

1 code implementation20 Jun 2024 Jiarui Feng, Hao liu, Lecheng Kong, Mingfang Zhu, Yixin Chen, Muhan Zhang

In TAGLAS, we collect and integrate more than 23 TAG datasets with domains ranging from citation graphs to molecule graphs and tasks from node classification to graph question-answering.

Graph Question Answering Node Classification +2

One for All: Towards Training One Graph Model for All Classification Tasks

1 code implementation29 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.

All Graph Classification +4

Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks

1 code implementation19 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.

CoLA Contrastive Learning +3

Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power

1 code implementation NeurIPS 2023 Junru Zhou, Jiarui Feng, Xiyuan Wang, Muhan Zhang

Many of the proposed GNN models with provable cycle counting power are based on subgraph GNNs, i. e., extracting a bag of subgraphs from the input graph, generating representations for each subgraph, and using them to augment the representation of the input graph.

Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman

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.

Graph Regression

A Visual Active Search Framework for Geospatial Exploration

1 code implementation28 Nov 2022 Anindya Sarkar, Michael Lanier, Scott Alfeld, Jiarui Feng, Roman Garnett, Nathan Jacobs, Yevgeniy Vorobeychik

Many problems can be viewed as forms of geospatial search aided by aerial imagery, with examples ranging from detecting poaching activity to human trafficking.

Domain Adaptation

Reward Delay Attacks on Deep Reinforcement Learning

1 code implementation8 Sep 2022 Anindya Sarkar, Jiarui Feng, Yevgeniy Vorobeychik, Christopher Gill, Ning Zhang

We find that this mitigation remains insufficient to ensure robustness to attacks that delay, but preserve the order, of rewards.

Deep Reinforcement Learning Q-Learning +2

How Powerful are K-hop Message Passing Graph Neural Networks

1 code implementation26 May 2022 Jiarui Feng, Yixin Chen, Fuhai Li, Anindya Sarkar, Muhan Zhang

Recently, researchers extended 1-hop message passing to K-hop message passing by aggregating information from K-hop neighbors of nodes simultaneously.

Cannot find the paper you are looking for? You can Submit a new open access paper.