用优化方法替代训练过的图像生成先验,无需训练即可实现高质量文本到图像生成。
Training-Free Diffusion Priors for Text-to-Image Generation via Optimization-based Visual Inversion
- 通过优化视觉反演从随机伪标记初始化潜在图像表示,匹配文本嵌入。
- 在Kandinsky 2.2上达到与主流数据高效先验相当的定量指标,且视觉质量更高。
- 适用于追求零样本、免训练图像生成的开发者和研究者。
扩散模型在文本到图像生成中已达到领先水平,但其性能通常依赖于扩散先验网络,将文本嵌入映射到视觉空间以简化解码。这类先验计算成本高,需在大规模数据集上训练。本文挑战了训练先验的必要性,提出基于优化的视觉反演(OVI)作为无需训练、零样本的替代方案。OVI从随机伪标记初始化潜在视觉表示,并迭代优化以最大化其与输入文本提示嵌入的余弦相似度。我们进一步引入两种新约束——马氏距离与最近邻损失,以引导优化过程逼近真实图像分布。在Kandinsky 2.2上的实验表明,OVI可替代传统先验。更重要的是,分析揭示当前评估基准(如T2I-CompBench++)存在缺陷:仅使用文本嵌入作为先验即可获得较高分数,但感知质量较低。受约束的OVI方法显著提升视觉保真度,其中最近邻方法尤为有效,其定量得分可媲美甚至超过现有最先进的数据高效先验,证明优化策略在无需训练条件下具备成为可靠先验的潜力。代码将在论文接收后公开。
原文摘要 · Abstract (English)
Diffusion models have established the state-of-the-art in text-to-image generation, but their performance often relies on a diffusion prior network to translate text embeddings into the visual manifold for easier decoding. These priors are computationally expensive and require extensive training on massive datasets. In this work, we challenge the necessity of a trained prior at all by employing Optimization-based Visual Inversion (OVI), a training-free and zero-shot alternative, to replace the need for a prior. OVI initializes a latent visual representation from random pseudo-tokens and iteratively optimizes it to maximize the cosine similarity with the input textual prompt embedding. We further propose two novel constraints, a Mahalanobis-based and a Nearest-Neighbor loss, to regularize the OVI optimization process toward the distribution of realistic images. Our experiments, conducted on Kandinsky 2.2, show that OVI can serve as an alternative to traditional priors. More importantly, our analysis reveals a critical flaw in current evaluation benchmarks like T2I-CompBench++, where simply using the text embedding as a prior achieves surprisingly high scores, despite lower perceptual quality. Our constrained OVI methods improve visual fidelity over this baseline, with the Nearest-Neighbor approach proving particularly effective. It achieves quantitative scores comparable to or higher than the state-of-the-art data-efficient prior, underscoring the potential of optimization-based strategies as viable, training-free alternatives to traditional priors. The code will be publicly available upon acceptance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。