Research
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,695 papers · 148 categories

Trend · papers per month

133266398531 · Jun 202019922001200920172026
48 results for unpaired samples

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\ell_1-regularized estimation.
result Proposed GMM-type estimator is consistent as the number of environments grows.

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.

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.

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.

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.

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.

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.

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…

2018-04-16abs ↗pdf ↗

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.

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.

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.

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.

QDSB accelerates Schrödinger bridge learning with quantized approximations.

problem Learning generative models from unpaired samples.
method Quantized diffusion Schrödinger bridges (QDSB) using anchor-quantized distributions and cell-wise sampling.
result QDSB achieves sample quality similar to existing methods but with significantly less computational time.

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…

2019-01-14abs ↗pdf ↗

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.

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.

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.

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.

GER learns particle dynamics from unpaired snapshots using physics-informed GANs.

problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.

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…

2017-11-16abs ↗pdf ↗

Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples {(xi,yi)}i=1ni.i.d.p(x,y)\{(\mathbf{x}_i,\mathbf{y}_i)\}_{i=1}^n \stackrel{\mathrm{i.i.d.}}{\sim} p(\mathbf{x},\mathbf{y}). However, in many situations, it…

2019-09-05abs ↗pdf ↗

While generative models have shown great success in generating high-dimensional samples conditional on low-dimensional descriptors (learning e.g. stroke thickness in MNIST, hair color in CelebA, or speaker identity in Wavenet), their generation out-of-sample poses fundamental problems. The conditional variational autoe…

2019-10-04abs ↗pdf ↗

We consider inpainting in an unsupervised setting where there is neither access to paired nor unpaired training data. The only available information is provided by the uncomplete observations and the inpainting process statistics. In this context, an observation should give rise to several plausible reconstructions whi…

2019-12-18abs ↗pdf ↗

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.

Develops a contrastive framework for data-efficient multimodal learning.

problem Expensive training of multimodal generative models requiring related multimodal data.
method Contrastive framework for multimodal learning, distinguishing related from unrelated data.
result Data-efficient multimodal learning on challenging datasets for various VAE models.

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, …

2019-06-04abs ↗pdf ↗

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.

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…

2019-06-04abs ↗pdf ↗

RNA structures show that a significant portion of bases do not form hydrogen bonds.

problem Understanding the unpaired bases in RNA secondary structures.
method Comparing random words in free groups to RNA sequences, analyzing word lengths.
result The expected fraction of unpaired bases converges to a constant λ2λ_2.