用稀疏字典表示潜空间,提升生成模型的表达能力。
LASERS: LAtent Space Encoding for Representations with Sparsity for Generative Modeling
- 用字典稀疏表示替代VQ的离散量化,更灵活地建模潜空间
- 重建质量优于VQ方法,计算开销仅小幅增加
- 缓解代码本坍缩问题,揭示离散化非核心优势
学习紧凑且有意义的潜空间表示在视觉数据生成任务中已被证明非常有效。例如,在变分自编码器(如VQ-VAE、VQ-GAN)中应用向量量化(VQ),已在众多现代生成建模任务中达到顶尖性能。传统做法假设数据在潜空间中本质上是离散的(如同像素值)。本文提出一种替代性潜空间表示:放宽VQ的结构假设,转而假设潜空间可由一组子空间构成,对应于带稀疏约束的字典表示。该字典在训练过程中被学习和更新。我们将其应用于两种模型:字典学习变分自编码器(DL-VAE)与结合生成对抗网络的字典学习模型(DL-GAN)。实验表明,我们的方法在重建质量上优于VQ,潜空间表达力更强,仅带来轻微的计算开销。结果暗示,VQ的优势可能并非来自潜空间离散化,而是其对潜空间的有损压缩。我们进一步验证了该假设:稀疏表示同样能解决VQ类模型中常见的代码本坍缩问题。
原文摘要 · Abstract (English)
Learning compact and meaningful latent space representations has been shown to be very useful in generative modeling tasks for visual data. One particular example is applying Vector Quantization (VQ) in variational autoencoders (VQ-VAEs, VQ-GANs, etc.), which has demonstrated state-of-the-art performance in many modern generative modeling applications. Quantizing the latent space has been justified by the assumption that the data themselves are inherently discrete in the latent space (like pixel values). In this paper, we propose an alternative representation of the latent space by relaxing the structural assumption than the VQ formulation. Specifically, we assume that the latent space can be approximated by a union of subspaces model corresponding to a dictionary-based representation under a sparsity constraint. The dictionary is learned/updated during the training process. We apply this approach to look at two models: Dictionary Learning Variational Autoencoders (DL-VAEs) and DL-VAEs with Generative Adversarial Networks (DL-GANs). We show empirically that our more latent space is more expressive and has leads to better representations than the VQ approach in terms of reconstruction quality at the expense of a small computational overhead for the latent space computation. Our results thus suggest that the true benefit of the VQ approach might not be from discretization of the latent space, but rather the lossy compression of the latent space. We confirm this hypothesis by showing that our sparse representations also address the codebook collapse issue as found common in VQ-family models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。