arXiv Machine Learning

Bayesian Matrix-Valued Graphs for Context-Dependent Multivariate Relationships

The paper introduces Bayesian matrix-valued graphs (BMVG), where each edge is represented by a symmetric positive-definite matrix instead of a scalar weight, allowing the capture of direction-dependent interactions in scientific graphs. Using the affine-invariant Riemannian metric, BMVG quantifies deformation magnitude and signed directions of edge changes across contexts, and demonstrates competitive performance against existing methods in precision recovery and structural change detection. Experiments on weather data and TCGA-BRCA gene networks show that BMVG can reveal context-dependent reconfigurations in spatial coupling and gene-module interactions.

arXiv Machine Learning
Jul 24

HierarchicalDAEW: Domain-Aware Edge-Weighted Graph Convolution with Evidential Uncertainty for Multi-Section Spatial Gene Expression Prediction from H&E Histology

arXiv:2607. 20896v1 Announce Type: new Abstract: Spatial transcriptomics assays remain costly and technically demanding, restricting transcriptome-wide profiling to specialist settings and preventing routine clinical deployment.

By Kritanu Chattopadhyay, Soumya Chatterjee, Ondrej Krejcar, Debotosh Bhattacharjee
arXiv Machine Learning
5d ago

Moment-guided edge sampling

The paper introduces a moment-guided edge sampling framework that quantifies how local edge edits affect global graph structure using spectral moments of the random-walk transition matrix. Two complementary methods— a combinatorial closed‑form update for low‑order moments and a low‑rank approach exploiting locality and cyclic trace invariance— enable efficient computation of moment changes for single or batched edits. These moment changes serve as interpretable structural signatures, and preserving them is shown to retain key graph properties such as triangle‑weighted clustering, while also improving performance in supervised node classification and graph contrastive learning.

By Weibin Cai, Reza Zafarani
arXiv Machine Learning
Aug 28

Gromov-Monge Flow Matching for Equivariant Graph Generation

The paper introduces Gromov-Monge Flow Matching, a method that incorporates permutation-equivariance into generative graph models by aligning graph pairs up to node relabeling using the Gromov–Monge distance. It shows theoretically that quotient couplings can be lifted to aligned representatives without extra cost and that symmetrization yields equivariant flow-matching minimizers, even for categorical endpoints. Practically, the authors build minibatch couplings with Gromov–Wasserstein relaxations and optional outer assignments, improving sample quality in continuous graph and categorical molecular generation while remaining compatible with standard equivariant architectures.

By Moritz Piening, Christian Wald
arXiv Machine Learning
Jul 27

Local-Global Geometric Insights for Graph Neural Networks via Entropic Curvature

arXiv:2607. 22381v1 Announce Type: new Abstract: Curvature notions on graphs, particularly Ollivier-Ricci and Forman, have emerged as powerful tools for addressing fundamental issues in Graph Neural Networks (GNNs) such as oversmoothing and oversquashing, but rely almost exclusively on local edge-level comparisons and therefore fail to certify how information actually propagates over long distances.

By Rachid Caich, Yassine Abbahaddou
arXiv Machine Learning
Aug 18

A Unified Geometric Framework for Developmental Analysis of Spatial Transcriptomic Data

arXiv:2608. 15306v1 Announce Type: cross Abstract: High-throughput single-cell and spatial transcriptomic technologies provide high-resolution snapshots of heterogeneous cellular states, but their destructive nature prevents repeated measurements of the same cells over time.

By Mary Chriselda Antony Oliver, Kaitlyn Hohmeier, Tuyen Tran, Alejandra Castillo, Caroline Moosm\"uller, Shiying Li