UNSB uses neural Schrödinger Bridge to solve unpaired image-to-image translation.
problem Difficulties in unpaired image-to-image translation with diffusion models.
method Expresses SB problem as adversarial learning problems, incorporating advanced discriminators and regularization.
result Successfully solves various unpaired image-to-image translation tasks.
The paper tightens bounds for estimating Schrödinger potentials in unpaired data translation.
problem Estimating Schrödinger potentials in unpaired data translation.
method Using stochastic optimal control and Ornstein-Uhlenbeck process, the paper derives tight bounds on the generalization ability of an empirical risk minimizer.
result The approach achieves almost optimal convergence rates for Gaussian mixtures.
A new method for image translation without paired data.
problem Image-to-image translation between two domains with content preservation.
method Energy-based model in latent space of pretrained autoencoder.
result Improved translation quality and content preservation.
New algorithm computes Schrödinger Bridge for unpaired data translation.
problem Computing optimal transport maps for unpaired data translation.
method Schrödinger Bridge Flow, a discretization of a flow of path measures.
result Eliminates the need to train multiple DDM-like models.
Synthetic image translation has significant potentials in autonomous transportation systems. That is due to the expense of data collection and annotation as well as the unmanageable diversity of real-words situations. The main issue with unpaired image-to-image translation is the ill-posed nature of the problem. In thi…
Recent GAN-based architectures have been able to deliver impressive performance on the general task of image-to-image translation. In particular, it was shown that a wide variety of image translation operators may be learned from two image sets, containing images from two different domains, without establishing an expl…
We tackle unsupervised anomaly detection (UAD), a problem of detecting data that significantly differ from normal data. UAD is typically solved by using density estimation. Recently, deep neural network (DNN)-based density estimators, such as Normalizing Flows, have been attracting attention. However, one of their draw…
FDBM models use fractional Brownian motion to model complex stochastic processes.
problem Capturing memory effects and long-range dependencies in stochastic processes.
method Developed a generative diffusion bridge framework using a Markovian approximation of fractional Brownian motion.
result FDBM outperforms standard models in predicting future states and unpaired data translation.
There has been remarkable recent work in unpaired image-to-image translation. However, they're restricted to translation on single pairs of distributions, with some exceptions. In this study, we extend one of these works to a scalable multidistribution translation mechanism. Our translation models not only converts fro…
A new method improves robustness in image translation by modeling uncertainty.
problem Performance degradation in image translation models due to lack of robustness to outliers and uncertainty.
method UGAC method based on Uncertainty-aware Generalized Adaptive Cycle Consistency, modeling per-pixel residual with generalized Gaussian distribution.
result Our method exhibits stronger robustness towards unseen perturbations in test data.
Federated CycleGAN enables privacy-preserving image translation without central data.
problem Privacy and security issues in unsupervised image-to-image translation.
method Novel federated CycleGAN architecture that decomposes CycleGAN loss into client-specific local objectives.
result Federated CycleGAN achieves comparable performance to non-federated CycleGAN without central data exchange.
In the medical domain, the lack of large training data sets and benchmarks is often a limiting factor for training deep neural networks. In contrast to expensive manual labeling, computer simulations can generate large and fully labeled data sets with a minimum of manual effort. However, models that are trained on simu…
We present a framework for translating unlabeled images from one domain into analog images in another domain. We employ a progressively growing skip-connected encoder-generator structure and train it with a GAN loss for realistic output, a cycle consistency loss for maintaining same-domain translation identity, and a s…
Neural networks have proven their capabilities by outperforming many other approaches on regression or classification tasks on various kinds of data. Other astonishing results have been achieved using neural nets as data generators, especially in settings of generative adversarial networks (GANs). One special applicati…
OTRE uses OT to improve retinal images, outperforming existing methods.
problem Improving quality of non-mydriatic retinal images for accurate diagnoses.
method OT theory for image-to-image translation, regularization by enhancing.
result OTRE outperforms state-of-the-art methods on various retinal image tasks.
This research shows how to learn shared representations from unpaired data.
problem Learning shared representations from unpaired data.
method Spectral embeddings of random walk matrices from each unimodal representation.
result Shared representations can be learned almost exclusively from unpaired data.
NOT learns optimal transport plans, kernel costs improve performance.
problem NOT algorithm learns non-optimal plans with weak quadratic costs.
method Introduced kernel weak quadratic costs to improve NOT's performance.
result Kernel costs provide improved theoretical and practical guarantees.
Develops a semi-supervised learning method to generate missing neuroimaging modalities.
problem Lack of paired neuroimaging data for training and inference.
method Semi-Supervised Adversarial CycleGAN (SSA-CGAN) using adversarial and cycle losses.
result Improves reconstruction error and robustness to noise.
We propose a potential flow generator with L2 optimal transport regularity, which can be easily integrated into a wide range of generative models including different versions of GANs and flow-based models. We show the correctness and robustness of the potential flow generator in several 2D problems, and illustrate t…
Paper investigates multimodal contrastive learning and incorporates unpaired data.
problem Improving feature learning ability of multimodal models under noisy data.
method Initiates investigation of nonlinear loss functions for multimodal contrastive learning, analyzes performance, proposes new loss incorporating unpaired data.
result MMCL can outperform unimodal contrastive learning and robustly handle noisy data.
Domain Translation is the problem of finding a meaningful correspondence between two domains. Since in a majority of settings paired supervision is not available, much work focuses on Unsupervised Domain Translation (UDT) where data samples from each domain are unpaired. Following the seminal work of CycleGAN for UDT, …
Unpaired deep learning reconstructs MRI images from accelerated data.
problem Difficulty in acquiring matched fully sampled k-space data for supervised deep learning.
method Optimal transport driven cycleGAN architecture.
result Reconstructs high resolution MR images from accelerated k-space data.
The paper analyzes CycleGAN's error components for unpaired data generation.
problem Analyzing approximation and estimation errors in CycleGAN for unpaired data.
method Decomposes risk into approximation and estimation errors, analyzing each separately and considering their trade-offs.
result Theoretical insights into CycleGAN's performance through error analysis.
Text-based analysis methods allow to reveal privacy relevant author attributes such as gender, age and identify of the text's author. Such methods can compromise the privacy of an anonymous author even when the author tries to remove privacy sensitive content. In this paper, we propose an automatic method, called Adver…
Unpaired multi-domain causal representation learning is possible with sufficient conditions.
problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.
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.
Proposes a new method to improve target annotation in ATR.
problem Challenges in annotating automatic target recognition due to lack of labeled data.
method Hybrid contrastive learning and cycle-consistency-based transductive transfer learning (C3TTL) framework.
result Significantly lower Fréchet Inception Distance (FID) score and improved performance in annotating civilian and military vehicles, as well as ship targets.
Although voice conversion (VC) algorithms have achieved remarkable success along with the development of machine learning, superior performance is still difficult to achieve when using nonparallel data. In this paper, we propose using a cycle-consistent adversarial network (CycleGAN) for nonparallel data-based VC train…
In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…
Study on estimating causal effects with limited data and multiple environments.
problem Estimating causal effects under hidden confounding with unpaired data and sparse effects.
method Instrumental variable (IV) regression with cross-fold sample splitting and ℓ1-regularized estimation. result Proposed GMM-type estimator is consistent as the number of environments grows.
This paper tackles unpaired data in multi-view learning, proposing a new framework and models.
problem Handling unpaired data in multi-view learning, which is more common than paired data.
method Generalized uncorrelated multi-view subspace learning framework with successive alternating approximation (SAA) method.
result Proposed models perform competitively or better than baselines in multi-view feature extraction and multi-modality classification.
Paper analyzes CycleGAN solutions and symmetries.
problem CycleGAN image translation without paired data.
method Theoretical analysis of exact and approximate solutions.
result Exact solution space is invariant to automorphisms.
Model learns association between text and speech without paired data.
problem Learning association between text and speech with limited paired data.
method Noisy channel generative model with variational inference and KL encoder loss.
result Tiny paired data (5 minutes) sufficient to learn association.
The paper proves probabilistic alignment between unseen modalities using contrastive learning.
problem Aligning unseen modalities in unsupervised learning.
method Bayesian approach and direct comparison of contrastive representations.
result Direct comparison of contrastive representations recovers the same likelihood ratio as probabilistic graphical models.
Pseudo healthy synthesis, i.e. the creation of a subject-specific `healthy' image from a pathological one, could be helpful in tasks such as anomaly detection, understanding changes induced by pathology and disease or even as data augmentation. We treat this task as a factor decomposition problem: we aim to separate wh…
Paper presents a method to align unpaired samples across different modalities.
problem Challenges in collecting paired samples for multimodal representation learning.
method Uses propensity score alignment based on Rubin's framework to estimate a common space for unpaired samples.
result Optimal transport matching significantly improves alignment in real-world data.
New method identifies shared components from unpaired multimodal mixtures.
problem Identify shared components from unpaired multimodal mixtures.
method Distribution divergence minimization-based loss with sufficient conditions for identifiability.
result Sufficient conditions for shared component identifiability from unaligned multimodal mixtures.
Paper proposes a method to enhance low-quality retinal images using optimal transport.
problem Artifacts and imperfections in retinal images lead to diagnostic inaccuracies.
method Leveraging optimal transport theory, an unpaired image-to-image translation scheme is proposed.
result The method improves perceptually and quantitatively the quality of low-quality retinal images.
We present KERMIT, a simple insertion-based approach to generative modeling for sequences and sequence pairs. KERMIT models the joint distribution and its decompositions (i.e., marginals and conditionals) using a single neural network and, unlike much prior work, does not rely on a prespecified factorization of the dat…
The paper proposes a method to estimate joint probability from unpaired data using entropic transport kernels.
problem Estimating joint probability from unpaired data with unknown internal ordering.
method Maximum-likelihood inference, entropic optimal transport kernels, EMML algorithm.
result The method can recover true density from empirical approximations as the number of blocks increases.
Increasingly many real world tasks involve data in multiple modalities or views. This has motivated the development of many effective algorithms for learning a common latent space to relate multiple domains. However, most existing cross-view learning algorithms assume access to paired data for training. Their applicabi…
MFM improves generative model interpolations by learning approximate geodesics on data manifolds.
problem Straight interpolations fail to capture dynamics on data manifolds.
method Metric Flow Matching (MFM) learns approximate geodesics by minimizing kinetic energy of a data-induced Riemannian metric.
result MFM outperforms Euclidean baselines, achieving SOTA on single-cell trajectory prediction.
LightSBB-M improves generative diffusion modeling with lower 2-Wasserstein distances.
problem Improving generative diffusion models using Schrödinger Bridge and Bass methods.
method Optimizes SBB transport plan with dual representation and tunable beta parameter.
result Achieves up to 32% improvement in 2-Wasserstein distance on synthetic datasets.
Selfie and cartoon are two popular artistic forms that are widely presented in our daily life. Despite the great progress in image translation/stylization, few techniques focus specifically on selfie cartoonization, since cartoon images usually contain artistic abstraction (e.g., large smoothing areas) and exaggeration…
Spatial studies of transcriptome provide biologists with gene expression maps of heterogeneous and complex tissues. However, most experimental protocols for spatial transcriptomics suffer from the need to select beforehand a small fraction of genes to be quantified over the entire transcriptome. Standard single-cell RN…
A new framework for generative modeling using value-driven transport.
problem Developing efficient methods for generative modeling.
method A discrete-time stochastic control formulation of measure transport, formulated as a linear program with dual variables corresponding to the optimal value function.
result Well-trained VDT policies lead to straight transport paths that can be simulated quickly and robustly.
DPOT uses deep learning to compute optimal transport efficiently.
problem Computing optimal transport between continuous distributions from unpaired samples.
method DeepParticle methods for min-min optimization without network structure restrictions.
result Established weak convergence and error bounds between learned and optimal maps.
A new method combines energy-based models and entropy-regularized optimal transport.
problem Combining energy-based models and optimal transport for generative modeling.
method Energy-guided Entropic Neural Optimal Transport (E-ENT)
result Proves generalization bounds and validates scalability in image translation.