Search Results for author: Zhaocheng Zhu

Found 18 papers, 13 papers with code

Zero-shot Logical Query Reasoning on any Knowledge Graph

2 code implementations10 Apr 2024 Mikhail Galkin, Jincheng Zhou, Bruno Ribeiro, Jian Tang, Zhaocheng Zhu

Complex logical query answering (CLQA) in knowledge graphs (KGs) goes beyond simple KG completion and aims at answering compositional queries comprised of multiple projections and logical operations.

Knowledge Graphs

Large Language Models can Learn Rules

no code implementations10 Oct 2023 Zhaocheng Zhu, Yuan Xue, Xinyun Chen, Denny Zhou, Jian Tang, Dale Schuurmans, Hanjun Dai

In the deduction stage, the LLM is then prompted to employ the learned rule library to perform reasoning to answer test questions.

Relational Reasoning

Towards Foundation Models for Knowledge Graph Reasoning

1 code implementation6 Oct 2023 Mikhail Galkin, Xinyu Yuan, Hesham Mostafa, Jian Tang, Zhaocheng Zhu

The key challenge of designing foundation models on KGs is to learn such transferable representations that enable inference on any graph with arbitrary entity and relation vocabularies.

Knowledge Graphs Link Prediction +1

GraphText: Graph Reasoning in Text Space

no code implementations2 Oct 2023 Jianan Zhao, Le Zhuo, Yikang Shen, Meng Qu, Kai Liu, Michael Bronstein, Zhaocheng Zhu, Jian Tang

Furthermore, GraphText paves the way for interactive graph reasoning, allowing both humans and LLMs to communicate with the model seamlessly using natural language.

In-Context Learning Text Generation

Neural Graph Reasoning: Complex Logical Query Answering Meets Graph Databases

1 code implementation26 Mar 2023 Hongyu Ren, Mikhail Galkin, Michael Cochez, Zhaocheng Zhu, Jure Leskovec

Extending the idea of graph databases (graph DBs), NGDB consists of a Neural Graph Storage and a Neural Graph Engine.

Link Prediction Logical Reasoning +1

Inductive Logical Query Answering in Knowledge Graphs

1 code implementation13 Oct 2022 Mikhail Galkin, Zhaocheng Zhu, Hongyu Ren, Jian Tang

Exploring the efficiency--effectiveness trade-off, we find the inductive relational structure representation method generally achieves higher performance, while the inductive node representation method is able to answer complex queries in the inference-only regime without any training on queries and scales to graphs of millions of nodes.

Complex Query Answering Entity Embeddings +2

A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphs

2 code implementations NeurIPS 2023 Zhaocheng Zhu, Xinyu Yuan, Mikhail Galkin, Sophie Xhonneux, Ming Zhang, Maxime Gazeau, Jian Tang

Experiments on both transductive and inductive knowledge graph reasoning benchmarks show that A*Net achieves competitive performance with existing state-of-the-art path-based methods, while merely visiting 10% nodes and 10% edges at each iteration.

Knowledge Graphs

PEER: A Comprehensive and Multi-Task Benchmark for Protein Sequence Understanding

1 code implementation5 Jun 2022 Minghao Xu, Zuobai Zhang, Jiarui Lu, Zhaocheng Zhu, Yangtian Zhang, Chang Ma, Runcheng Liu, Jian Tang

However, there is a lack of a standard benchmark to evaluate the performance of different methods, which hinders the progress of deep learning in this field.

Feature Engineering Multi-Task Learning +2

TorchDrug: A Powerful and Flexible Machine Learning Platform for Drug Discovery

1 code implementation16 Feb 2022 Zhaocheng Zhu, Chence Shi, Zuobai Zhang, Shengchao Liu, Minghao Xu, Xinyu Yuan, Yangtian Zhang, Junkun Chen, Huiyu Cai, Jiarui Lu, Chang Ma, Runcheng Liu, Louis-Pascal Xhonneux, Meng Qu, Jian Tang

However, lacking domain knowledge (e. g., which tasks to work on), standard benchmarks and data preprocessing pipelines are the main obstacles for machine learning researchers to work in this domain.

BIG-bench Machine Learning Drug Discovery +2

Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction

1 code implementation NeurIPS 2021 Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal Xhonneux, Jian Tang

To further improve the capacity of the path formulation, we propose the Neural Bellman-Ford Network (NBFNet), a general graph neural network framework that solves the path formulation with learned operators in the generalized Bellman-Ford algorithm.

Inductive Relation Prediction Link Prediction +1

Self-Adaptive Network Pruning

no code implementations20 Oct 2019 Jinting Chen, Zhaocheng Zhu, Cheng Li, Yuming Zhao

Our method introduces a general Saliency-and-Pruning Module (SPM) for each convolutional layer, which learns to predict saliency scores and applies pruning for each channel.

Network Pruning

GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding

1 code implementation2 Mar 2019 Zhaocheng Zhu, Shizhen Xu, Meng Qu, Jian Tang

In this paper, we propose GraphVite, a high-performance CPU-GPU hybrid system for training node embeddings, by co-optimizing the algorithm and the system.

Dimensionality Reduction Knowledge Graph Embedding +4

Saliency Supervision: An Intuitive and Effective Approach for Pain Intensity Regression

no code implementations16 Nov 2018 Conghui Li, Zhaocheng Zhu, Yuming Zhao

However, due to the limitation in data sources and the subjectiveness in pain intensity values, it is hard to adopt modern deep neural networks for this problem without domain-specific auxiliary design.

Face Verification Pain Intensity Regression +1

Context Aware Document Embedding

no code implementations5 Jul 2017 Zhaocheng Zhu, Junfeng Hu

Recently, doc2vec has achieved excellent results in different tasks.

Document Embedding

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