1 citations · 1 across the 2 of their papers we have counts for
6 papers
PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
Bingheng Li, Linxin Yang, Yupeng Chen +8
Solving large-scale linear programming (LP) problems is an important task in various areas such as communication networks, power systems, finance and logistics. Recently, two disti…
Position: Graph Foundation Models are Already Here
Haitao Mao, Zhikai Chen, Wenzhuo Tang +6
Graph Foundation Models (GFMs) are emerging as a significant research topic in the graph domain, aiming to develop graph models trained on extensive and diverse data to enhance the…
A Survey to Recent Progress Towards Understanding In-Context Learning
Haitao Mao, Guangliang Liu, Yao Ma +3
In-Context Learning (ICL) empowers Large Language Models (LLMs) with the ability to learn from a few examples provided in the prompt, enabling downstream generalization without the…
Distance-Based Propagation for Efficient Knowledge Graph Reasoning
Harry Shomer, Yao Ma, Juanhui Li +3
Knowledge graph completion (KGC) aims to predict unseen edges in knowledge graphs (KGs), resulting in the discovery of new facts. A new class of methods have been proposed to tackl…
LPFormer: An Adaptive Graph Transformer for Link Prediction
Harry Shomer, Yao Ma, Haitao Mao +3
Link prediction is a common task on graph-structured data that has seen applications in a variety of domains. Classically, hand-crafted heuristics were used for this task. Heuristi…
Revisiting Link Prediction: A Data Perspective
Haitao Mao, Juanhui Li, Harry Shomer +6
Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. How…