跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.18394 · v1

Lipschitz-Constrained Discriminators in Generative Modeling: Asymptotic Behavior and Support Mismatch

首次提交 2026-11-14 00:38
版本更新 2026-11-14 00:38
雷达观测 2026-11-16 11:41
arXiv ↗PDF ↗

摘要

We study the asymptotic behavior of optimal discriminators associated to L−L-Lipschitz regularized KL-divergences of two probability distributions QQ and PP that interpolate between the rescaled Wasserstein−1-1 metric by some parameter L>0L>0 and the KL divergence. The parameter LL plays the role of a Lipschitz constraint and is viewed as a regularization parameter: small values of LL enforce a more geometry-aware discriminator, while as LL increases the geometric regularization is progressively relaxed. It is a known result [3] that such divergences converge to the KL divergence as L→∞L\to\infty. In this paper, we characterize the asymptotic behavior of the optimal discriminators as L→∞L\to\infty in different regimes: Firstly, under Q≪PQ\ll P and the Radon-Nikodym derivative dQdP\frac{dQ}{dP} is bounded from above and bounded away from zero. Secondly, when QQ and PP are discrete distributions satisfying Q≪PQ\ll P, and finally when QQ and PP are non absolutely continuous discrete distributions. This result motivates training strategies which involve discriminators, such as adversarial generative models. In practice, the data distribution is often represented by a discrete empirical measure, while, especially at the early stages of the training, the model distribution may have little or no overlap with the empirical data distribution.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-14 00:38 · 最新观测版本

Lipschitz-Constrained Discriminators in Generative Modeling: Asymptotic Behavior and Support Mismatch

We study the asymptotic behavior of optimal discriminators associated to L−L-Lipschitz regularized KL-divergences of two probability distributions QQ and PP that interpolate between the rescaled Wasserstein−1-1 metric by some parameter L>0L>0 and the KL divergence. The parameter LL plays the role of a Lipschitz constraint and is viewed as a regularization parameter: small values of LL enforce a more geometry-aware discriminator, while as LL increases the geometric regularization is progressively relaxed. It is a known result [3] that such divergences converge to the KL divergence as L→∞L\to\infty. In this paper, we characterize the asymptotic behavior of the optimal discriminators as L→∞L\to\infty in different regimes: Firstly, under Q≪PQ\ll P and the Radon-Nikodym derivative dQdP\frac{dQ}{dP} is bounded from above and bounded away from zero. Secondly, when QQ and PP are discrete distributions satisfying Q≪PQ\ll P, and finally when QQ and PP are non absolutely continuous discrete distributions. This result motivates training strategies which involve discriminators, such as adversarial generative models. In practice, the data distribution is often represented by a discrete empirical measure, while, especially at the early stages of the training, the model distribution may have little or no overlap with the empirical data distribution.

查看此版本解读 →查看此版本原文 ↗