4 papers
Local Message-Passing for Discrete Graph Generation
Jay Revolinsky, Harry Shomer, Jiliang Tang
Discrete graph generation has emerged as a powerful paradigm for modeling graph-structured data, yet state of the art models often rely on Graph Transformers or higher order archit…
Plain Transformers are Surprisingly Powerful Link Predictors
Quang Truong, Yu Song, Donald Loveland +4
Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies. While Graph Neural Networks (GNNs) are the s…
Higher-order Structure Boosts Link Prediction on Temporal Graphs
Jingzhe Liu, Zhigang Hua, Yan Xie +5
Temporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs. However, existing TGNNs primarily focus on pairwise…
An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
Linxin Yang, Bingheng Li, Tian Ding +6
Quadratic programs (QPs) arise in various domains such as machine learning, finance, and control. Recently, learning-enhanced primal-dual hybrid gradient (PDHG) methods have shown…