# Graph Neural Network Embeddings

> One thread of 9 from the "embedding" map, covering the 12 papers in it. The other threads are not represented here.
>
> Every quotation was copied word for word from the paper's own text, and
> checked against that text. Quotes marked *inferred* failed that check and
> must be re-checked before use. Quotes marked *not re-checked* have not been
> matched against the paper's text as it now stands, so they carry no current
> verification either. Lines labelled *the tool's reading* are
> model judgment, not quotation, and carry no verification.
>
> **This is a scaffold, not prose.** The citations, quotes and structure are
> real; the argument is yours to write.

> Connects to: Knowledge Graph & Relational Embeddings, Domain-Specific Metric Embeddings.

Began with simple node-to-vector mappings preserving graph structure (2015-2016), evolved through spectral and spatial graph convolutions to compute embeddings reflecting neighborhood information (2016-2017), matured into scalable architectures for recommendation and heterogeneous networks (2018-2020).


**Spectral Networks and Locally Connected Networks on Graphs** (2013) \cite{bruna2013spectral}

What it did: Introduce embedding as low-dimensional geometric mapping  *(the tool's reading)*

The paper establishes embedding as mapping graph vertices into low-dimensional Euclidean space to preserve graph locality structure. This foundational notion sets the geometric interpretation for all subsequent graph embedding work.  *(the tool's reading)*

> “One possible option is to consider a global embedding of the graph into a low dimensional space, which is rare in practice for high-dimensional data.”
>
> ✓ verified: found word for word in the paper's own text


**Semi-Supervised Classification with Graph Convolutional Networks** (2016) \cite{kipf2016semi}

What it did: Shift to learned node representations via skip-gram methods  *(the tool's reading)*

The paper reframes embeddings as learned vector representations encoding both local graph structure and node features, inspired by skip-gram approaches. This moves embedding from pure geometry to data-driven learning on graphs.  *(the tool's reading)*

> “Right: t-SNE […] visualization of hidden layer activations of a two-layer GCN trained on the Cora dataset […] using 5% of labels.”
>
> ✓ verified: found word for word in the paper's own text


**Variational Graph Auto-Encoders** (2016) \cite{kipf2016variational}

What it did: Apply GCN encoder to produce latent node embeddings  *(the tool's reading)*

The paper introduces a probabilistic framework where a GCN-based encoder produces low-dimensional latent embeddings from which graph structure can be reconstructed. This advances embedding learning to unsupervised probabilistic settings.  *(the tool's reading)*

> “We demonstrate the ability of the VGAE and GAE models to learn meaningful latent embeddings on a link prediction task on several popular citation network datastets […].”
>
> ✓ verified: found word for word in the paper's own text


**Learning Combinatorial Optimization Algorithms over Graphs** (2017) \cite{dai2017learning}

What it did: Use embeddings for recursive neighborhood aggregation in optimization  *(the tool's reading)*

The paper proposes Structure2Vec to compute embeddings by recursively aggregating neighborhood information for combinatorial optimization. This moves embeddings from representation to solution-finding for structured problems.  *(the tool's reading)*

> “This graph embedding network will compute a p-dimensional feature embedding μ_v for each node v∈V, given the current partial solution S.”
>
> ✓ verified: found word for word in the paper's own text


**Attributed Social Network Embedding** (2017) \cite{liao2017attributed}

> “The aim of social network embedding is to project the social actors into a low-dimensional vector space (a.k.a. embedding space).”
>
> ✓ verified: found word for word in the paper's own text


**Inductive Representation Learning on Large Graphs** (2017) \cite{hamilton2017inductive}

What it did: Enable inductive learning via aggregator functions  *(the tool's reading)*

GraphSAGE trains aggregator functions rather than per-node embeddings, learning to aggregate neighborhood features to generalize to unseen nodes. This fundamentally shifts embeddings from transductive to inductive representation learning.  *(the tool's reading)*

> “The basic idea behind node embedding approaches is to use dimensionality reduction techniques to distill the high-dimensional information about a node's graph neighborhood into a dense vector embedding.”
>
> ✓ verified: found word for word in the paper's own text


**Graph Convolutional Matrix Completion** (2017) \cite{vandenberg2017graph}

> “Graph auto-encoders are comprised of 1) a graph encoder model Z = f(X, A), which take as input an N× D feature matrix X and a graph adjacency matrix A, and produce an N× E node embedding matrix Z = [z_1^T, …, z_N^T]^T, and 2) a pairwise decoder model Ǎ = g(Z), which takes pairs of node embeddings (z_i, z_j) and predicts respective entries Ǎ_ij in the adjacency matrix.”
>
> ✓ verified: found word for word in the paper's own text


**Network Embedding as Matrix Factorization** (2017) \cite{qiu2017network}

> “Formally, the problem of network embedding is ofen formalized as follows: Given an undirected and weighted graph G=(V, E) with V as the node set and E as the edge set, the goal is to learn a function V →R|V |×d that maps each vertex to a d-dimensional (d ≪|V |) latent representation that captures the structural properties of G.”
>
> ✓ verified: found word for word in the paper's own text


**Graph Convolutional Neural Networks for Web-Scale Recommender Systems** (2018) \cite{ying2018graph}

What it did: Scale embeddings to billions of nodes via importance pooling  *(the tool's reading)*

PinSAGE applies random-walk importance-weighted neighborhood aggregation to generate embeddings for billions of nodes at web scale. This demonstrates practical industrial-scale deployment of GCN embeddings.  *(the tool's reading)*

> “We develop a data-efficient Graph Convolutional Network (GCN) algorithm RW-GCN, which combines efficient random walks and graph convolutions to generate embeddings of nodes (i.e., items) that incorporate both graph structure as well as node feature information.”
>
> ✓ verified: found word for word in the paper's own text


**Representation Learning for Attributed Multiplex Heterogeneous Network** (2019) \cite{cen2019representation}

> “Network embedding (or graph embedding) has been widely used in many real-world applications.”
>
> ✓ verified: found word for word in the paper's own text


**Neural Graph Collaborative Filtering** (2019) \cite{wang2019neural}

What it did: Encode collaborative signal via high-order connectivities in embeddings  *(the tool's reading)*

NGCF explicitly encodes collaborative signals through high-order neighborhood interactions during embedding propagation rather than just aggregating neighbor embeddings. This refines how embeddings capture multi-hop relationships.  *(the tool's reading)*

> “Generally speaking, there are two key components in learnable CF models — 1) embedding, which transforms users and items to vectorized representations, and 2) interaction modeling, which reconstructs historical interactions based on the embeddings.”
>
> ✓ verified: found word for word in the paper's own text


**LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation** (2020) \cite{he2020lightgcn}

What it did: Simplify embeddings through linear neighborhood propagation  *(the tool's reading)*

LightGCN removes feature transformation and nonlinear activations while using weighted combination of layer-wise embeddings for refined representation. This streamlines GCN embeddings by isolating the essential propagation mechanism.  *(the tool's reading)*

> “The most common paradigm for CF is to learn latent features (a.k.a. embedding) to represent a user and an item, and perform prediction based on the embedding vectors […].”
>
> ✓ verified: found word for word in the paper's own text


_[Your synthesis: what it enabled, what it left unsolved.]_


## Where this thread connects

Each crossing is where one line of work fed another. These are the tool's reading of
the corpus, not quotations.

- **Knowledge Graph & Relational Embeddings** → **Graph Neural Network Embeddings** (2016): Structure-aware node vectors
- **Graph Neural Network Embeddings** → **Domain-Specific Metric Embeddings** (2018): Graph-based ranking