GLAD improves latent graph generation by quantizing discrete latent space.
problem Latent space graph generative models lack performance and make unnatural assumptions.
method Adapting diffusion bridges to a discrete latent space, avoiding data space decompositions.
result GLAD achieves competitive performance on graph benchmark datasets.
A new method to learn EBM in latent space for better data modeling.
problem Efficiently modeling data with complex structures.
method Joint learning of latent space EBM and top-down network using maximum likelihood and MCMC sampling.
result Simple EBM in latent space captures data regularities effectively and performs well in generation and anomaly detection.
New method uses Diffusion Maps for latent space modeling of dynamical systems.
problem Building reduced dynamical models from time series data.
method Two rounds of Diffusion Maps on latent coordinates, with lifting back to ambient space.
result Approximation of full state functions in reduced coordinates.
This research examines the geometry of latent spaces in push-forward generative models.
problem Tendency of deep generative models to output samples outside target distribution support.
method Geometric measure theory and truncation method to enforce simplicial cluster structure.
result Proves sufficient condition for optimality in latent space geometry.
EXoN creates an explainable latent space for semi-supervised learning.
problem Creating an explainable latent space for semi-supervised learning.
method EXoN combines VAE with SCI (Soft-label Consistency Interpolation) to create an explainable latent space.
result EXoN reduces the cost of investigating representation patterns on the latent space.
Researchers analyze and improve latent space in NAR models.
problem Latent space resolution and range issues in NAR models.
method Detailed analysis of GNN latent space structure, proposing and testing solutions.
result Improvements in majority of algorithms on CLRS-30 benchmark.
LOL-BO improves latent space Bayesian optimization over structured inputs.
problem Optimizing complex functions over high-dimensional, structured search spaces.
method Adapting trust regions from high-dimensional to structured settings, using a DAE to map inputs into a latent space.
result Achieves up to 20x improvement over state-of-the-art methods.
TALBO optimizes latent spaces for evolving design objectives.
problem Temporal drift in design objectives.
method GP-prior variational autoencoder for time-varying latent space.
result Consistently outperforms LSBO baselines across varying drift speeds and objectives.
Generative Adversarial networks (GANs) have obtained remarkable success in many unsupervised learning tasks and unarguably, clustering is an important unsupervised learning problem. While one can potentially exploit the latent-space back-projection in GANs to cluster, we demonstrate that the cluster structure is not re…
This paper explores how the latent structure affects clustering in GAN-generated data.
problem Achieving well-clustered data in GAN-generated spaces, especially with class imbalance.
method Derives conditions for faithful clustering in GANs, including multimodal latent space, latent space inversion, and cluster priors imposition.
result Necessary and sufficient conditions for clustering in GANs are identified, and their importance is demonstrated through ablative studies.
Latent representations are the essence of deep generative models and determine their usefulness and power. For latent representations to be useful as generative concept representations, their latent space must support latent space interpolation, attribute vectors and concept vectors, among other things. We investigate …
Generative models use Riemannian manifolds to improve latent space interpretation.
problem Generative models often bias latent space interpretations.
method Use Riemannian manifolds to define latent space paths that respect ambient geometry.
result Improves interpretability of learned representations for both stochastic and deterministic generators.
Deep generative networks have been widely used for learning mappings from a low-dimensional latent space to a high-dimensional data space. In many cases, data transformations are defined by linear paths in this latent space. However, the Euclidean structure of the latent space may be a poor match for the underlying lat…
Paper analyzes latent space geometry in generative models using Fisher information.
problem Understanding the structure of latent spaces in generative models.
method Reconstructs Fisher information metric from generated samples and posterior distribution.
result Reveals fractal structure and abrupt changes in Fisher metric at phase boundaries.
Deep generative models are universal tools for learning data distributions on high dimensional data spaces via a mapping to lower dimensional latent spaces. We provide a study of latent space geometries and extend and build upon previous results on Riemannian metrics. We show how a class of heuristic measures gives mor…
Ensemble decoders to capture latent space topology in deep generative models.
problem Topological mismatch between latent space geometry and data manifolds.
method Using ensembles of decoders to compute geodesics on the expected manifold.
result Ensemble approach provides a simple and reliable way to capture model uncertainty in latent space.
Stable long-term predictions for fluid flows using neural networks.
problem Predicting complex dynamics of fluid flows with high temporal stability.
method End-to-end trained neural network architecture combining CNN for spatial compression and LSTM for temporal prediction.
result Novel latent space subdivision (LSS) allows stable and controllable long-term predictions.
Proposes a multi-view VAE for imputing missing data from correlated sources.
problem Imputing missing data from multi-view sources with latent space correlation.
method Enforces a joint prior with latent space correlation between VAEs trained on each view.
result More strongly correlated latent spaces are uncovered, enabling effective imputation.
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.
We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the…
Unified framework for disentangled VAEs improves latent space interpretability.
problem Challenges in evaluating and interpreting latent representations, especially for diverse data types.
method Unified bfVAE framework, FVH-LT, DBSR-LS, GAS, LSSI.
result bfVAE provides more favorable trade-off between disentanglement and reconstruction.
Proposes a novel method for detecting novelty in multi-modal data.
problem Challenges in detecting novelty in high-dimensional, multi-modal data.
method Orthogonalized latent space for disentangling features and defining novelty score.
result Proposed method outperforms state-of-the-art algorithms in novelty detection.
Model learns cancer tissue images onto a low-dimensional space revealing tissue characteristics.
problem Improving cancer diagnosis through high-fidelity digital pathology.
method Deep generative model using PathologyGAN to map real images onto a latent space.
result Latent space encodes morphological characteristics and reveals distinct tissue clusters.
Our work improves VAE latent space clustering by enforcing invariant and equivariant learning.
problem Current VAEs fail to learn invariant and equivariant clusters in latent space.
method We use a mixture model pdf like Gaussian mixtures to enforce deep, group-invariant learning and separate semantic and equivariant variables.
result Our model effectively learns to disentangle invariant and equivariant representations, improving learning rate and image recognition.
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.
The paper develops a method to dynamically adjust VAE latent space dimensions during training.
problem Under- or overprovisioning of latent space dimensions in VAEs.
method GECO optimizer with L0-ARM gradient estimator to dynamically adjust latent space dimensions. result The latent space can be pruned effectively without violating reconstruction error constraints.
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.
This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.
problem Degenerate MCMC sampling quality hinders latent space EBM learning and generation quality.
method Introduces diffusion-based amortization for long-run MCMC sampling.
result The learned amortization of MCMC is a valid long-run MCMC sampler.
A new method for analyzing latent space models without reference configurations.
problem Posterior summaries of latent coordinates in Euclidean latent space models are not canonical due to likelihood invariance.
method Quotient-based posterior analysis using the centered Gram map.
result Intrinsic posterior summaries of mean structure and uncertainty can be computed directly from posterior samples.
Unsupervised machine learning helps design complex experiments more efficiently.
problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.
This paper shows how to estimate distances in latent space of random graphs using entropic OT.
problem Estimating distances between groups of nodes in latent space of random graphs.
method Entropic Optimal Transport (OT) with stability results for perturbations of the cost matrix.
result Consistent estimation of entropic OT distances between groups of nodes in latent space.
VAEs (Variational AutoEncoders) have proved to be powerful in the context of density modeling and have been used in a variety of contexts for creative purposes. In many settings, the data we model possesses continuous attributes that we would like to take into account at generation time. We propose in this paper GLSR-V…
In this paper we present a fully Bayesian latent variable model which exploits conditional nonlinear(in)-dependence structures to learn an efficient latent representation. The latent space is factorized to represent shared and private information from multiple views of the data. In contrast to previous approaches, we i…
Improving in-context learning for latent space Bayesian optimization by adapting pretraining on molecular latent space.
problem Improving in-context learning for latent space Bayesian optimization.
method Adapting pretraining on molecular latent space.
result Achieving strong performance on held-out molecular optimization benchmarks.
Study evaluates interpretability of time series foundation models' latent spaces.
problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.
Enhanced latent spaces improve collider simulation precision.
problem Improving the precision of collider physics simulations.
method Machine learning techniques including reweighting, pre-processing, and latent space refinement.
result Sub-percent precision across various phase spaces achieved.
GCAE uses density estimation to achieve reliable disentanglement in latent space.
problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.
A new method for disentangled latent spaces in VAEs that can manipulate attributes.
problem Disentangled representation of attributes in latent spaces of VAEs.
method Attribute-based regularization loss to enforce monotonic relationships between attributes and latent codes.
result Manipulation of attributes in latent spaces post-training.
To analyze high-dimensional and complex data in the real world, deep generative models, such as variational autoencoder (VAE) embed data in a low-dimensional space (latent space) and learn a probabilistic model in the latent space. However, they struggle to accurately reproduce the probability distribution function (PD…
Enhances image-to-image translation using adversarial latent space.
problem Image-to-image translation task in computer vision.
method Introduces an adversarial discriminator on the latent representation to enforce similar latent space distributions.
result Significantly outperforms competing approaches on MNIST and USPS domain adaptation tasks.
Bayesian Attention Networks compress data by focusing on key training samples.
problem Lossless data compression for efficiency.
method Bayesian Attention Networks with attention factors and latent space.
result Efficient prediction using a few correlated training samples.
Spectral clustering with edge counting detects communities in sparse models.
problem Detecting communities in sparse latent space models.
method Spectral clustering followed by edge counting.
result Algorithm achieves consistency and optimality for a broad class of models.
This study rethinks the latent space in generative modeling, improving performance with less complex models.
problem Determining the optimal latent space for generative models and understanding its impact on model complexity.
method Proposed a new distance metric between latent and data distributions, and a two-stage training strategy called Decoupled Autoencoder (DAE).
result Improves generative performance with less complex models, as shown by comprehensive experiments on various models.
A new method learns latent space normalizing flow for approximate inference in generator models.
problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.
Geometric approach finds correspondences between different conditions.
problem Integrating multiple biological datasets.
method Fibered latent space with pull-back metric, diffeomorphism flows.
result Minimizing energy functional yields diffeomorphism flows.
Proposes a geometry-aware VAE for better latent space modeling.
problem Lack of meaningful latent space structure in VAEs for small datasets.
method Introduces a Riemannian Hamiltonian VAE with a learned metric.
result Improves latent space structure leading to better interpolations and data generation.
A new autoencoder method uses empirical beta copulas for generating data.
problem Creating a generative model from an autoencoder's latent space.
method Empirical Beta Copula Autoencoder method.
result The Empirical Beta Copula Autoencoder outperforms other methods in simplicity and effectiveness.
LSDM uses unpaired data to match latent space distributions for generative modeling.
problem Generating high-quality images with limited paired data.
method Two-stage approach: latent space learning from paired and unpaired data, followed by joint distribution matching.
result LSDM enhances geometric fidelity in generated outputs and provides theoretical insights into LDMs.