Paper
Aitchison Embeddings for Learning Compositional Graph Representations
- Authors: Nikolaos Nakis, Chrosoula Kosma, Panagiotis Promponas, Michail Chatzianastasis, Giannis Nikolentzos
- arXiv: 2605.00716 | 2026-04-30
- A social network user may be simultaneously: "tech enthusiast" + "music fan" + "traveler"
- A protein in a PPI network may participate in: "metabolism" + "signal transduction" + "transcriptional regulation"
- Paper: Aitchison Embeddings for Learning Compositional Graph Representations
- arXiv: https://arxiv.org/abs/2605.00716
The Problem: Opaque Graph Embeddings
When you train a graph neural network, each node gets an embedding vector. But ask what that vector *means*—which structural features influenced it, what each dimension represents—and the usual answer is: nobody knows. Traditional graph embeddings are black boxes. What we need is not just "good" embeddings but "interpretable" ones.
The Compositional View: Nodes as Mixtures of Prototypes
The paper's core hypothesis:
> Nodes in a network are best described as mixtures of latent prototype factors.
Examples:
Most existing embeddings map nodes to arbitrary vector spaces without explicitly modeling this compositional structure, and thus offer poor interpretability.
Why Aitchison Geometry?
Aitchison geometry is a mathematical framework for comparing compositional data—data whose parts sum to a constant (percentages, proportions). A node described as "30% tech + 40% music + 30% travel" is exactly such a composition.
Key advantages:
1. Natural fit for mixtures — embeddings as proportional combinations of prototypes are inherently compositional. 2. Meaningful metric — Aitchison distance measures compositional difference, more appropriate than Euclidean distance for comparing mixtures. 3. Interpretability — each dimension corresponds to a prototype; values express degree of membership in human-understandable semantics.
Technically, nodes are represented as compositions on the simplex, with a learned mapping from graph structure to the simplex that preserves Aitchison geometric properties. Each node effectively gets an "ID card"—not an opaque string of numbers, but a readable profile of roles and proportions.
Why Interpretability Matters
1. Scientific discovery — knowing a protein's role mix helps understand function in biological networks; knowing a user's interest mix helps understand behavior. 2. Error diagnosis — misclassifications can be traced to abnormal prototype weights (e.g., "this node was misjudged because its weight on the 'tech' prototype was anomalously high"). 3. Interactive exploration — recommendations can be explained ("we recommend this author because you share a 'tech + sci-fi' profile"). 4. Knowledge transfer — prototypes can transfer across datasets (e.g., a "tech enthusiast" prototype from social networks to product recommendation).
The Feynman Perspective
> "What I cannot create, I do not understand." — Feynman
In representation learning, the converse holds: what you cannot explain, you do not truly understand. The philosophy of Aitchison embeddings is that representation is meaningful decomposition, not arbitrary compression—not "compress a node into 128 numbers," but "identify its constituent roles and represent them as proportions." This is a paradigm shift from black-box embeddings to white-box representations.
Takeaways for Practitioners
If you build GNNs or representation learning systems, ask:
1. Are my embeddings interpretable? What does each dimension/component represent? 2. Can nodes naturally be seen as combinations of prototypes? 3. Does the mathematics of compositional data (e.g., Aitchison geometry) apply to my scenario? 4. Does interpretability matter for my application?
Every node in a graph is a complex entity—not a single role but a mixture of identities. Capturing that mixture with Aitchison geometry improves performance and, for the first time, lets us "read" the meaning of graph embeddings. From numeric vectors to role compositions: a meaningful step toward interpretable AI in graph representation learning.