Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Recent advances in optimal transport for machine learning
Recently, Optimal Transport has been proposed as a probabilistic framework in Machine
Learning for comparing and manipulating probability distributions. This is rooted in its rich …
Learning for comparing and manipulating probability distributions. This is rooted in its rich …
Improving and generalizing flow-based generative models with minibatch optimal transport
Continuous normalizing flows (CNFs) are an attractive generative modeling technique, but
they have thus far been held back by limitations in their simulation-based maximum …
they have thus far been held back by limitations in their simulation-based maximum …
Multisample flow matching: Straightening flows with minibatch couplings
Simulation-free methods for training continuous-time generative models construct probability
paths that go between noise distributions and individual data samples. Recent works, such …
paths that go between noise distributions and individual data samples. Recent works, such …
Scalable optimal transport methods in machine learning: A contemporary survey
Optimal Transport (OT) is a mathematical framework that first emerged in the eighteenth
century and has led to a plethora of methods for answering many theoretical and applied …
century and has led to a plethora of methods for answering many theoretical and applied …
Alignment and integration of spatial transcriptomics data
Spatial transcriptomics (ST) measures mRNA expression across thousands of spots from a
tissue slice while recording the two-dimensional (2D) coordinates of each spot. We …
tissue slice while recording the two-dimensional (2D) coordinates of each spot. We …
Unbalanced minibatch optimal transport; applications to domain adaptation
Optimal transport distances have found many applications in machine learning for their
capacity to compare non-parametric probability distributions. Yet their algorithmic complexity …
capacity to compare non-parametric probability distributions. Yet their algorithmic complexity …
Missing data imputation using optimal transport
Missing data is a crucial issue when applying machine learning algorithms to real-world
datasets. Starting from the simple assumption that two batches extracted randomly from the …
datasets. Starting from the simple assumption that two batches extracted randomly from the …
[PDF][PDF] Conditional flow matching: Simulation-free dynamic optimal transport
Continuous normalizing flows (CNFs) are an attractive generative modeling technique, but
they have thus far been held back by limitations in their simulation-based maximum …
they have thus far been held back by limitations in their simulation-based maximum …
Simulation-free schr\" odinger bridges via score and flow matching
We present simulation-free score and flow matching ([SF] $^ 2$ M), a simulation-free
objective for inferring stochastic dynamics given unpaired samples drawn from arbitrary …
objective for inferring stochastic dynamics given unpaired samples drawn from arbitrary …
Generating and imputing tabular data via diffusion and flow-based gradient-boosted trees
Tabular data is hard to acquire and is subject to missing values. This paper introduces a
novel approach for generating and imputing mixed-type (continuous and categorical) tabular …
novel approach for generating and imputing mixed-type (continuous and categorical) tabular …