← Back to all news
arXiv Machine Learning By Nikolaos Nakis, Chrysoula Kosma, Panagiotis Promponas, Michail Chatzianastasis, Giannis Nikolentzos

Aitchison Embeddings for Learning Compositional Graph Representations

Read the original on arXiv Machine Learning →

The paper introduces a compositional graph embedding framework based on Aitchison geometry, where nodes are represented as simplex-valued mixtures over latent archetypal factors. By embedding these mixtures using isometric log-ratio coordinates, the method preserves Aitchison distances while allowing unconstrained optimization in Euclidean space, yielding intrinsically interpretable embeddings. The approach achieves competitive performance on node classification and link prediction tasks and enables principled component restriction through subcompositional coherence, allowing analysis of how archetype groups influence representations and predictions.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 1

Context-Aware Interpretable Representations for Retrieval and Graph Convolutional Network Classification

The paper introduces an unsupervised framework that merges manifold learning with rank‑based interpretable graph embeddings to address the Geometric and Interpretability Gaps in visual representation learning. By first analyzing contextual information on the dataset manifold and then producing sparse, self‑explainable embeddings, the method achieves dimensionality reduction while preserving or improving performance in image retrieval and semi‑supervised Graph Convolutional Network classification. Experiments across varied datasets confirm that these context‑aware representations maintain high downstream effectiveness.

By Thiago C\'esar Castilho Almeida, Gustavo Rosseto Let\'icio, Vinicius Atsushi Sato Kawai, Daniel Carlos Guimar\~aes Pedronette
llmsragsafety
More like this →
arXiv Machine Learning
2d ago

Implicit Feature Reweighting for Label-Free Graph Generalization

SCARCE is a label‑free representation‑learning framework that improves graph‑level out‑of‑distribution generalization. It uses an environment partition of training graphs—derived from metadata or self‑supervised clustering—to warm‑start a variational graph autoencoder and then applies an adversarial confusion mechanism that prevents a discriminator from distinguishing environments while preserving reconstruction fidelity. Theoretical analysis shows that this environment confusion contracts environment‑discriminative directions, effectively reweighting features to reduce reliance on spurious correlations, and experiments on synthetic and DrugOOD datasets demonstrate state‑of‑the‑art OOD performance among label‑free methods.

By Tianjun Yao, Chen Xi, Xinyang Li, Lixian Zhong
ragbenchmarkssafety
More like this →
arXiv Machine Learning
Jul 22

One Model, Many Graphs: Learning over Attributed Graphs across Heterogeneous Modalities with Vision-Language Models

arXiv:2607. 19128v1 Announce Type: new Abstract: Vision-language models (VLMs) provide a unified representation space for textual and visual information, yet their potential as general-purpose backbones for graph-structured data remains largely unexplored.

By Jiayi Yang, Yifang Chen, Yuanfu Sun, Jiajin Liu, Qiaoyu Tan
llmsragmultimodalbenchmarks
More like this →