A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New method uses manifold learning to infer latent positions of 1D submanifolds in random dot product graphs.
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…
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…
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…
Two types of nonidentifiability in latent position graphs identified and characterized.
New MCMC methods improve efficiency for large network inference.
New method recovers graph latent positions under edge differential privacy.
Optimizes variational inference for dynamic network models.
Link prediction is a fundamental task in statistical network analysis. Recent advances have been made on learning flexible nonparametric Bayesian latent feature models for link prediction. In this paper, we present a max-margin learning method for such nonparametric latent feature relational models. Our approach attemp…
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…
Variational autoencoders often collapse, showing latent variables are non-identifiable.
DM framework improves robustness and efficiency in latent-mixture models.
Novel method learns time series dynamics without reconstruction.
Traditional model-based RL relies on hand-specified or learned models of transition dynamics of the environment. These methods are sample efficient and facilitate learning in the real world but fail to generalize to subtle variations in the underlying dynamics, e.g., due to differences in mass, friction, or actuators a…
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…
Proposes a method to use generators as EBM foundations without latent inference.
Extends random dot product graph model to handle multiple graphs.
A plethora of networks is being collected in a growing number of fields, including disease transmission, international relations, social interactions, and others. As data streams continue to grow, the complexity associated with these highly multidimensional connectivity data presents novel challenges. In this paper, we…
I-BBS identifies latent sub-manifolds from distance matrices, robust to noise.
Study shows peers' graduation improves residents' success in TCs.
Develops a dynamic latent-factor model for high-dimensional asset characteristics.
We study parameter inference in large-scale latent variable models. We first propose an unified treatment of online inference for latent variable models from a non-canonical exponential family, and draw explicit links between several previously proposed frequentist or Bayesian methods. We then propose a novel inference…
The paper predicts responses on out-of-sample nodes using latent positions on unknown curves.
We build upon probabilistic models for Boolean Matrix and Boolean Tensor factorisation that have recently been shown to solve these problems with unprecedented accuracy and to enable posterior inference to scale to Billions of observation. Here, we lift the restriction of a pre-specified number of latent dimensions by …
New method identifies causes in time series with latent variables.
In this letter we borrow from the inference techniques developed for unbounded state-cardinality (nonparametric) variants of the HMM and use them to develop a tuning-parameter free, black-box inference procedure for Explicit-state-duration hidden Markov models (EDHMM). EDHMMs are HMMs that have latent states consisting…
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…
Perfect clustering achieved in hypergraphs with enough interactions.
We present Ordinary Differential Equation Variational Auto-Encoder (ODEVAE), a latent second order ODE model for high-dimensional sequential data. Leveraging the advances in deep generative models, ODEVAE can simultaneously learn the embedding of high dimensional trajectories and infer arbitrarily complex conti…
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…
DDVI uses diffusion models for variational inference, improving latent variable model performance.
cvHM framework speeds up GP inference for neural spike train analysis.
Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures where all correlations between observed quantities are solely due to the influenc…
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…
Scientists develop a model to identify treatment responders from non-responders.
Paper improves variational inference for complex models.
A new method for efficient inference in sequential latent-variable models.
AMES framework selects optimal embedding space for latent graph inference.
A new method learns latent space normalizing flow for approximate inference in generator models.
New method quantifies deep kNN anomaly detection significance.
We analyze the necessary and sufficient conditions for exact inference of a latent model. In latent models, each entity is associated with a latent variable following some probability distribution. The challenging question we try to solve is: can we perform exact inference without observing the latent variables, even w…
Latent DiTs improve data distribution recovery and inference efficiency under low-dimensional latent space.
Prediction and interpolation for long-range video data involves the complex task of modeling motion trajectories for each visible object, occlusions and dis-occlusions, as well as appearance changes due to viewpoint and lighting. Optical flow based techniques generalize but are suitable only for short temporal ranges. …
The paper proposes a test to determine the number of latent classes in ordinal categorical data.
A novel circuit motif uses sister cells for inference with correlated priors.
Temporal Point Processes (TPP) with partial likelihoods involving a latent structure often entail an intractable marginalization, thus making inference hard. We propose a novel approach to Maximum Likelihood Estimation (MLE) involving approximate inference over the latent variables by minimizing a tight upper bound on …
Proposes CLSM for better subsequence generation in music sequences.
Efficiently infers latent SDEs with scalable memory and time costs.