In this paper we study generative modeling via autoencoders while using the elegant geometric properties of the optimal transport (OT) problem and the Wasserstein distances. We introduce Sliced-Wasserstein Autoencoders (SWAE), which are generative models that enable one to shape the distribution of the latent space int…
On-device research index
arXiv research
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “Wasserstein Autoencoder”
A new method for conditional sampling using paired Wasserstein Autoencoders.
problem Conditional sampling from complex data distributions.
method Derive a novel loss function for Wasserstein Autoencoders to enable sampling from OT-type couplings.
result Learned cost-optimal transport maps and conditional sampling from an OT-type coupling.
This paper introduces Wasserstein variational inference, a new form of approximate Bayesian inference based on optimal transport theory. Wasserstein variational inference uses a new family of divergences that includes both f-divergences and the Wasserstein distance as special cases. The gradients of the Wasserstein var…
New autoencoder improves latent space learning by optimizing sliced Gromov-Wasserstein discrepancies.
problem Improving inner discrepancy between prior and posterior distributions in autoencoders.
method Proposed spherical sliced fused Gromov Wasserstein (SSFG) and variants (MSSFG, PSSFG) to find important directions.
result New autoencoders achieve favorable performance in latent manifold learning, image generation, and reconstruction.
Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.
problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.
A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable latent prior. This regularization penalizes the fused Gromov-Wasserstein (FGW) distance between the la…
Improves latent space structure for better data representation.
problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.
Statistical Regeneration Guarantees of the Wasserstein Autoencoder with Latent Space Consistencystat.ML
This paper provides statistical guarantees for WAE's latent space regeneration.
problem Lack of statistical analysis for Autoencoders, especially WAE.
method Utilizes Vapnik Chervonenkis (VC) theory and Optimal Transport of measures under the Wasserstein metric.
result WAE achieves the target distribution in the latent space and regenerates the input distribution.
Wasserstein Autoencoders improve model efficiency and interpretability for low-dimensional data.
problem Limited statistical guarantees for WAEs in low-dimensional data.
method Proper network architecture selection and analysis of expected excess risk convergence rates.
result WAEs can learn data distributions efficiently when intrinsic dimension is considered.
This work presents a reformulation of the recently proposed Wasserstein autoencoder framework on a non-Euclidean manifold, the Poincaré ball model of the hyperbolic space. By assuming the latent space to be hyperbolic, we can use its intrinsic hierarchy to impose structure on the learned latent space representations. W…
Unsupervised learning of disentangled representations involves uncovering of different factors of variations that contribute to the data generation process. Total correlation penalization has been a key component in recent methods towards disentanglement. However, Kullback-Leibler (KL) divergence-based total correlatio…
Paper proposes a new method for predicting drug interactions using adversarial autoencoders.
problem Predicting drug interactions to prevent adverse events.
method Introduces adversarial autoencoders based on Wasserstein distances and Gumbel-Softmax relaxation to generate high-quality negative samples.
result Significant improvements in link prediction and DDI classification tasks.
This work proposes a new method to train models with deep latent hierarchies using Optimal Transport.
problem Training models with deep latent hierarchies using VAEs often leads to the 'latent variable collapse' issue.
method Proposes a novel approach based on Optimal Transport to train models with deep latent hierarchies.
result The method avoids the 'latent variable collapse' issue and provides better sample generations and latent representation.
Autoencoding topologystat.ML
The problem of learning a manifold structure on a dataset is framed in terms of a generative model, to which we use ideas behind autoencoders (namely adversarial/Wasserstein autoencoders) to fit deep neural networks. From a machine learning perspective, the resulting structure, an atlas of a manifold, may be viewed as …
WAEs offer a statistical understanding of density estimation and error bounds.
problem Concurrent density estimation with neural network-induced transformations.
method Statistical analysis of WAEs focusing on upper bounds and error propagation.
result Established deterministic upper bounds on WAE errors and explored their resilience.
Novel method for model selection in Bayesian autoencoders.
problem Model selection for Bayesian autoencoders.
method Prior hyper-parameter optimization using distributional sliced-Wasserstein distance.
result State-of-the-art results in small-data regimes.
Robust VAE detects anomalies in corrupted data.
problem Detect anomalies in data with high corruption.
method Robust Variational Autoencoder (VAE) with four modifications.
result Establishes robustness to outliers and suitability to low-rank modeling.
Graphon autoencoder generates graphs with arbitrary sizes using Chebyshev filters.
problem Generating graphs with arbitrary sizes and arbitrary structures.
method Induces graphons from observed graphs, uses Chebyshev filters for latent representation, and learns encoder and decoder to minimize Wasserstein distance.
result Graphon autoencoder provides a new paradigm for graph generation with good generalizability and transferability.
CLWF improves time series imputation speed and accuracy.
problem Slow convergence in diffusion model-based imputation methods.
method CLWF uses Lagrangian mechanics to learn velocity and integrates a denoising autoencoder to estimate gradient.
result CLWF outperforms state-of-the-art imputation approaches.
This work provides statistical guarantees for VAEs using PAC-Bayesian theory.
problem Theoretical properties of VAEs remain open questions.
method PAC-Bayesian theory to derive statistical guarantees.
result Upper bounds on Wasserstein distance between input and generative model.
Proposes MFSWB for marginal fairness in SWB, improving efficiency and performance.
problem Achieving marginal fairness in SWB averaging.
method Defining MFSWB as a constrained SWB problem, proposing two surrogate problems and a new slicing distribution.
result Surrogate MFSWB problems effectively minimize distances to marginals and encourage marginal fairness.
Enhances generative models stability and accuracy with BNPL, WMMD, and triple model.
problem Overfitting in GANs and noisy samples in VAEs.
method Bayesian non-parametric learning framework, integrating Wasserstein distance and maximum mean discrepancy.
result Superior performance across various generative tasks.
New autoencoder uses goodness-of-fit tests for better model performance.
problem Improving the goodness-of-fit in generative models.
method Develops Goodness-of-Fit Autoencoder (GoFAE) incorporating GoF tests at minibatch and global levels.
result GoFAE achieves comparable performance to deep generative models while retaining statistical indistinguishability.
Optimal transport offers an alternative to maximum likelihood for learning generative autoencoding models. We show that minimizing the p-Wasserstein distance between the generator and the true data distribution is equivalent to the unconstrained min-min optimization of the p-Wasserstein distance between the encoder agg…
The variational autoencoder (VAE) imposes a probabilistic distribution (typically Gaussian) on the latent space and penalizes the Kullback--Leibler (KL) divergence between the posterior and prior. In NLP, VAEs are extremely difficult to train due to the problem of KL collapsing to zero. One has to implement various heu…
iWGAN improves GANs by stabilizing training and preventing mode collapse.
problem Stable and effective training of GANs with mode collapse.
method iWGAN combines auto-encoders and WGANs using iterative primal dual optimization.
result iWGAN provides a clear stopping criterion and mitigates mode collapse.
Adversarial Networks and Autoencoders: The Primal-Dual Relationship and Generalization Boundsstat.ML
Since the introduction of Generative Adversarial Networks (GANs) and Variational Autoencoders (VAE), the literature on generative modelling has witnessed an overwhelming resurgence. The impressive, yet elusive empirical performance of GANs has lead to the rise of many GAN-VAE hybrids, with the hopes of GAN level perfor…
VCAE improves autoencoder quality on MNIST and CelebA.
problem Overfitting and poor generative/reconstruction quality in autoencoders.
method Proposes variance-constrained autoencoder (VCAE) to enforce variance constraint on latent distribution.
result VCAE outperforms Wasserstein Autoencoder and Variational Autoencoder in quality.
Paper proposes WGAIN for missing feature reconstruction.
problem Missing data in datasets.
method Wasserstein Generative Adversarial Imputation Network (WGAIN) compared to traditional methods.
result WGAIN outperforms traditional methods in imputing missing data.
Survey of GANs and autoencoders, addressing mode collapse and likelihood issues.
problem Addressing mode collapse and likelihood issues in GANs and autoencoders.
method Explains various GAN and autoencoder variants, their applications, and methods to resolve issues.
result Various methods to resolve mode collapse and improve likelihood in GANs and autoencoders.
Improved anomaly detection using adversarial mirrored autoencoders.
problem Detecting out-of-distribution samples in machine learning.
method Adversarial Mirrored Autoencoder (AMA) with latent space regularization.
result AMA improves anomaly detection performance on OOD detection benchmarks.
Minimum expected distance estimation (MEDE) algorithms have been widely used for probabilistic models with intractable likelihood functions and they have become increasingly popular due to their use in implicit generative modeling (e.g. Wasserstein generative adversarial networks, Wasserstein autoencoders). Emerging fr…
Deep Generative Models through the Lens of the Manifold Hypothesis: A Survey and New Connectionscs.LG
Survey and clarify manifold-supported data in deep generative models.
problem Understanding why some DGMs succeed or fail at low-dimensional data.
method Formal analysis and new model connections.
result DGMs on autoencoder representations minimize Wasserstein distance.
Hierarchical Hybrid Sliced Wasserstein: A Scalable Metric for Heterogeneous Joint Distributionscs.CV
Extends SW and GSW to compare heterogeneous joint distributions.
problem Limited applicability of SW and GSW to heterogeneous joint distributions.
method Introduces HHRT and PGRT to extend SW and GSW.
result H2SW distance for heterogeneous joint distributions.
Generative models with both discrete and continuous latent variables are highly motivated by the structure of many real-world data sets. They present, however, subtleties in training often manifesting in the discrete latent being under leveraged. In this paper, we show that such models are more amenable to training whe…
Generative flows learn distributions on low-dimensional manifolds robustly via Wasserstein proximals.
problem Learning distributions supported on low-dimensional manifolds robustly.
method Combining Wasserstein-1 and Wasserstein-2 proximal operators to formulate well-posed continuous-time generative flows.
result The combination of Wasserstein-1 and Wasserstein-2 proximals ensures the well-posedness of generative flows, leading to unique and robust learning.
Proposes QMC-based QSW for 3D SW distance.
problem Intractable SW distance in 3D.
method Quasi-Monte Carlo (QMC) for QSW approximations.
result QMC-based QSW improves SW estimation.
Gaussian AutoEncodercs.LG
Generative AutoEncoders require a chosen probability distribution in latent space, usually multivariate Gaussian. The original Variational AutoEncoder (VAE) uses randomness in encoder - causing problematic distortion, and overlaps in latent space for distinct inputs. It turned out unnecessary: we can instead use determ…
TC-VAE generates robust financial time series data with causal constraints.
problem Generating realistic financial time series data with causal relationships.
method TC-VAE with causality constraint, RealNVP prior, and Wasserstein distance.
result TC-VAE loss controls discrepancy between market and generated distributions.
We propose a new generative model, Cramer-Wold Autoencoder (CWAE). Following WAE, we directly encourage normality of the latent space. Our paper uses also the recent idea from Sliced WAE (SWAE) model, which uses one-dimensional projections as a method of verifying closeness of two distributions. The crucial new ingredi…
LANCA uses ANM to learn latent causal factors without supervision.
problem Learning latent causal factors without supervision.
method LANCA employs a deterministic Wasserstein Auto-Encoder coupled with a differentiable ANM Layer.
result LANCA outperforms baselines on physics and photorealistic environments.
The paper provides convergence guarantees for ODE-based generative models using transformers.
problem Theoretical guarantees for ODE-based generative models.
method A pre-trained autoencoder maps inputs to a latent space, and a transformer predicts the velocity field.
result The distribution of samples generated via estimated ODE flow converges to the target distribution in Wasserstein-2 distance.
We propose and study the problem of distribution-preserving lossy compression. Motivated by recent advances in extreme image compression which allow to maintain artifact-free reconstructions even at very low bitrates, we propose to optimize the rate-distortion tradeoff under the constraint that the reconstructed sample…
Generative Distribution Embeddings learn multiscale representations of distributions.
problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.
node2coords learns interpretable graph node representations robust to graph perturbations.
problem Need representations that capture graph structure and are robust to perturbations.
method Proposes a graph representation learning algorithm using Wasserstein barycenters.
result Learned representations are interpretable and stable to graph perturbations.
Proposes TNCM-VAE for generating causal financial time series.
problem Lack of causal reasoning in market generators.
method Combines VAE with structural causal models, enforcing causal constraints through DAGs and using causal Wasserstein distance.
result Superior performance in counterfactual probability estimation, L1 distances as low as 0.03-0.10.
This work analyzes VQ-VAEs using information theory, focusing on latent variables and their impact on generalization and data generation.
problem Lack of theoretical analysis for latent variables in unsupervised models like VQ-VAEs.
method Information-theoretic analysis, introducing a novel data-dependent prior.
result Derives a generalization error bound for VQ-VAEs that depends on LV complexity and encoder, not decoder.
Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Arestat.ML
Optimized GAN discriminator using polyharmonic interpolation.
problem Optimizing the discriminator in GANs with higher-order gradient regularization.
method Polyharmonic interpolation and variational calculus.
result The optimal discriminator is a polyharmonic radial basis function.