arXiv Machine Learning By Tal Weissblat

Learning Subgroup Relations Using Siamese Graph Neural Networks

Read the original on arXiv Machine Learning →

arXiv:2607. 11140v1 Announce Type: new Abstract: Determining whether one finite group is isomorphic to a subgroup of another is a fundamental problem in computational group theory.

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.

arXiv Machine Learning
Jul 15

Learning the Graphical Nature of Symmetries

arXiv:2607. 12026v1 Announce Type: cross Abstract: Finite groups are rigid algebraic objects, whose Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.

By Rashid Barket, Enrico Grimaldi, Yacoub Hendi, Edward Hirst, Adam Onus, Harmeet Singh
arXiv Machine Learning
Aug 28

Aitchison Embeddings for Learning Compositional Graph Representations

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.

By Nikolaos Nakis, Chrysoula Kosma, Panagiotis Promponas, Michail Chatzianastasis, Giannis Nikolentzos