arXiv research

The paper predicts responses on out-of-sample nodes using latent positions on unknown curves.

Study on predicting graph labels at nodes using local averaging and distance estimation.

Two types of nonidentifiability in latent position graphs identified and characterized.

We model messaging activities as a hierarchical doubly stochastic point process with three main levels, and develop an iterative algorithm for inferring actors' relative latent positions from a stream of messaging activity data. Each of the message-exchanging actors is modeled as a process in a latent space. The actors…

IDPGs extend RDPGs with a Poisson process for random latent positions.

New method recovers graph latent positions under edge differential privacy.

We consider the problem of vertex classification for graphs constructed from the latent position model. It was shown previously that the approach of embedding the graphs into some Euclidean space followed by classification in that space can yields a universally consistent vertex classifier. However, a major technical d…

A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space models provide a natural statistical framework for graph visualizing and clustering. A latent space model of particular interest is the Rando…

Estimates latent positions in 1D torus from noisy pairwise affinities.

Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow interpretation of those vector representations as latent position estimates. The general…

A new approach to protein language models combines latent space prediction with masked language modeling.

SLIM model predicts social network polarization using signed links.

NP-PROV separates mean and variance spaces to improve function uncertainty.

New method uses manifold learning to infer latent positions of 1D submanifolds in random dot product graphs.

Modeling continuous movement of entities in latent space for interaction timing.

New MCMC methods improve efficiency for large network inference.

We address tracking and prediction of multiple moving objects in visual data streams as inference and sampling in a disentangled latent state-space model. By encoding objects separately and including explicit position information in the latent state space, we perform tracking via amortized variational Bayesian inferenc…

Tests if vertices in graphs have the same latent positions.

DDMI generates high-quality INRs by adapting positional embeddings.

A new model clusters networks with community-specific submanifold structures.

Study shows peers' graduation improves residents' success in TCs.

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the …

New model captures state-dependent variability in partially observed systems.

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology outlined in \citet{sussman2012universally} to construct consistent estimates for the …

Hierarchical parametric models consisting of observable and latent variables are widely used for unsupervised learning tasks. For example, a mixture model is a representative hierarchical model for clustering. From the statistical point of view, the models can be regular or singular due to the distribution of data. In …

Extends random dot product graph model to handle multiple graphs.

In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link function $κ$, provided that the latent positions are i.i.d. from some distribution F. We then consider the exploitation task of vertex classi…

Study the averaging estimator on graphs with labeled nodes.

Most existing word embedding methods can be categorized into Neural Embedding Models and Matrix Factorization (MF)-based methods. However some models are opaque to probabilistic interpretation, and MF-based methods, typically solved using Singular Value Decomposition (SVD), may incur loss of corpus information. In addi…

We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome. Motivated by a thorough exploratory data analysis of the network via Gaussian mixture modeling (GMM) in the adjacency spectral embedding (ASE) representation space, we introduce the latent structure model (LSM) for n…

Paper shows graphs can be embedded in lower dimensions than expected.

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…

Multitask learning algorithms are typically designed assuming some fixed, a priori known latent structure shared by all the tasks. However, it is usually unclear what type of latent task structure is the most appropriate for a given multitask learning problem. Ideally, the "right" latent task structure should be learne…

Novel method learns time series dynamics without reconstruction.

FisherNet extends Autoencoder using Fisher information for better data reconstruction.

We present Ordinary Differential Equation Variational Auto-Encoder (ODE$^2$VAE), a latent second order ODE model for high-dimensional sequential data. Leveraging the advances in deep generative models, ODE$^2$VAE can simultaneously learn the embedding of high dimensional trajectories and infer arbitrarily complex conti…

Diverse and accurate vision+language modeling is an important goal to retain creative freedom and maintain user engagement. However, adequately capturing the intricacies of diversity in language models is challenging. Recent works commonly resort to latent variable models augmented with more or less supervision from ob…

The paper proposes a test to determine the number of latent classes in ordinal categorical data.

Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent positions of nodes of the network. The connection probabilities between the node…

We propose a probabilistic framework for modelling and exploring the latent structure of relational data. Given feature information for the nodes in a network, the scalable deep generative relational model (SDREM) builds a deep network architecture that can approximate potential nonlinear mappings between nodes' featur…

Variational autoencoders often collapse, showing latent variables are non-identifiable.

Paper tackles reinforcement learning with complex observations and simple latent dynamics.

Perfect clustering achieved in hypergraphs with enough interactions.

Discovering statistical structure from links is a fundamental problem in the analysis of social networks. Choosing a misspecified model, or equivalently, an incorrect inference algorithm will result in an invalid analysis or even falsely uncover patterns that are in fact artifacts of the model. This work focuses on uni…

New model for multiplex networks learns shared structure.

Proposes a method to use generators as EBM foundations without latent inference.

Proposes CLSM for better subsequence generation in music sequences.

The paper extends RDPG model to handle weighted graphs, enabling better analysis of network data.