15 citations · 22 across the 9 of their papers we have counts for
10 papers
Enhancing Student Performance Prediction on Learnersourced Questions with SGNN-LLM Synergy
Lin Ni, Sijie Wang, Zeyu Zhang +4
Learnersourcing offers great potential for scalable education through student content creation. However, predicting student performance on learnersourced questions, which is essent…
USER: Unsupervised Structural Entropy-based Robust Graph Neural Network
Yifei Wang, Yupan Wang, Zeyu Zhang +3
Unsupervised/self-supervised graph neural networks (GNN) are vulnerable to inherent randomness in the input graph data which greatly affects the performance of the model in downstr…
RecBole 2.0: Towards a More Up-to-Date Recommendation Library
Wayne Xin Zhao, Yupeng Hou, Xingyu Pan +16
In order to support the study of recent advances in recommender systems, this paper presents an extended recommendation library consisting of eight packages for up-to-date topics a…
In Situ Answer Sentence Selection at Web-scale
Zeyu Zhang, Thuy Vu, Alessandro Moschitti
Current answer sentence selection (AS2) applied in open-domain question answering (ODQA) selects answers by ranking a large set of possible candidates, i.e., sentences, extracted f…
Double Retrieval and Ranking for Accurate Question Answering
Zeyu Zhang, Thuy Vu, Alessandro Moschitti
Recent work has shown that an answer verification step introduced in Transformer-based answer selection models can significantly improve the state of the art in Question Answering.…
A Comparative Study on Robust Graph Neural Networks to Structural Noises
Zeyu Zhang, Yulong Pei
Graph neural networks (GNNs) learn node representations by passing and aggregating messages between neighboring nodes. GNNs have been applied successfully in several application do…
Lasserre Integrality Gaps for Graph Spanners and Related Problems
Michael Dinitz, Yasamin Nazari, Zeyu Zhang
There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially…
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
Amy Babay, Michael Dinitz, Zeyu Zhang
We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph , a distance bound , and pairs of vertices $(s_1,t_1),\cdots,(s_p,…
Approximating Approximate Distance Oracles
Michael Dinitz, Zeyu Zhang
Given a finite metric space , an approximate distance oracle is a data structure which, when queried on two points , returns an approximation to the the actual di…
Ranking with Diverse Intents and Correlated Contents
Jian Li, Zeyu Zhang
We consider the following document ranking problem: We have a collection of documents, each containing some topics (e.g. sports, politics, economics). We also have a set of users w…