Aitchison Embeddings for Learning Compositional Graph Representations

• URL: http://arxiv.org/abs/2605.00716v1
• Date: Fri, 01 May 2026 15:05:23 GMT
• Title: Aitchison Embeddings for Learning Compositional Graph Representations
• Abstract summary: We propose a graph embedding framework grounded in Aitchison geometry, the canonical geometry for comparing mixtures.<n>Our method achieves competitive performance with strong baselines while providing explainability by construction rather than post-hoc.
• Score: 8.849342925277577
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Robust Graph Matching through Semantic Relationship Generation for SLAM [0.15635627702544694]
  Scene Graphs enable localization in structured indoor environments by matching a locally observed graph to a prior map.<n>We propose a semantic-enhanced graph matching approach that explicitly models relations between detected objects and structural elements.<n>Results show that semantic relations significantly reduce the number of candidate matches, improve computational efficiency, and enable faster convergence.
  arXiv  Detail & Related papers  (2026-04-28T09:15:51Z)
• Aligning the Unseen in Attributed Graphs: Interplay between Graph Geometry and Node Attributes Manifold [0.46976113832881716]
  We introduce a custom variational autoencoder that separates manifold learning from structural alignment.<n>By quantifying the metric distortion needed to map the attribute manifold onto the graph's Heat Kernel, we transform geometric conflict into a structural descriptor.
  arXiv  Detail & Related papers  (2026-01-30T10:34:26Z)
• Few-Shot Learning of a Graph-Based Neural Network Model Without Backpropagation [0.0]
  We propose a structural-graph approach to classifying contour images in a few-shot regime without using backpropagation.<n>An image is encoded as an attributed graph (critical points and lines represented as nodes with geometric attributes), and generalization is achieved via the formation of concept attractors.
  arXiv  Detail & Related papers  (2025-12-20T16:23:51Z)
• Edge-Centric Relational Reasoning for 3D Scene Graph Prediction [74.19580969696898]
  3D scene graph prediction aims to abstract complex 3D environments into structured graphs consisting of objects and their pairwise relationships.<n>Existing approaches typically adopt object-centric graph neural networks, where relation edge features are iteratively updated by aggregating messages from connected object nodes.<n>We propose a Link-guided Edge-centric relational reasoning framework with Object-aware fusion.
  arXiv  Detail & Related papers  (2025-11-19T09:53:56Z)
• GraphShaper: Geometry-aware Alignment for Improving Transfer Learning in Text-Attributed Graphs [16.624063216788638]
  We introduce textbfGraphShaper, a geometry-aware framework that enhances graph encoding through multi-geometric specialization.<n>Our approach employs expert networks tailored to different geometric spaces, dynamically computing fusion weights to adaptively integrate geometric properties.<n>It achieves 9.47% accuracy improvements on citation networks and 7.63% on social networks in zero-shot settings.
  arXiv  Detail & Related papers  (2025-10-14T02:48:50Z)
• A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs [54.62268052283014]
  We present a unified theoretical perspective based on the framework of signed graphs.<n>We show that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing.<n>We propose Structural Balanced Propagation (SBP), a plug-and-play method that assigns signed edges based on either labels or feature similarity.
  arXiv  Detail & Related papers  (2025-02-17T03:25:36Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• PA-GM: Position-Aware Learning of Embedding Networks for Deep Graph Matching [14.713628231555223]
  We introduce a novel end-to-end neural network that can map the linear assignment problem into a high-dimensional space. Our model constructs the anchor set for the relative position of nodes. It then aggregates the feature information of the target node and each anchor node based on a measure of relative position.
  arXiv  Detail & Related papers  (2023-01-05T06:54:21Z)
• Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
  This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL) GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures. Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
  arXiv  Detail & Related papers  (2022-06-25T03:54:53Z)
• Adversarial Graph Disentanglement [47.27978741175575]
  A real-world graph has a complex topological structure, which is often formed by the interaction of different latent factors. We propose an underlinetextbfAdversarial underlinetextbfDisentangled underlinetextbfGraph underlinetextbfConvolutional underlinetextbfNetwork (ADGCN) for disentangled graph representation learning.
  arXiv  Detail & Related papers  (2021-03-12T14:11:36Z)
• Towards Efficient Scene Understanding via Squeeze Reasoning [71.1139549949694]
  We propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector. We show that our approach can be modularized as an end-to-end trained block and can be easily plugged into existing networks.
  arXiv  Detail & Related papers  (2020-11-06T12:17:01Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.