Jay Revolinsky

According to our database, Jay Revolinsky authored at least 6 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Are Expressive Encoders Necessary for Discrete Graph Generation?

Jay Revolinsky, Harry Shomer, Jiliang Tang

CoRR, March, 2026

2025

Subgraph Generation for Generalizing on Out-of-Distribution Links.

Jay Revolinsky, Harry Shomer, Jiliang Tang

CoRR, July, 2025

From Sequence to Structure: Uncovering Substructure Reasoning in Transformers.

Xinnan Dai, Kai Yang, Jay Revolinsky, Kai Guo, Aoran Wang, Bohang Zhang, Jiliang Tang

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Towards Better Benchmark Datasets for Inductive Knowledge Graph Completion.

Harry Shomer, Jay Revolinsky, Jiliang Tang

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.2, 2025

Towards Understanding Link Predictor Generalizability Under Distribution Shifts.

Jay Revolinsky, Harry Shomer, Jiliang Tang

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, V.2, 2025

2024

Understanding the Generalizability of Link Predictors Under Distribution Shifts on Graphs.

Jay Revolinsky, Harry Shomer, Jiliang Tang

CoRR, 2024