Paper tackles distribution matching by partially matching distributions, achieving robust results.
problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.
Proposes a non-adversarial method for distribution matching.
problem Stability and optimization challenges in adversarial matching methods.
method Non-adversarial VAE-based matching method with alignment upper bounds.
result Demonstrates applicability of non-adversarial matching methods without modifying original architectures.
Study efficient iterative method for distribution matching using sliced optimal transport.
problem Efficiently match distributions using sliced optimal transport.
method Slice-matching scheme based on sliced optimal transport, with quantitative non-asymptotic rates derived.
result Derive quantitative non-asymptotic rates for convergence to target distribution.
KD2M unifies feature matching in neural networks.
problem Matching neural network activations for knowledge transfer.
method Formalizes distribution matching strategy.
result New theoretical results for KD.
Flow matching KL divergence bound derived for smooth distributions.
problem Estimating smooth distributions efficiently.
method Deterministic upper bound on KL divergence derived from flow-matching loss.
result Flow matching achieves nearly minimax-optimal efficiency under TV distance.
L2M learns to match distributions for domain adaptation without relying on hand-crafted priors.
problem Difficult to directly match cross-domain distributions; existing methods fail to uncover underlying relationships.
method Learning to Match (L2M) framework that learns distribution matching loss using a meta-network in a data-driven way.
result L2M outperforms state-of-the-art methods on public datasets and transfers from pneumonia to COVID-19 images.
Generative models learn distributions, new method finds inputs matching desired conditional distributions.
problem Designing inputs that produce specific conditional distributions, not just points.
method Conditional Distribution Matching (CDM) and MLGD-F algorithm.
result MLGD-F reliably recovers inputs matching diverse user-specified conditional distributions.
Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.
problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.
We investigate the non-identifiability issues associated with bidirectional adversarial training for joint distribution matching. Within a framework of conditional entropy, we propose both adversarial and non-adversarial approaches to learn desirable matched joint distributions for unsupervised and supervised tasks. We…
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.
Augmented bridge matching preserves coupling information between distributions.
problem Preserving the original empirical pairing in flow and bridge matching processes.
method Augmenting the velocity field with initial sample point information.
result Simple modification recovers coupling information without losing Markovian property.
DDSME outperforms SME in estimating multimodal distributions.
problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.
Enhances DIM to match learned representations to a specific distribution.
problem Learning representations conforming to a specific distribution.
method Injecting noise into normalized outputs of the encoder while keeping the InfoMax training objective.
result Learning uniformly and normally distributed representations, as well as representations of other absolutely continuous distributions.
New method AM learns optimal vector fields for entire distribution sequences, matching OT.
problem Optimal Transport (OT) problem in generative modeling.
method Action Matching (AM) method learns optimal vector fields for a sequence of distributions.
result AM method achieves optimal transport by learning vector fields for entire distribution sequences.
Flow matching adapts to manifold structures without diffusion.
problem Theoretical understanding of flow matching in manifold-supported settings.
method Flow matching with linear interpolation on smooth manifolds, analyzing velocity field and density estimator.
result Non-asymptotic convergence guarantee and statistical consistency of flow matching on manifolds.
Paper introduces new approximations for lognormal sums, matching comonotonicity and moments.
problem Approximating sums of lognormal random variables accurately.
method Introduces new approximations based on weighted distribution theory, emphasizing comonotonicity and moment matching.
result Approximations perform better than classical methods, especially in the right tail of the distribution.
We introduce new families of Integral Probability Metrics (IPM) for training Generative Adversarial Networks (GAN). Our IPMs are based on matching statistics of distributions embedded in a finite dimensional feature space. Mean and covariance feature matching IPMs allow for stable training of GANs, which we will call M…
SIGMA model improves graph matching across various applications.
problem Graph matching problem in different domains.
method Stochastic Iterative Graph Matching (SIGMA) model with multi-step refinement and dummy nodes.
result SIGMA produces significantly improved graph matching results compared to state-of-the-art models.
Bayesian approach models match and non-match score distributions over continuous covariates.
problem Complex evaluation of model performance over continuous covariates in biometric verification.
method Generative model of score distributions, mixture models, local basis functions, Bayesian inference.
result Accurate and effective method for studying model performance over continuous covariates.
Proposes DWMD for better matching of hidden representations across domains.
problem Measuring data distribution discrepancy between semantically related domains for feature representation matching.
method DWMD, a moment-based probability distribution metric that explicitly orders and weights higher-order moments.
result DWMD is error-free and can strictly reflect distribution differences without feature distribution assumptions.
Score matching offers efficient estimation for certain distributions.
problem Estimating probability distributions with intractable constants.
method Score matching as an alternative to maximum likelihood.
result Score matching is computationally and statistically efficient for certain distributions.
Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…
SDM Policy accelerates inference for robotic tasks while maintaining high action quality.
problem Prolonged inference times in diffusion-based policies for high-frequency control tasks.
method Two-stage optimization: score matching and distribution matching; dual-teacher mechanism.
result 6x inference speedup with state-of-the-art action quality.
AR-CSM models use derivatives of univariate log-conditionals to estimate joint distributions efficiently.
problem Scalability and stability issues in training autoregressive models.
method Parameterize joint distribution using derivatives of univariate log-conditionals and introduce Composite Score Matching (CSM) for efficient training.
result AR-CSM models are more scalable and stable compared to previous score matching algorithms.
Paper quantifies label shift with robustness guarantees using distribution feature matching.
problem Estimating target label distribution under label shift.
method Distribution feature matching (DFM) framework and robustness analysis.
result General performance bound and robustness analysis in misspecified settings.
Improves generative models by using heavy-tailed noise in score matching.
problem High-dimensional limitations of Gaussian noise in generative models.
method Extended DSM to generalised normal distribution, relaxed key assumptions, developed iterative noise scaling algorithm.
result Heavy-tailed DSM leads to improved generative performance.
Generative models learn latent process to match target distributions.
problem Training flow-matching models with auxiliary stochastic dynamics.
method Introduces latent process generator matching, treating generative state as a deterministic image of a Markov process.
result Learn generator of a stochastic process with same marginal distributions.
A broad range of cross-m-domain generation researches boil down to matching a joint distribution by deep generative models (DGMs). Hitherto algorithms excel in pairwise domains while as m increases, remain struggling to scale themselves to fit a joint distribution. In this paper, we propose a domain-scalable DGM, i…
Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.
problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.
Flow Matching improves Wasserstein 1 distance convergence in high dimensions.
problem Improving Wasserstein 1 distance estimation for unbounded distributions.
method Flow Matching approach based on ODEs, controlling Lipschitz constant.
result Derives a convergence rate for Wasserstein 1 distance, improving previous results.
LFM learns a sequence of smaller models to generate data from noise.
problem Learning continuous, invertible flows between distributions.
method Stepwise Local Flow Matching (LFM) model, matching diffusion processes up to time-step size.
result LFM achieves competitive generative performance compared to Flow Matching.
FMI uses matching to mimic interventions for causal feature learning.
problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random…
Paper studies matching of samples from two distributions with a Gibbs probability weight.
problem Matching two independent i.i.d. samples from two distributions with a weighted cost.
method Uses chaos decomposition of polynomial functions of empirical distributions to derive asymptotics.
result Convergence of resulting random joint distribution to Schrödinger problem solution as N→∞.
Semi-Implicit Variational Inference (SIVI) is improved with SIVI-SM using score matching.
problem Intractable densities in variational distributions hinder SIVI training.
method SIVI-SM uses score matching to handle intractable densities in a minimax formulation.
result SIVI-SM outperforms ELBO-based SIVI methods in Bayesian inference tasks.
Proposes TSBP for matching topological signal distributions.
problem Matching signal distributions on topological domains.
method Topological Schrödinger Bridge (TSBP) with linear topology-aware stochastic dynamics.
result Derives closed-form topological SB (TSB) for Gaussian boundary distributions.
New algorithm preserves transport maps for better diffusion model training.
problem Training diffusion models with task-specific optimality structures.
method Generalized Schrödinger Bridge Matching (GSBM), inspired by conditional stochastic optimal control.
result GSBM better preserves transport maps, enabling stable convergence and improved scalability.
Simplifies denoising score matching for manifold learning.
problem Learning distributions on manifolds is computationally intensive.
method Modifies denoising score matching to implicitly account for the manifold.
result Reduces computational burden while maintaining efficiency.
We introduce a novel paradigm for learning non-parametric drift and diffusion functions for stochastic differential equation (SDE). The proposed model learns to simulate path distributions that match observations with non-uniform time increments and arbitrary sparseness, which is in contrast with gradient matching that…
A new variational inference method using Gaussian score matching.
problem Approximating posterior distributions in Bayesian statistics.
method Score matching principle applied to variational inference.
result Gaussian score matching VI (GSM-VI) is faster and requires fewer gradient evaluations.
This paper improves change-point detection for complex data streams using denoising score matching.
problem Timely identification of distributional shifts in high-dimensional, complex data streams.
method Score-based CUSUM change-point detection with denoising score matching.
result Denoising score matching enhances detection power by effectively controlling noise scale.
FAST selects coresets more efficiently by matching distributions in the frequency domain.
problem Efficiently selecting representative subsets of large datasets for deep learning.
method FAST uses spectral graph theory and CFD to match distributions, addressing limitations of existing methods.
result FAST significantly outperforms state-of-the-art coreset selection methods in accuracy and energy efficiency.
New method improves sampling from noisy energy models.
problem Training and sampling challenges in Energy-Based Models.
method Pseudo-Gibbs sampling with moment matching.
result Effective sampling from clean model using noisy DSM-trained model.
Unified framework for self-supervised learning via latent distribution matching.
problem Lack of a unifying theoretical framework for diverse SSL methods.
method Casting SSL as latent distribution matching (LDM): maximizing alignment and uniformity.
result Derives a Bayesian filtering model and proves identifiable latent representations.
Distilled models often fail to match teacher models, despite improving generalization.
problem The discrepancy between teacher and student predictive distributions remains large.
method Investigated the optimization difficulties and dataset details affecting student performance.
result Optimizing for matching the teacher does not always lead to better generalization.
Score matching efficiency tied to distribution isoperimetric properties.
problem Understanding when score matching is as efficient as maximum likelihood.
method Connecting score matching efficiency to isoperimetric constants of distributions.
result Score matching is statistically efficient when the distribution has a small isoperimetric constant.
Generative models are reinterpreted in statistical terms, enabling better understanding and inference.
problem Insufficient interpretability of generative models in statistical terms.
method Flow matching and orthogonalization/cross-fitting in double/debiased machine learning.
result Generative models can be used to estimate nuisance components while maintaining inferential validity.
Paper proposes a new method for training diffusion models using Markov operators.
problem Training efficiency and accuracy in diffusion models.
method Operator-informed score matching using spectral decomposition of Markov operators.
result Improved score matching for both low and high-dimensional distributions.