mlsanityData to 14 Oct 2026

Universal Sample-Based Embeddings of Higher-Order Objects

arXiv 2610.19899 ↗First posted 14 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Neural networks operate naturally on finite-dimensional vectors, yet many problems require reasoning about higher-order objects such as distributions, functions, and graphs. Such objects capture relationships within a ground set and rarely admit an explicit compact representation. Moreover, we typically want a compact representation not of a single higher-order object but of an entire family of such objects, including members unseen during training. While a few approaches exist for particular object types, none is designed to work across object types. We propose a unified framework that represents any higher-order object as a fixed-size embedding vector learned over a family of such objects. An encoder maps an object, seen only through a finite set of samples, to an embedding, and a domain-specific decoder supplies the training signal by modeling the object conditioned on that embedding. Since the encoder works only from samples, one architecture serves different object types. Because the decoder is a model already suited to single instances of the object type, the framework inherits that model's native operations and inductive biases. We instantiate the framework on distributions, functions, and graphs. In each case we show that a single trained model represents an entire family and generalizes to members unseen during training. Furthermore, we demonstrate the downstream utility of these embeddings: interpolating distributions in embedding space, solving differential equations in embedding space, and predicting unseen edges from a graph's embedding.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 14 Oct 2026.

Builds on

23 of 33 references.

References · 23

  1. 2017Inductive Representation Learning on Large Graphscited by 6,320
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
  4. 2016Density estimation using Real NVPcited by 2,042
  5. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
  6. 2017Deep Setscited by 1,421
  7. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  8. 2019Neural Spline Flowscited by 596
  9. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 520
  10. 2022Fourier Neural Operator with Learned Deformations for PDEs on General Geometriescited by 427
  11. 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 413
  12. 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 383
11 more
  1. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 364
  2. 2024Discrete Flow Matchingcited by 317
  3. 2018Neural Processescited by 311
  4. 2022On Neural Differential Equationscited by 268
  5. 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 262
  6. 2017graph2vec: Learning Distributed Representations of Graphscited by 230
  7. 2016Towards a Neural Statisticiancited by 121
  8. 2019Latent Normalizing Flows for Discrete Sequencescited by 67
  9. 2024Zero-Shot Reinforcement Learning via Function Encoderscited by 18
  10. 2023Proper Laplacian Representation Learningcited by 11
  11. 2025Function Encoders: A Principled Approach to Transfer Learning in Hilbert Spacescited by 10

Built on by

Not cited yet.