arXiv Machine Learning
Universal Sample-Based Embeddings of Higher-Order Objects
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 7
Compositional Generalization Requires Linear, Orthogonal Representations in Vision Embedding Models
arXiv:2602. 24264v2 Announce Type: replace-cross Abstract: Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems.
arXiv AI
Jun 2
On the Theoretical Limitations of Embedding-based Link Prediction
arXiv:2506. 22271v3 Announce Type: replace Abstract: Neural networks often map low-dimensional embeddings to high-dimensional output spaces.
arXiv Machine Learning
Jun 2
Efficient Synthetic Network Generation via Latent Embedding Reconstruction
arXiv:2606. 00934v1 Announce Type: cross Abstract: Network data are ubiquitous across the social sciences, biology, and information systems.
arXiv Machine Learning
3d 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.
arXiv Machine Learning
Jul 14
Distance-Preserving Embeddings in Inhomogeneous Random Graphs
arXiv:2607. 10074v1 Announce Type: new Abstract: Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations.
arXiv Machine Learning
Oct 3
Higher-Order Positional Encodings for Graph Representation Learning
The paper introduces higher-order positional encodings that enrich graph representations by incorporating topological information from lifted incidence structures, without altering existing graph learning backbones. It theoretically shows that these encodings can mix graph Laplacian frequencies beyond what scalar spectral filters achieve, and demonstrates their effectiveness on Graph Transformers for datasets like ZINC and synthetic benchmarks. The approach bridges graph positional encodings and topological deep learning, enabling standard models to exploit higher-order interactions.