Aitchison Embeddings for Learning Compositional Graph Representations

arXiv:2605.00716 · cs.LG, cs.SI · Submitted 2026-05-01 · Read on arXiv

cs.LG, cs.SI

Submitted: 2026-05-01

Updated: 2026-08-27

Comments: ICML 2026 Camera-ready version

Code: https://github.com/Nicknakis/AICoG

License: http://creativecommons.org/licenses/by/4.0/

The gist: Representation learning is central to graph machine learning, powering tasks such as link prediction and node classification.

Terminology

Abstract

Representation learning is central to graph machine learning, powering tasks such as link prediction and node classification. However, most graph embeddings are hard to interpret, offering limited insight into how learned features relate to graph structure. Many networks naturally admit a role-mixture view, where nodes are best described as mixtures over latent archetypal factors. Motivated by this structure, we propose a compositional graph embedding framework grounded in Aitchison geometry, the canonical geometry for comparing mixtures. Nodes are represented as simplex-valued compositions and embedded via isometric log-ratio (ILR) coordinates, which preserve Aitchison distances while enabling unconstrained optimization in Euclidean space. This yields intrinsically interpretable embeddings whose geometry reflects relative trade-offs among archetypes and supports coherent behavior under component restriction; we consider both fixed and learnable ILR bases. Across node classification and link prediction, our method achieves competitive performance with strong baselines while providing explainability by construction rather than post-hoc. Finally, subcompositional coherence enables principled component restriction: removing and renormalizing subsets preserves a well-defined geometry, which we exploit via subcompositional dimensionality removal to probe how archetype groups influence representations and predictions.

Sources

Related papers