65 citations · 150 across the 7 of their papers we have counts for
7 papers
Gemma 3 Technical Report
Gemma Team, Aishwarya Kamath, Johan Ferret +209
We introduce Gemma 3, a multimodal addition to the Gemma family of lightweight open models, ranging in scale from 1 to 27 billion parameters. This version introduces vision underst…
Let Your Graph Do the Talking: Encoding Structured Data for LLMs
Bryan Perozzi, Bahare Fatemi, Dustin Zelle +4
How can we best encode structured data into sequential form for use in large language models (LLMs)? In this work, we introduce a parameter-efficient method to explicitly represent…
UGSL: A Unified Framework for Benchmarking Graph Structure Learning
Bahare Fatemi, Sami Abu-El-Haija, Anton Tsitsulin +5
Graph neural networks (GNNs) demonstrate outstanding performance in a broad range of applications. While the majority of GNN applications assume that a graph structure is given, so…
Learning Large Graph Property Prediction via Graph Segment Training
Kaidi Cao, Phitchaya Mangpo Phothilimthana, Sami Abu-El-Haija +5
Learning to predict properties of large graphs is challenging because each prediction requires the knowledge of an entire graph, while the amount of memory available during trainin…
TF-GNN: Graph Neural Networks in TensorFlow
Oleksandr Ferludin, Arno Eigenwillig, Martin Blais +24
TensorFlow-GNN (TF-GNN) is a scalable library for Graph Neural Networks in TensorFlow. It is designed from the bottom up to support the kinds of rich heterogeneous graph data that…
Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks
Minji Yoon, John Palowitch, Dustin Zelle +3
Data continuously emitted from industrial ecosystems such as social or e-commerce platforms are commonly represented as heterogeneous graphs (HG) composed of multiple node/edge typ…
DDGK: Learning Graph Representations for Deep Divergence Graph Kernels
Rami Al-Rfou, Dustin Zelle, Bryan Perozzi
Can neural networks learn to compare graphs without feature engineering? In this paper, we show that it is possible to learn representations for graph similarity with neither domai…