arXiv Statistics ML
Structured Learning on Mapper Representations
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
4d ago
TopoEmbedX: A General Framework for Representation Learning on Topological Domains
arXiv:2609.37884v1 Announce Type: new Abstract: Topological structures such as simplicial complexes, hypergraphs, and cell complexes extend standard graph models by modeling higher-order relationship...
arXiv Machine Learning
Jul 23
Geometry-Guided Generative Representation for Functional Brain Graphs
arXiv:2511. 04539v2 Announce Type: replace-cross Abstract: In network neuroscience, functional brain systems are often characterized using separate yet related graph-theoretic or spectral descriptors, overlooking how these properties covary and partially overlap across individuals and conditions.
arXiv Machine Learning
Sep 10
Connectome-to-Function: Conditional Generative Latent Representations for Reservoir Computing
arXiv:2609.06093v1 Announce Type: new Abstract: Connectomes, graph-level maps of neurons and their synaptic connections, provide a structural basis for understanding how brain circuits support functi...
arXiv Machine Learning
Sep 10
Topology-induced Operators Reveal Complementary Graph Representations without Training
arXiv:2609.08152v1 Announce Type: new Abstract: Graph representation learning has largely focused on designing increasingly sophisticated models to transform graph topology into vector representation...
arXiv Machine Learning
Jun 11
From Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features
arXiv:2606. 11911v1 Announce Type: cross Abstract: Persistence diagrams are common representations in topological data analysis, but they do not naturally live in a vector space, and the statistical tools developed for comparing them have largely evolved separately from those used for downstream prediction.
Hugging Face Trending Papers
Sep 8
Topology-induced Operators Reveal Complementary Graph Representations without Training
The paper demonstrates that high‑quality graph embeddings can be produced without complex models or training by propagating random features through topological structures derived from random walks and anonymous walks. These training‑free embeddings capture node proximity and structural roles, respectively, and perform competitively on node, edge, and graph tasks while often requiring less computation. Combining the two embedding types further improves inference quality for some tasks.