Estimates distances between latent points in random geometric graphs.
problem Estimating distances between latent points in random geometric graphs.
method Spectral estimator of pairwise distances.
result Rate of convergence is the same as nonparametric estimation on the sphere, up to a logarithmic factor.
Graph neural network constructs a sparse latent point cloud from dense point clouds.
problem Efficiently reconstructing and simulating point clouds with fine details.
method Irregular graph convolutional neural network with non-isotropic operations.
result The model can reconstruct dense point clouds from a sparse latent representation.
LION generates high-quality 3D shapes using hierarchical latent diffusion models.
problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.
New method infers and samples point processes from latent diffusion.
problem Modeling point processes with latent diffusion.
method Itô's excursion theory for inference and sampling.
result Proposes a new method to infer and sample point processes.
A new growth model for dynamic networks using Markovian latent points.
problem Modeling temporal dynamic networks with latent points and distances.
method Markovian latent space dynamic with Euclidean Sphere sampling and connection probabilities based on geodesic distances.
result Theoretical guarantees for non-parametric estimation of the latitude and envelope functions.
Improves change-point detection for high-dimensional time-series.
problem Uncertainty in latent variable estimation affects change-point detection.
method Proposes multinomial sampling to improve detection rate and reduce delay.
result Results outperform baseline method in experiments.
New method for LVEBMs using saddle-point optimization and Langevin updates.
problem Expressive generative modeling of latent variables with hidden structure.
method Reformulate LVEBM training as a saddle problem, using Langevin updates and gradient flows.
result Proves existence and convergence of the algorithm under standard assumptions, with improved ELBO bounds.
We simplify inference for TPP models with latent structures.
problem Intractable marginalization in TPP models with latent structures.
method Approximate inference over latent variables using a tight upper bound on the approximation gap.
result Improved results for models like Survival Analysis.
EM algorithm converges to global max in latent Gaussian tree models.
problem Optimizing log-likelihood in latent Gaussian tree models.
method Analyzed the optimization landscape and convergence of EM algorithm.
result EM algorithm converges to global maximum in latent Gaussian tree models.
Model learns latent dynamics of complex systems with closed transformation paths.
problem Euclidean latent space does not match data structure.
method Incorporates manifold model into autoencoder latent space.
result Generates transformation paths and classifies samples on same path.
We improve autoencoder image interpolation by shaping latent space.
problem Incongruities in autoencoder interpolation leading to artifacts or unrealistic results.
method Propose a regularization technique to shape latent space to follow a smooth, locally convex manifold consistent with training images.
result Faithful interpolation between data points achieved.
A scalable GPVAE method using local adjacencies to approximate GP inference.
problem Scalability issues in exact GP inference for large-scale GPVAEs.
method Neighbour-driven approximation strategy that confines computations to nearest neighbours.
result Outperforms other GPVAE variants in predictive performance and computational efficiency.
A new method for efficient inference in sequential latent-variable models.
problem Computational challenges in integrating subject-specific random effects.
method Anchored variational inference framework to approximate posterior distributions.
result The method achieves accurate estimation with significant computational gains.
Variational autoencoder models dynamic latent graphs for neural point processes.
problem Modeling event dynamics with changing trends over time.
method Sequential latent variable model with dynamic latent graphs.
result Higher accuracy in predicting inter-event times and event types.
A new model predicts network events with improved accuracy and interpretability.
problem Predicting and understanding complex dynamic relational data in networks.
method Mutually Exciting Latent Space Hawkes (LSH) model for continuous-time networks.
result The LSH model outperforms existing models in prediction accuracy and interpretability.
Using the linear Gaussian latent variable model as a starting point we relax some of the constraints it imposes by deriving a nonparametric latent feature Gaussian variable model. This model introduces additional discrete latent variables to the original structure. The Bayesian nonparametric nature of this new model al…
New method detects changes in complex models using hierarchical latent-class models.
problem Detecting abrupt transitions in high-dimensional or heterogeneous models.
method Hierarchical latent-class model with CRP and EM algorithm for continual learning.
result The method reliably infers the number of latent classes and performs CPD.
Novel approach detects early warning indicators in complex systems.
problem Detecting abrupt transitions in complex systems.
method Directed anisotropic diffusion map and latent stochastic dynamical systems.
result Early warning indicators can detect tipping points in state transitions.
In this paper we show that a large class of Latent variable models, such as Mixed Membership Stochastic Block(MMSB) Models, Topic Models, and Adversarial Clustering, can be unified through a geometric perspective, replacing model specific assumptions and algorithms for individual models. The geometric perspective leads…
Algorithm learns latent simplex from perturbed points in input-sparsity time.
problem Learning a latent k-vertex simplex from noisy data. method Input-sparsity time algorithm using low-rank approximation and adaptive selection.
result Algorithm achieves O(extrmnnz(A)) time complexity, avoiding k⋅extrmnnz(A). Latent variable models (LVMs) learn probabilistic models of data manifolds lying in an \emph{ambient} Euclidean space. In a number of applications, a priori known spatial constraints can shrink the ambient space into a considerably smaller manifold. Additionally, in these applications the Euclidean geometry might induc…
Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.
problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks
New model captures patient-level EHR data efficiently.
problem Irregular EHR code timing and lack of temporal structure.
method Latent factor point process model with Fourier-Eigen embedding.
result Efficiently captures subgroup-specific temporal patterns.
IDPGs extend RDPGs with a Poisson process for random latent positions.
problem Modeling randomness in latent positions for graph structure.
method Introduce IDPGs using Poisson point processes on latent Euclidean space.
result Continuous analogues of adjacency matrices link latent structure to observed graphs.
Generative Kernel PCA explores latent spaces for data interpretation and novelty detection.
problem Exploring latent spaces of datasets for better data interpretation.
method Generative Kernel PCA using hidden and visible units similar to Restricted Boltzmann Machines.
result Gradually moving in the latent space allows for interpretation of components and detection of novel patterns.
This paper introduces a new clustering technique, called {\em dimensional clustering}, which clusters each data point by its latent {\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point. Pointwise dimension is invariant under a broad class of transformations. As a resul…
A new method clusters intersecting lines using hypergraphs.
problem Clustering intersecting lines in subspace clustering.
method Constructing a geometric hypergraph and using spectral algorithm.
result Achieves information-theoretic bounds for line clustering.
A new Latent Diffusion Model generates realistic reservoir facies.
problem Creating accurate reservoir facies from limited measurements.
method Proposes a Latent Diffusion Model for conditional facies generation.
result Significantly outperforms GAN-based alternatives in fidelity and realism.
Improved VAEs learn flat latent spaces for better data similarity.
problem Measuring data similarity in latent spaces using Euclidean metric.
method Extend VAEs to learn flat latent manifolds using Riemannian geometry and regularisation.
result Improved performance on video-tracking benchmarks, nears supervised methods.
Hybrid model combines continuous and tractable probabilistic models.
problem Intractable probabilistic inference in continuous latent-space models.
method Continuous mixtures of tractable probabilistic models with finite integration points.
result Hybrid models achieve state-of-the-art performance in density estimation.
The paper introduces a method to probabilistically select inducing points in sparse Gaussian processes.
problem The challenge is selecting the optimal number of inducing points in sparse Gaussian processes.
method A point process prior is applied to the inducing points, and the posterior is approximated using stochastic variational inference.
result The model learns which and how many inducing points to use, leading to fewer inducing points being preferred as they become less informative.
Deep generative architectures provide a way to model not only images but also complex, 3-dimensional objects, such as point clouds. In this work, we present a novel method to obtain meaningful representations of 3D shapes that can be used for challenging tasks including 3D points generation, reconstruction, compression…
There has been much recent, exciting work on combining the complementary strengths of latent variable models and deep learning. Latent variable modeling makes it easy to explicitly specify model constraints through conditional independence properties, while deep learning makes it possible to parameterize these conditio…
A new model for point processes without intensity function trade-offs.
problem Inefficiency and trade-offs in existing point process models.
method Point Set Diffusion, a diffusion-based latent variable model.
result Achieves state-of-the-art performance in point process generation.
CEBMs learn flexible latent mappings from data.
problem Learning flexible latent mappings from data.
method CEBMs decompose joint density into tractable posterior over latent variables.
result CEBMs achieve competitive results in image modeling and latent space predictive power.
New framework assesses value of labeled vs unlabeled data in latent variable models.
problem Determining the optimal use of labeled and unlabeled data in latent variable models.
method Developed a bias-variance decomposition of the generalization error for method-of-moments latent variable estimation, and introduced a correction for misspecification.
result Labeled data is more valuable than unlabeled data when models are misspecified, but this value can be reduced with correction.
MEG models for dynamic networks estimate dependencies and shared latent space relationships.
problem Modeling dynamic networks with shared latent space relationships and dependencies.
method MEG combines mutually exciting point processes and latent space models to estimate node-specific parameters and unobserved edges.
result MEG models can estimate intensities for unobserved edges, useful for anomaly detection in real-world applications.
Neural Diffusion Intensity Models simplify Cox processes inference.
problem Intractable nonparametric estimation and posterior inference of latent stochastic intensity in Cox processes.
method Variational framework using neural SDEs, with theoretical guarantee of ELBO maximization coinciding with maximum likelihood estimation.
result Accurate recovery of latent intensity dynamics and posterior paths with significant speedup.
Improved method for efficient black-box optimization in latent space.
problem Efficiently optimize expensive black-box functions over complex input spaces.
method Optimize in latent space of deep generative models, retrain model periodically and weight data points.
result Significantly improved efficiency and performance on synthetic and real-world problems.
New test for point processes without strong model assumptions.
problem Testing local independence in point processes without strong model assumptions.
method Expansion similar to Volterra expansions to represent marginalized intensities.
result Approximation of true marginalized intensity arbitrarily well.
New particle algorithms optimize latent variable models.
problem Optimizing latent variable models for maximum likelihood estimation.
method Identify gradient flows associated with free energy functional and discretize them to create particle-based algorithms.
result Novel particle algorithms scale to high-dimensional settings and perform well in experiments.
NP-PROV separates mean and variance spaces to improve function uncertainty.
problem Neural Processes fail on out-of-domain tasks due to shared latent space uncertainty.
method Separates mean and variance into function-value-related and position-related latent spaces.
result NP-PROV achieves state-of-the-art likelihood with bounded variance in drifts.
Enforcing distributions of latent variables in neural networks is an active subject. It is vital in all kinds of generative models, where we want to be able to interpolate between points in the latent space, or sample from it. Modern generative AutoEncoders (AE) like WAE, SWAE, CWAE add a regularizer to the standard (d…
Study shows latent space OOD detection isn't a reliable proxy for model performance.
problem Evaluating and interpreting deep learning systems on real-world data.
method Empirical investigation of latent space OOD detection and classification accuracy using SAR datasets.
result OOD detection cannot be used as a proxy measure for model performance.
Flexible model tackles high-dimensional, missing data, and stochastic processes.
problem High-dimensional longitudinal data with structured missingness and unknown measurement time points.
method Latent variable model using Gaussian processes and variational autoencoder.
result Competitive performance on simulated and real datasets.
We present a new family of exchangeable stochastic processes, the Functional Neural Processes (FNPs). FNPs model distributions over functions by learning a graph of dependencies on top of latent representations of the points in the given dataset. In doing so, they define a Bayesian model without explicitly positing a p…
Improves GANs by sampling meaningful points from latent manifold.
problem Lack of semantic information in GANs' prior distribution.
method Local Coordinate Coding (LCC) for sampling and improved generator approximation.
result Improves GANs' performance in generating realistic data.
NSFs learn SDE transition laws for efficient sampling.
problem Efficiently sampling between arbitrary time points in SDEs.
method Conditional normalising flows with architectural constraints.
result Up to two orders of magnitude speed-ups at large time gaps.