用自洽桥模型生成与输入相似的新样本,提升采样效率与可控性。
Mirror Bridges Between Probability Measures
- 通过求解分布自身的薛定谔桥问题,实现输入样本的自然变体生成。
- 方法在多个任务中显著简化算法流程并控制分布内变化程度。
- 适合需要高质量近似样本生成的机器学习场景,如数据增强与模拟。
从密度未知的目标分布中重采样是数学统计与机器学习中的基础问题。当前主流方法是学习一个从易采样的先验分布(如高斯分布)到目标分布的映射,将先验样本前向传播以生成目标分布上的新样本。本文提出一种名为镜像桥(mirror bridge)的新模型,用于解决条件重采样问题——即生成与给定输入样本相近的新样本。关键洞察在于:求解同一分布间的薛定谔桥问题,可自然产生输入数据点的分布内变体。我们展示了如何高效估计这一被忽视的薛定谔桥问题的解。结果表明,该方法在算法上显著简化现有方案,并实现对分布内变异的精确控制。实验证明,这些优势可在多个应用领域中用于生成邻近样本。
原文摘要 · Abstract (English)
Resampling from a target measure whose density is unknown is a fundamental problem in mathematical statistics and machine learning. A setting that dominates the machine learning literature consists of learning a map from an easy-to-sample prior, such as the Gaussian distribution, to a target measure. Under this model, samples from the prior are pushed forward to generate a new sample on the target measure, which is often difficult to sample from directly. A related problem of particular interest is that of generating a new sample proximate to or otherwise conditioned on a given input sample. In this paper, we propose a new model called the mirror bridge to solve this problem of conditional resampling. Our key observation is that solving the Schrödinger bridge problem between a distribution and itself provides a natural way to produce new samples, giving in-distribution variations of an input data point. We demonstrate how to efficiently estimate the solution of this largely overlooked version of the Schrödinger bridge problem. We show that our proposed method leads to significant algorithmic simplifications over existing alternatives, in addition to providing control over in-distribution variation. Empirically, we demonstrate how these benefits can be leveraged to produce proximal samples in a number of application domains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。